Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812900596.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 Peterson-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812900596
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 16K 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 8.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 35K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 201K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 100K 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 Peterson-PT-2-LTLFireability-00
FORMULA_NAME Peterson-PT-2-LTLFireability-01
FORMULA_NAME Peterson-PT-2-LTLFireability-02
FORMULA_NAME Peterson-PT-2-LTLFireability-03
FORMULA_NAME Peterson-PT-2-LTLFireability-04
FORMULA_NAME Peterson-PT-2-LTLFireability-05
FORMULA_NAME Peterson-PT-2-LTLFireability-06
FORMULA_NAME Peterson-PT-2-LTLFireability-07
FORMULA_NAME Peterson-PT-2-LTLFireability-08
FORMULA_NAME Peterson-PT-2-LTLFireability-09
FORMULA_NAME Peterson-PT-2-LTLFireability-10
FORMULA_NAME Peterson-PT-2-LTLFireability-11
FORMULA_NAME Peterson-PT-2-LTLFireability-12
FORMULA_NAME Peterson-PT-2-LTLFireability-13
FORMULA_NAME Peterson-PT-2-LTLFireability-14
FORMULA_NAME Peterson-PT-2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748939584861

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 08:33:05] [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 08:33:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 08:33:06] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2025-06-03 08:33:06] [INFO ] Transformed 102 places.
[2025-06-03 08:33:06] [INFO ] Transformed 126 transitions.
[2025-06-03 08:33:06] [INFO ] Found NUPN structural information;
[2025-06-03 08:33:06] [INFO ] Parsed PT model containing 102 places and 126 transitions and 384 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-PT-2-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 9 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2025-06-03 08:33:06] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2025-06-03 08:33:06] [INFO ] Computed 11 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:33:06] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-03 08:33:06] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2025-06-03 08:33:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:33:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-03 08:33:06] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2025-06-03 08:33:06] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2025-06-03 08:33:06] [INFO ] Invariant cache hit.
[2025-06-03 08:33:06] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 3/102 variables, 6/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:07] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:08] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:08] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:08] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:08] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:08] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:08] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:08] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:08] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:08] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:08] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:08] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:08] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:08] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:08] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:08] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:08] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:09] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:09] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:09] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:10] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 120/222 variables, 102/236 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 22/258 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 258 constraints, problems are : Problem set: 0 solved, 123 unsolved in 11330 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 21/122 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 6/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 120/222 variables, 102/236 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 22/258 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 123/381 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 381 constraints, problems are : Problem set: 0 solved, 123 unsolved in 9497 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20877ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 20896ms
Finished structural reductions in LTL mode , in 1 iterations and 21222 ms. Remains : 102/102 places, 126/126 transitions.
Support contains 60 out of 102 places after structural reductions.
[2025-06-03 08:33:27] [INFO ] Flatten gal took : 30 ms
[2025-06-03 08:33:27] [INFO ] Flatten gal took : 13 ms
[2025-06-03 08:33:27] [INFO ] Input system was already deterministic with 126 transitions.
Reduction of identical properties reduced properties to check from 28 to 25
RANDOM walk for 40000 steps (8 resets) in 1101 ms. (36 steps per ms) remains 7/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 542 ms. (73 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 5/7 properties
[2025-06-03 08:33:28] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2025-06-03 08:33:28] [INFO ] Invariant cache hit.
[2025-06-03 08:33:28] [INFO ] State equation strengthened by 22 read => feed constraints.
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/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 4 (OVERLAPS) 67/101 variables, 5/43 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 67/110 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 1/111 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:28] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 1/112 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/102 variables, 1/113 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 1/114 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 120/222 variables, 102/216 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 22/238 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/222 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 238 constraints, problems are : Problem set: 1 solved, 4 unsolved in 329 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 2/34 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 68/100 variables, 6/40 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 68/108 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 1/109 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 1/110 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:28] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 1/111 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:29] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 1/112 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:29] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 1/113 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/102 variables, 2/115 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 2/117 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:29] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:29] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:29] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 3/120 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:29] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:29] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:29] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 3/123 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 120/222 variables, 102/225 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/222 variables, 22/247 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/222 variables, 4/251 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:29] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:29] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:29] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/222 variables, 3/254 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:29] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/222 variables, 1/255 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/222 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/222 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 255 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1492 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1833ms problems are : Problem set: 1 solved, 4 unsolved
Parikh walk visited 1 properties in 386 ms.
Support contains 32 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 102 transition count 107
Reduce places removed 19 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 23 rules applied. Total rules applied 42 place count 83 transition count 103
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 46 place count 79 transition count 103
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 46 place count 79 transition count 91
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 70 place count 67 transition count 91
Applied a total of 70 rules in 24 ms. Remains 67 /102 variables (removed 35) and now considering 91/126 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 67/102 places, 91/126 transitions.
RANDOM walk for 40000 steps (8 resets) in 379 ms. (105 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 9518 steps, run visited all 3 properties in 39 ms. (steps per millisecond=244 )
Probabilistic random walk after 9518 steps, saw 2413 distinct states, run finished after 42 ms. (steps per millisecond=226 ) properties seen :3
FORMULA Peterson-PT-2-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 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' '!(F(p0))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 102 transition count 91
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 67 transition count 91
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 70 place count 67 transition count 75
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 102 place count 51 transition count 75
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 108 place count 48 transition count 72
Applied a total of 108 rules in 9 ms. Remains 48 /102 variables (removed 54) and now considering 72/126 (removed 54) transitions.
[2025-06-03 08:33:31] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
// Phase 1: matrix 66 rows 48 cols
[2025-06-03 08:33:31] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:33:31] [INFO ] Implicit Places using invariants in 62 ms returned [34, 36, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 64 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/102 places, 72/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 75 ms. Remains : 45/102 places, 72/126 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-01
Product exploration explored 100000 steps with 10420 reset in 290 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA Peterson-PT-2-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-01 finished in 547 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 15 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2025-06-03 08:33:31] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2025-06-03 08:33:32] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:33:32] [INFO ] Implicit Places using invariants in 57 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 58 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-02
Product exploration explored 100000 steps with 930 reset in 153 ms.
Stack based approach found an accepted trace after 56 steps with 0 reset with depth 57 and stack size 57 in 1 ms.
FORMULA Peterson-PT-2-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-02 finished in 366 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(p0)))'
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 102 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 66 transition count 90
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 72 place count 66 transition count 72
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 108 place count 48 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 42 transition count 66
Applied a total of 120 rules in 11 ms. Remains 42 /102 variables (removed 60) and now considering 66/126 (removed 60) transitions.
[2025-06-03 08:33:32] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
// Phase 1: matrix 60 rows 42 cols
[2025-06-03 08:33:32] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:33:32] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-03 08:33:32] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
[2025-06-03 08:33:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:33:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-03 08:33:32] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 08:33:32] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2025-06-03 08:33:32] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
[2025-06-03 08:33:32] [INFO ] Invariant cache hit.
[2025-06-03 08:33:32] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 3/42 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:33] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:33] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:33] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:33] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:33] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:33] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:33] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:33] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:33] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:33] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:33] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:33] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:33] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:33] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 14/67 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 60/102 variables, 42/109 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 22/131 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/102 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 131 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2139 ms.
Refiners :[Domain max(s): 42/42 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 42/42 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 3/42 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 60/102 variables, 42/109 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 22/131 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 63/194 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 12 (OVERLAPS) 0/102 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 194 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1730 ms.
Refiners :[Domain max(s): 42/42 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 42/42 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3884ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 3886ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/102 places, 66/126 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4020 ms. Remains : 42/102 places, 66/126 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-03
Product exploration explored 100000 steps with 12471 reset in 90 ms.
Stack based approach found an accepted trace after 33 steps with 5 reset with depth 6 and stack size 6 in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-03 finished in 4203 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((X(p1)||p0))&&X(X(p2))))) U p3))'
Support contains 24 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2025-06-03 08:33:36] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2025-06-03 08:33:36] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:33:36] [INFO ] Implicit Places using invariants in 53 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 55 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 296 ms :[(NOT p3), (OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) p2), (NOT p2), true]
Running random walk in product with property : Peterson-PT-2-LTLFireability-04
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLFireability-04 finished in 393 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)&&X(X(G((p1||X(X(F(!p2))))))))))'
Support contains 18 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2025-06-03 08:33:36] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2025-06-03 08:33:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:33:37] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-03 08:33:37] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2025-06-03 08:33:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:33:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-03 08:33:37] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2025-06-03 08:33:37] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2025-06-03 08:33:37] [INFO ] Invariant cache hit.
[2025-06-03 08:33:37] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 3/102 variables, 6/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:38] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:38] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:38] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:38] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:38] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:38] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:38] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:38] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:38] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:38] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:38] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:38] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:38] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:38] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:38] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:38] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:38] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:39] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:39] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:39] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:33:40] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 120/222 variables, 102/236 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 22/258 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 258 constraints, problems are : Problem set: 0 solved, 123 unsolved in 10339 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 21/122 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 3/102 variables, 6/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 120/222 variables, 102/236 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 22/258 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 123/381 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 381 constraints, problems are : Problem set: 0 solved, 123 unsolved in 9564 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19917ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 19918ms
Finished structural reductions in LTL mode , in 1 iterations and 20097 ms. Remains : 102/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, p2]
Running random walk in product with property : Peterson-PT-2-LTLFireability-06
Product exploration explored 100000 steps with 4195 reset in 98 ms.
Stack based approach found an accepted trace after 126 steps with 4 reset with depth 40 and stack size 40 in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-06 finished in 20457 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 12 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 102 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 66 transition count 90
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 72 place count 66 transition count 72
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 108 place count 48 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 42 transition count 66
Applied a total of 120 rules in 9 ms. Remains 42 /102 variables (removed 60) and now considering 66/126 (removed 60) transitions.
[2025-06-03 08:33:57] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
// Phase 1: matrix 60 rows 42 cols
[2025-06-03 08:33:57] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:33:57] [INFO ] Implicit Places using invariants in 48 ms returned [31, 33, 34]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 49 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/102 places, 66/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60 ms. Remains : 39/102 places, 66/126 transitions.
Stuttering acceptance computed with spot in 29 ms :[p0]
Running random walk in product with property : Peterson-PT-2-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 110 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-07 finished in 218 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) U p1)&&(p2 U !F(p1))&&F(p3))))'
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2025-06-03 08:33:57] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2025-06-03 08:33:57] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:33:57] [INFO ] Implicit Places using invariants in 58 ms returned [85, 87]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 59 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 100/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 239 ms :[true, true, true, p1, (NOT p3), (OR (NOT p0) (NOT p1)), p1]
Running random walk in product with property : Peterson-PT-2-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLFireability-08 finished in 337 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||X(p0)) U (G((p0||X(p0)))||(!p0&&X(p0))))))'
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 102 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 66 transition count 90
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 72 place count 66 transition count 73
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 106 place count 49 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 116 place count 44 transition count 68
Applied a total of 116 rules in 9 ms. Remains 44 /102 variables (removed 58) and now considering 68/126 (removed 58) transitions.
[2025-06-03 08:33:57] [INFO ] Flow matrix only has 62 transitions (discarded 6 similar events)
// Phase 1: matrix 62 rows 44 cols
[2025-06-03 08:33:57] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:33:58] [INFO ] Implicit Places using invariants in 41 ms returned [32, 34, 35]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 41 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/102 places, 68/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 53 ms. Remains : 41/102 places, 68/126 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-09
Product exploration explored 100000 steps with 2067 reset in 85 ms.
Stack based approach found an accepted trace after 212 steps with 4 reset with depth 30 and stack size 23 in 1 ms.
FORMULA Peterson-PT-2-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-09 finished in 236 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)&&(p1 U p2))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2025-06-03 08:33:58] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2025-06-03 08:33:58] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:33:58] [INFO ] Implicit Places using invariants in 53 ms returned [85, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 53 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 100/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (NOT p0), true, (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : Peterson-PT-2-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLFireability-10 finished in 232 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((X(X(p0)) U (p0 U p1)))||G(p2))))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2025-06-03 08:33:58] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2025-06-03 08:33:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:33:58] [INFO ] Implicit Places using invariants in 53 ms returned [85, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 53 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 100/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-2-LTLFireability-11
Product exploration explored 100000 steps with 442 reset in 145 ms.
Stack based approach found an accepted trace after 113 steps with 0 reset with depth 114 and stack size 114 in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-11 finished in 494 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))&&G((p1||X(p2)))))'
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2025-06-03 08:33:58] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2025-06-03 08:33:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:33:59] [INFO ] Implicit Places using invariants in 61 ms returned [87, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 62 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/102 places, 126/126 transitions.
Applied a total of 0 rules in 0 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 100/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p0), true]
Running random walk in product with property : Peterson-PT-2-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLFireability-12 finished in 274 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(p0)))||((!p1&&G(!p2)) U ((!p1&&G(!p2)&&X(F(p3)))||G((!p1&&G(!p2)))))))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2025-06-03 08:33:59] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2025-06-03 08:33:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:33:59] [INFO ] Implicit Places using invariants in 61 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 62 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 540 ms :[(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), (OR p2 (AND p1 (NOT p3))), (NOT p0), true, (NOT p0), (OR (NOT p3) p2), (NOT p0), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND p2 (NOT p0)), p2]
Running random walk in product with property : Peterson-PT-2-LTLFireability-14
Product exploration explored 100000 steps with 25000 reset in 113 ms.
Product exploration explored 100000 steps with 25000 reset in 118 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 p3) p0), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p2) p3))), (X (NOT p1)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
Knowledge based reduction with 11 factoid took 260 ms. Reduced automaton from 15 states, 37 edges and 4 AP (stutter sensitive) to 9 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 384 ms :[true, (OR (NOT p3) p2), (NOT p0), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), p2, (OR p2 (AND p1 (NOT p3))), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2))]
RANDOM walk for 40000 steps (8 resets) in 263 ms. (151 steps per ms) remains 4/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
[2025-06-03 08:34:00] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2025-06-03 08:34:00] [INFO ] Computed 8 invariants in 0 ms
[2025-06-03 08:34:00] [INFO ] State equation strengthened by 22 read => feed constraints.
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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 88/93 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 88/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/96 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 120/216 variables, 96/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 22/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3/219 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/219 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 228 constraints, problems are : Problem set: 0 solved, 4 unsolved in 205 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf2 is UNSAT
At refinement iteration 2 (OVERLAPS) 88/93 variables, 4/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 88/97 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:01] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:01] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:01] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 3/100 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/96 variables, 3/103 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 3/106 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 120/216 variables, 96/202 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 22/224 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 3/227 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/219 variables, 3/230 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 3/233 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/219 variables, 1/234 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/219 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/219 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 234 constraints, problems are : Problem set: 1 solved, 3 unsolved in 490 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 703ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 21 ms.
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 99 transition count 91
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 64 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 63 transition count 90
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 72 place count 63 transition count 74
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 104 place count 47 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 112 place count 43 transition count 70
Applied a total of 112 rules in 7 ms. Remains 43 /99 variables (removed 56) and now considering 70/126 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 43/99 places, 70/126 transitions.
RANDOM walk for 40000 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2337 steps, run visited all 1 properties in 6 ms. (steps per millisecond=389 )
Probabilistic random walk after 2337 steps, saw 595 distinct states, run finished after 6 ms. (steps per millisecond=389 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p3) p0), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p2) p3))), (X (NOT p1)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p1))), (G (OR p2 (NOT p3) p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (F (NOT p0)), (F (NOT (OR p1 p2 p3 p0))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p1) p2 p3))), (F p2), (F p3), (F p1), (F (NOT (OR (NOT p1) p2 p3 p0)))]
Knowledge based reduction with 12 factoid took 500 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 9 states, 18 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 358 ms :[true, (OR (NOT p3) p2), (NOT p0), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), p2, (OR p2 (AND p1 (NOT p3))), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 371 ms :[true, (OR (NOT p3) p2), (NOT p0), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), p2, (OR p2 (AND p1 (NOT p3))), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2))]
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2025-06-03 08:34:02] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2025-06-03 08:34:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:34:02] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-03 08:34:02] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2025-06-03 08:34:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:34:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-03 08:34:03] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2025-06-03 08:34:03] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2025-06-03 08:34:03] [INFO ] Invariant cache hit.
[2025-06-03 08:34:03] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 8/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:03] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:03] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:03] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:03] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:03] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:03] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:03] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:03] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:03] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:03] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:03] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:03] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:03] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:03] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:04] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:04] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:04] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:04] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:04] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 19/126 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:04] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 120/219 variables, 99/226 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 22/248 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 248 constraints, problems are : Problem set: 0 solved, 123 unsolved in 7391 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 8/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:10] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 120/219 variables, 99/227 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 22/249 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 123/372 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 0/219 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 372 constraints, problems are : Problem set: 0 solved, 123 unsolved in 9555 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16957ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 16959ms
Finished structural reductions in LTL mode , in 1 iterations and 17116 ms. Remains : 99/99 places, 126/126 transitions.
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 p3) p0 (NOT p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 9 states, 18 edges and 4 AP (stutter sensitive) to 9 states, 18 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 376 ms :[true, (OR (NOT p3) p2), (NOT p0), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), p2, (OR p2 (AND p1 (NOT p3))), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2))]
RANDOM walk for 40000 steps (8 resets) in 87 ms. (454 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 3/3 properties
[2025-06-03 08:34:20] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2025-06-03 08:34:20] [INFO ] Invariant cache hit.
[2025-06-03 08:34:20] [INFO ] State equation strengthened by 22 read => feed constraints.
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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 88/93 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 88/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/96 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 120/216 variables, 96/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 22/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3/219 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/219 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 228 constraints, problems are : Problem set: 0 solved, 3 unsolved in 131 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 88/93 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 88/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:20] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:20] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:20] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:21] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/96 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 120/216 variables, 96/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 22/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/219 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/219 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/219 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/219 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 235 constraints, problems are : Problem set: 0 solved, 3 unsolved in 482 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 618ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 31 ms.
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 99 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 63 transition count 90
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 72 place count 63 transition count 73
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 106 place count 46 transition count 73
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 114 place count 42 transition count 69
Applied a total of 114 rules in 4 ms. Remains 42 /99 variables (removed 57) and now considering 69/126 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 42/99 places, 69/126 transitions.
RANDOM walk for 40000 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1933 steps, run visited all 1 properties in 5 ms. (steps per millisecond=386 )
Probabilistic random walk after 1933 steps, saw 493 distinct states, run finished after 5 ms. (steps per millisecond=386 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) (NOT p3) p0 (NOT p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR p0 (NOT p1) p2))), (F p2), (F p3), (F (NOT (OR p0 (NOT p2)))), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p1), (F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 1 factoid took 419 ms. Reduced automaton from 9 states, 18 edges and 4 AP (stutter sensitive) to 9 states, 18 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 380 ms :[true, (OR (NOT p3) p2), (NOT p0), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), p2, (OR p2 (AND p1 (NOT p3))), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 381 ms :[true, (OR (NOT p3) p2), (NOT p0), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), p2, (OR p2 (AND p1 (NOT p3))), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 396 ms :[true, (OR (NOT p3) p2), (NOT p0), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), p2, (OR p2 (AND p1 (NOT p3))), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2))]
Product exploration explored 100000 steps with 25000 reset in 81 ms.
Product exploration explored 100000 steps with 25000 reset in 87 ms.
Applying partial POR strategy [true, true, true, false, true, true, false, false, false]
Stuttering acceptance computed with spot in 350 ms :[true, (OR (NOT p3) p2), (NOT p0), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), p2, (OR p2 (AND p1 (NOT p3))), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2))]
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 126/126 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 99 transition count 126
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 17 Pre rules applied. Total rules applied 24 place count 99 transition count 134
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 41 place count 99 transition count 134
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 59 place count 81 transition count 116
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 77 place count 81 transition count 116
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 92 place count 81 transition count 116
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 105 place count 68 transition count 103
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 118 place count 68 transition count 103
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 118 rules in 20 ms. Remains 68 /99 variables (removed 31) and now considering 103/126 (removed 23) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 08:34:23] [INFO ] Redundant transitions in 1 ms returned []
Running 100 sub problems to find dead transitions.
[2025-06-03 08:34:23] [INFO ] Flow matrix only has 97 transitions (discarded 6 similar events)
// Phase 1: matrix 97 rows 68 cols
[2025-06-03 08:34:23] [INFO ] Computed 8 invariants in 1 ms
[2025-06-03 08:34:23] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:23] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:23] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:23] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:23] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:23] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:24] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:24] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 3 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:24] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:24] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:24] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:24] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:24] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:24] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:24] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:24] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 3 ms to minimize.
Problem TDEAD90 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:24] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
Problem TDEAD93 is UNSAT
Problem TDEAD96 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 16/24 constraints. Problems are: Problem set: 33 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:24] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:24] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 2/26 constraints. Problems are: Problem set: 33 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/26 constraints. Problems are: Problem set: 33 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 97/165 variables, 68/94 constraints. Problems are: Problem set: 33 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 27/121 constraints. Problems are: Problem set: 33 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 08:34:25] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 1/122 constraints. Problems are: Problem set: 33 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/122 constraints. Problems are: Problem set: 33 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/165 variables, 0/122 constraints. Problems are: Problem set: 33 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 122 constraints, problems are : Problem set: 33 solved, 67 unsolved in 2732 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 68/68 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 33 solved, 67 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 33 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 19/24 constraints. Problems are: Problem set: 33 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/24 constraints. Problems are: Problem set: 33 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 25/68 variables, 3/27 constraints. Problems are: Problem set: 33 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/27 constraints. Problems are: Problem set: 33 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 97/165 variables, 68/95 constraints. Problems are: Problem set: 33 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 27/122 constraints. Problems are: Problem set: 33 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 67/189 constraints. Problems are: Problem set: 33 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/189 constraints. Problems are: Problem set: 33 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 0/165 variables, 0/189 constraints. Problems are: Problem set: 33 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 189 constraints, problems are : Problem set: 33 solved, 67 unsolved in 2665 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 68/68 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 67/100 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5408ms problems are : Problem set: 33 solved, 67 unsolved
Search for dead transitions found 33 dead transitions in 5409ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 68/99 places, 70/126 transitions.
Graph (complete) has 190 edges and 68 vertex of which 43 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 43 /68 variables (removed 25) and now considering 70/70 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/99 places, 70/126 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5449 ms. Remains : 43/99 places, 70/126 transitions.
Built C files in :
/tmp/ltsmin12405654314514110108
[2025-06-03 08:34:29] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12405654314514110108
Running compilation step : cd /tmp/ltsmin12405654314514110108;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 308 ms.
Running link step : cd /tmp/ltsmin12405654314514110108;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin12405654314514110108;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1566455246646745122.hoa' '--buchi-type=spotba'
LTSmin run took 71 ms.
FORMULA Peterson-PT-2-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-PT-2-LTLFireability-14 finished in 30360 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(F(p0))||G(p1))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 102 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 66 transition count 90
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 72 place count 66 transition count 73
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 106 place count 49 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 116 place count 44 transition count 68
Applied a total of 116 rules in 9 ms. Remains 44 /102 variables (removed 58) and now considering 68/126 (removed 58) transitions.
[2025-06-03 08:34:29] [INFO ] Flow matrix only has 62 transitions (discarded 6 similar events)
// Phase 1: matrix 62 rows 44 cols
[2025-06-03 08:34:29] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 08:34:29] [INFO ] Implicit Places using invariants in 48 ms returned [32, 34, 35]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 48 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/102 places, 68/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 59 ms. Remains : 41/102 places, 68/126 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-2-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 101 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-15 finished in 235 ms.
All properties solved by simple procedures.
Total runtime 83816 ms.

BK_STOP 1748939669841

--------------------
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="Peterson-PT-2"
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 Peterson-PT-2, 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 r142-tall-174876812900596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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