Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.5K Mar 7 05:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 7 05:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Mar 7 05:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 7 05:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 09:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 15 09:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 09:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 05:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Mar 7 05:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 7 05:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 7 05:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 121K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779761577357

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 02:12:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 02:12:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 02:13:00] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2026-05-26 02:13:00] [INFO ] Transformed 117 places.
[2026-05-26 02:13:00] [INFO ] Transformed 216 transitions.
[2026-05-26 02:13:00] [INFO ] Found NUPN structural information;
[2026-05-26 02:13:00] [INFO ] Parsed PT model containing 117 places and 216 transitions and 900 arcs in 413 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 116 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 116 transition count 213
Applied a total of 2 rules in 67 ms. Remains 116 /117 variables (removed 1) and now considering 213/216 (removed 3) transitions.
[2026-05-26 02:13:00] [INFO ] Flow matrix only has 150 transitions (discarded 63 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1789747992485030485.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3383954921346005268.kers'
[2026-05-26 02:13:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1789747992485030485.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3383954921346005268.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 150 rows 116 cols 348 entries
Finished phase 1 with 103 SingleSign rule and 3 generalized
[2026-05-26 02:13:00] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3383954921346005268.kers
Total runtime 3 ms.
[2026-05-26 02:13:01] [INFO ] Implicit Places using invariants in 436 ms returned []
[2026-05-26 02:13:01] [INFO ] Flow matrix only has 150 transitions (discarded 63 similar events)
[2026-05-26 02:13:01] [INFO ] Invariant cache hit.
[2026-05-26 02:13:01] [INFO ] State equation strengthened by 54 read => feed constraints.
[2026-05-26 02:13:01] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 926 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2026-05-26 02:13:01] [INFO ] Flow matrix only has 150 transitions (discarded 63 similar events)
[2026-05-26 02:13:01] [INFO ] Invariant cache hit.
[2026-05-26 02:13:01] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 150/266 variables, 116/148 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 54/202 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (OVERLAPS) 0/266 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 208 constraints, problems are : Problem set: 0 solved, 210 unsolved in 28617 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 116/116 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 150/266 variables, 116/156 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 54/210 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 210/420 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 11 (OVERLAPS) 0/266 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 2/426 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 266/266 variables, and 426 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 116/116 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58861ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 58891ms
Starting structural reductions in LTL mode, iteration 1 : 116/117 places, 213/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60084 ms. Remains : 116/117 places, 213/216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Applied a total of 0 rules in 9 ms. Remains 116 /116 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2026-05-26 02:14:00] [INFO ] Flow matrix only has 150 transitions (discarded 63 similar events)
[2026-05-26 02:14:00] [INFO ] Invariant cache hit.
[2026-05-26 02:14:00] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-26 02:14:00] [INFO ] Flow matrix only has 150 transitions (discarded 63 similar events)
[2026-05-26 02:14:00] [INFO ] Invariant cache hit.
[2026-05-26 02:14:01] [INFO ] State equation strengthened by 54 read => feed constraints.
[2026-05-26 02:14:01] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 458 ms. Remains : 116/116 places, 213/213 transitions.
Support contains 39 out of 116 places after structural reductions.
[2026-05-26 02:14:01] [INFO ] Flatten gal took : 62 ms
[2026-05-26 02:14:01] [INFO ] Flatten gal took : 29 ms
[2026-05-26 02:14:01] [INFO ] Input system was already deterministic with 213 transitions.
Reduction of identical properties reduced properties to check from 35 to 33
RANDOM walk for 40000 steps (8 resets) in 2846 ms. (14 steps per ms) remains 18/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 10/10 properties
[2026-05-26 02:14:02] [INFO ] Flow matrix only has 150 transitions (discarded 63 similar events)
[2026-05-26 02:14:02] [INFO ] Invariant cache hit.
[2026-05-26 02:14:02] [INFO ] State equation strengthened by 54 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 67/85 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/87 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 9 (OVERLAPS) 29/116 variables, 3/17 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 150/266 variables, 116/133 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 54/187 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 0/187 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/266 variables, 0/187 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 187 constraints, problems are : Problem set: 2 solved, 8 unsolved in 1375 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 116/116 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 68/82 variables, 5/6 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 3/9 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/84 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 4/14 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 32/116 variables, 3/17 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 2/19 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 150/266 variables, 116/135 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 54/189 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 8/197 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/197 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/266 variables, 2/199 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/199 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/266 variables, 0/199 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 199 constraints, problems are : Problem set: 2 solved, 8 unsolved in 1844 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 116/116 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 8/10 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3233ms problems are : Problem set: 2 solved, 8 unsolved
Parikh walk visited 0 properties in 3211 ms.
Support contains 14 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 213/213 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 115 transition count 212
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 2 place count 115 transition count 183
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 60 place count 86 transition count 183
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 65 place count 81 transition count 168
Iterating global reduction 2 with 5 rules applied. Total rules applied 70 place count 81 transition count 168
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 82 place count 75 transition count 162
Applied a total of 82 rules in 50 ms. Remains 75 /116 variables (removed 41) and now considering 162/213 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 75/116 places, 162/213 transitions.
RANDOM walk for 40000 steps (8 resets) in 351 ms. (113 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 19934 steps, run visited all 8 properties in 210 ms. (steps per millisecond=94 )
Probabilistic random walk after 19934 steps, saw 5195 distinct states, run finished after 217 ms. (steps per millisecond=91 ) properties seen :8
FORMULA EisenbergMcGuire-PT-03-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA EisenbergMcGuire-PT-03-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&F(!p1)) U (G((!p0&&F(!p1)))||(!p0&&F(!p1)&&X(G(p1))))))'
Support contains 5 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 211
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 114 transition count 211
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 4 place count 114 transition count 181
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 64 place count 84 transition count 181
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 79 transition count 166
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 79 transition count 166
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 86 place count 73 transition count 160
Applied a total of 86 rules in 35 ms. Remains 73 /116 variables (removed 43) and now considering 160/213 (removed 53) transitions.
[2026-05-26 02:14:10] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8099289056288858101.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10265219071062708543.kers'
[2026-05-26 02:14:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8099289056288858101.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10265219071062708543.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 73 cols 242 entries
Finished phase 1 with 60 SingleSign rule and 3 generalized
[2026-05-26 02:14:10] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10265219071062708543.kers
Total runtime 1 ms.
[2026-05-26 02:14:10] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-26 02:14:10] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2026-05-26 02:14:10] [INFO ] Invariant cache hit.
[2026-05-26 02:14:10] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-26 02:14:11] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2026-05-26 02:14:11] [INFO ] Redundant transitions in 5 ms returned []
Running 157 sub problems to find dead transitions.
[2026-05-26 02:14:11] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2026-05-26 02:14:11] [INFO ] Invariant cache hit.
[2026-05-26 02:14:11] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 97/170 variables, 73/102 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 44/146 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 0/170 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 147 constraints, problems are : Problem set: 0 solved, 157 unsolved in 11949 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 97/170 variables, 73/107 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 44/151 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 157/308 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/170 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/170 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 13 (OVERLAPS) 0/170 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 312 constraints, problems are : Problem set: 0 solved, 157 unsolved in 20234 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32219ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 32221ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/116 places, 160/213 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32652 ms. Remains : 73/116 places, 160/213 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&F(!p1)) U (G((!p0&&F(!p1)))||(!p0&&F(!p1)&&X(G(p1))))))'
Stuttering acceptance computed with spot in 402 ms :[(NOT p1), (AND (NOT p1) p0), true, (OR p1 p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 542 ms.
Product exploration explored 100000 steps with 0 reset in 383 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 13 factoid took 97 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 550 ms. (72 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
Probably explored full state space saw : 5810 states, properties seen :3
Probabilistic random walk after 23240 steps, saw 5810 distinct states, run finished after 111 ms. (steps per millisecond=209 ) properties seen :3
Explored full state space saw : 5810 states, properties seen :0
Exhaustive walk after 23240 steps, saw 5810 distinct states, run finished after 72 ms. (steps per millisecond=322 ) properties seen :0
Found 1 invariant AP formulas.
Negative knowledge disproves property using: (G (NOT p0))
Knowledge based reduction with 14 factoid took 46 ms. Proved property starting from automaton with 3 states, 6 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 778 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-00 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-00 finished in 34890 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(G(!p0))&&(p1||X(X(!p2))))) U ((!p0&&X((X(G(!p0))&&(p1||X(X(!p2))))))||X(G((X(G(!p0))&&(p1||X(X(!p2)))))))))'
Support contains 5 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 111 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 111 transition count 198
Applied a total of 10 rules in 9 ms. Remains 111 /116 variables (removed 5) and now considering 198/213 (removed 15) transitions.
[2026-05-26 02:14:45] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8205341148233512328.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1366884581458801853.kers'
[2026-05-26 02:14:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8205341148233512328.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1366884581458801853.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 135 rows 111 cols 318 entries
Finished phase 1 with 98 SingleSign rule and 3 generalized
[2026-05-26 02:14:45] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1366884581458801853.kers
Total runtime 1 ms.
[2026-05-26 02:14:45] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-26 02:14:45] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2026-05-26 02:14:45] [INFO ] Invariant cache hit.
[2026-05-26 02:14:45] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-26 02:14:45] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2026-05-26 02:14:45] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2026-05-26 02:14:45] [INFO ] Invariant cache hit.
[2026-05-26 02:14:45] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 135/246 variables, 111/147 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 44/191 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (OVERLAPS) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 193 constraints, problems are : Problem set: 0 solved, 195 unsolved in 27640 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 135/246 variables, 111/149 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 44/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 195/388 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 3/391 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 391 constraints, problems are : Problem set: 0 solved, 195 unsolved in 22773 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50444ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 50446ms
Starting structural reductions in LTL mode, iteration 1 : 111/116 places, 198/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50925 ms. Remains : 111/116 places, 198/213 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(G(!p0))&&(p1||X(X(!p2))))) U (X(G((X(G(!p0))&&(p1||X(X(!p2))))))||(!p0&&X((X(G(!p0))&&(p1||X(X(!p2)))))))))'
Stuttering acceptance computed with spot in 422 ms :[(OR p0 (AND (NOT p1) p2)), (OR p0 (AND (NOT p1) p2)), p0, p2, true, p2, p0, p0]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 290 ms.
Product exploration explored 100000 steps with 0 reset in 216 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 5 factoid took 131 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 78670 steps, run visited all 1 properties in 300 ms. (steps per millisecond=262 )
Probabilistic random walk after 78670 steps, saw 20464 distinct states, run finished after 300 ms. (steps per millisecond=262 ) properties seen :1
Negative knowledge disproves property using: (G (NOT p0))
Knowledge based reduction with 5 factoid took 84 ms. Proved property starting from automaton with 4 states, 5 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 553 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-01 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-01 finished in 52493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(F(p1))))))'
Support contains 4 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 111 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 111 transition count 198
Applied a total of 10 rules in 15 ms. Remains 111 /116 variables (removed 5) and now considering 198/213 (removed 15) transitions.
[2026-05-26 02:15:37] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2026-05-26 02:15:37] [INFO ] Invariant cache hit.
[2026-05-26 02:15:38] [INFO ] Implicit Places using invariants in 154 ms returned []
[2026-05-26 02:15:38] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2026-05-26 02:15:38] [INFO ] Invariant cache hit.
[2026-05-26 02:15:38] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-26 02:15:38] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 111/116 places, 198/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 522 ms. Remains : 111/116 places, 198/213 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(F(p1))))))'
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 180 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-02 finished in 1013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(p1 U p2))))'
Support contains 7 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 116 transition count 210
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 113 transition count 210
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 6 place count 113 transition count 181
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 64 place count 84 transition count 181
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 81 transition count 172
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 81 transition count 172
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 82 place count 75 transition count 166
Applied a total of 82 rules in 36 ms. Remains 75 /116 variables (removed 41) and now considering 166/213 (removed 47) transitions.
[2026-05-26 02:15:39] [INFO ] Flow matrix only has 103 transitions (discarded 63 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1757770316375319779.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17542985022864391977.kers'
[2026-05-26 02:15:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1757770316375319779.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17542985022864391977.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 103 rows 75 cols 254 entries
Finished phase 1 with 62 SingleSign rule and 3 generalized
[2026-05-26 02:15:39] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17542985022864391977.kers
Total runtime 4 ms.
[2026-05-26 02:15:39] [INFO ] Implicit Places using invariants in 176 ms returned []
[2026-05-26 02:15:39] [INFO ] Flow matrix only has 103 transitions (discarded 63 similar events)
[2026-05-26 02:15:39] [INFO ] Invariant cache hit.
[2026-05-26 02:15:39] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-26 02:15:39] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2026-05-26 02:15:39] [INFO ] Redundant transitions in 10 ms returned []
Running 163 sub problems to find dead transitions.
[2026-05-26 02:15:39] [INFO ] Flow matrix only has 103 transitions (discarded 63 similar events)
[2026-05-26 02:15:39] [INFO ] Invariant cache hit.
[2026-05-26 02:15:39] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 103/178 variables, 75/109 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 48/157 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 158 constraints, problems are : Problem set: 0 solved, 163 unsolved in 12693 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 103/178 variables, 75/111 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 48/159 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 163/322 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 324 constraints, problems are : Problem set: 0 solved, 163 unsolved in 18881 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31625ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 31628ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/116 places, 166/213 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32142 ms. Remains : 75/116 places, 166/213 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&p2)))'
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 248 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-04 finished in 32543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 5 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 211
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 114 transition count 211
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 4 place count 114 transition count 182
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 62 place count 85 transition count 182
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 67 place count 80 transition count 167
Iterating global reduction 2 with 5 rules applied. Total rules applied 72 place count 80 transition count 167
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 84 place count 74 transition count 161
Applied a total of 84 rules in 29 ms. Remains 74 /116 variables (removed 42) and now considering 161/213 (removed 52) transitions.
[2026-05-26 02:16:11] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10308960315250356829.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5953482225135724332.kers'
[2026-05-26 02:16:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10308960315250356829.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5953482225135724332.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 74 cols 244 entries
Finished phase 1 with 61 SingleSign rule and 3 generalized
[2026-05-26 02:16:11] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5953482225135724332.kers
Total runtime 1 ms.
[2026-05-26 02:16:11] [INFO ] Implicit Places using invariants in 172 ms returned []
[2026-05-26 02:16:11] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2026-05-26 02:16:11] [INFO ] Invariant cache hit.
[2026-05-26 02:16:11] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-26 02:16:11] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2026-05-26 02:16:11] [INFO ] Redundant transitions in 9 ms returned []
Running 158 sub problems to find dead transitions.
[2026-05-26 02:16:11] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2026-05-26 02:16:11] [INFO ] Invariant cache hit.
[2026-05-26 02:16:11] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 98/172 variables, 74/97 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 44/141 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 0/172 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 0/172 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 13 (OVERLAPS) 0/172 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 146 constraints, problems are : Problem set: 0 solved, 158 unsolved in 19539 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 98/172 variables, 74/105 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 44/149 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 158/307 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 0/172 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 307 constraints, problems are : Problem set: 0 solved, 158 unsolved in 13099 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32674ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 32677ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/116 places, 161/213 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33153 ms. Remains : 74/116 places, 161/213 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 195 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 EisenbergMcGuire-PT-03-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-07 finished in 33503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(F(p0)) U p1) U X(X(p0)))))'
Support contains 4 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 111 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 111 transition count 198
Applied a total of 10 rules in 3 ms. Remains 111 /116 variables (removed 5) and now considering 198/213 (removed 15) transitions.
[2026-05-26 02:16:45] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12340357319541016176.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11554659712972298489.kers'
[2026-05-26 02:16:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12340357319541016176.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11554659712972298489.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 135 rows 111 cols 318 entries
Finished phase 1 with 98 SingleSign rule and 3 generalized
[2026-05-26 02:16:45] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11554659712972298489.kers
Total runtime 1 ms.
[2026-05-26 02:16:45] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-26 02:16:45] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2026-05-26 02:16:45] [INFO ] Invariant cache hit.
[2026-05-26 02:16:45] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-26 02:16:45] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2026-05-26 02:16:45] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2026-05-26 02:16:45] [INFO ] Invariant cache hit.
[2026-05-26 02:16:45] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 135/246 variables, 111/147 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 44/191 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (OVERLAPS) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 193 constraints, problems are : Problem set: 0 solved, 195 unsolved in 26163 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 135/246 variables, 111/149 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 44/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 195/388 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 3/391 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 391 constraints, problems are : Problem set: 0 solved, 195 unsolved in 22744 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48932ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 48933ms
Starting structural reductions in LTL mode, iteration 1 : 111/116 places, 198/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49346 ms. Remains : 111/116 places, 198/213 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(F(p0)) U p1) U X(X(p0)))))'
Stuttering acceptance computed with spot in 519 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-08
Product exploration explored 100000 steps with 9 reset in 271 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-08 finished in 50201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (X(X(F(((X(!p2)&&F(p3))||G(!p2)))))&&p1)))'
Support contains 7 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 111 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 111 transition count 198
Applied a total of 10 rules in 5 ms. Remains 111 /116 variables (removed 5) and now considering 198/213 (removed 15) transitions.
[2026-05-26 02:17:35] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2026-05-26 02:17:35] [INFO ] Invariant cache hit.
[2026-05-26 02:17:35] [INFO ] Implicit Places using invariants in 178 ms returned []
[2026-05-26 02:17:35] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2026-05-26 02:17:35] [INFO ] Invariant cache hit.
[2026-05-26 02:17:35] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-26 02:17:35] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 111/116 places, 198/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 508 ms. Remains : 111/116 places, 198/213 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (X(X(F(((X(!p2)&&F(p3))||G(!p2)))))&&p1)))'
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p1) p2), (NOT p0), p2, p2, p2, (AND (NOT p3) p2)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 108 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 EisenbergMcGuire-PT-03-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-09 finished in 978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(X(p1))) U X((p2&&G(!p3)))))'
Support contains 6 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 113 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 113 transition count 204
Applied a total of 6 rules in 4 ms. Remains 113 /116 variables (removed 3) and now considering 204/213 (removed 9) transitions.
[2026-05-26 02:17:36] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10532160333517558395.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4497618648741827332.kers'
[2026-05-26 02:17:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10532160333517558395.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4497618648741827332.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 141 rows 113 cols 330 entries
Finished phase 1 with 100 SingleSign rule and 3 generalized
[2026-05-26 02:17:36] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4497618648741827332.kers
Total runtime 2 ms.
[2026-05-26 02:17:36] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-26 02:17:36] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
[2026-05-26 02:17:36] [INFO ] Invariant cache hit.
[2026-05-26 02:17:36] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-26 02:17:36] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2026-05-26 02:17:36] [INFO ] Flow matrix only has 141 transitions (discarded 63 similar events)
[2026-05-26 02:17:36] [INFO ] Invariant cache hit.
[2026-05-26 02:17:36] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 141/254 variables, 113/144 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 48/192 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 0/254 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 193 constraints, problems are : Problem set: 0 solved, 201 unsolved in 23886 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 113/113 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 141/254 variables, 113/146 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 48/194 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 201/395 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 4/399 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (OVERLAPS) 0/254 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 254/254 variables, and 400 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 113/113 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53947ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 53948ms
Starting structural reductions in LTL mode, iteration 1 : 113/116 places, 204/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54479 ms. Remains : 113/116 places, 204/213 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(p0))||p1) U X((G(!p2)&&p3))))'
Stuttering acceptance computed with spot in 539 ms :[(OR (NOT p3) p2), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (OR (NOT p3) p2), (NOT p0), (AND p2 (NOT p0)), true, (AND (NOT p0) p2), p2, p2]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-10 finished in 55079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p0) U p1))&&((p1 U p2)||G(p3)))))'
Support contains 8 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 111 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 111 transition count 198
Applied a total of 10 rules in 6 ms. Remains 111 /116 variables (removed 5) and now considering 198/213 (removed 15) transitions.
[2026-05-26 02:18:31] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13288723993955199633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16309682722746257938.kers'
[2026-05-26 02:18:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13288723993955199633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16309682722746257938.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 135 rows 111 cols 318 entries
Finished phase 1 with 98 SingleSign rule and 3 generalized
[2026-05-26 02:18:31] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16309682722746257938.kers
Total runtime 3 ms.
[2026-05-26 02:18:31] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-26 02:18:31] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2026-05-26 02:18:31] [INFO ] Invariant cache hit.
[2026-05-26 02:18:31] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-26 02:18:31] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2026-05-26 02:18:31] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2026-05-26 02:18:31] [INFO ] Invariant cache hit.
[2026-05-26 02:18:31] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 135/246 variables, 111/147 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 44/191 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (OVERLAPS) 0/246 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 193 constraints, problems are : Problem set: 0 solved, 195 unsolved in 25640 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 135/246 variables, 111/149 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 44/193 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 195/388 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 3/391 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 391 constraints, problems are : Problem set: 0 solved, 195 unsolved in 21462 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47125ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 47126ms
Starting structural reductions in LTL mode, iteration 1 : 111/116 places, 198/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47616 ms. Remains : 111/116 places, 198/213 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p0) U p1))&&((p1 U p2)||G(p3)))))'
Stuttering acceptance computed with spot in 426 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-11
Product exploration explored 100000 steps with 3 reset in 187 ms.
Product exploration explored 100000 steps with 0 reset in 218 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 20 factoid took 132 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 189 ms. (210 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
[2026-05-26 02:19:19] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2026-05-26 02:19:19] [INFO ] Invariant cache hit.
[2026-05-26 02:19:20] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/54 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/72 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 90/162 variables, 72/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/169 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 10/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/181 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/181 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/181 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 20/201 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/201 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/203 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/203 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 9/212 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/212 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 34/246 variables, 31/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/246 variables, 22/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/246 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/246 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/54 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 90/162 variables, 72/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/169 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 10/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/169 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/181 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/181 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/181 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 20/201 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/201 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/203 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/203 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 9/212 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/212 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 34/246 variables, 31/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/246 variables, 22/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/246 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/246 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 167 constraints, problems are : Problem set: 0 solved, 1 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 686ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 111 transition count 195
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 108 transition count 195
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 6 place count 108 transition count 166
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 64 place count 79 transition count 166
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 76 place count 73 transition count 160
Applied a total of 76 rules in 25 ms. Remains 73 /111 variables (removed 38) and now considering 160/198 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 73/111 places, 160/198 transitions.
RANDOM walk for 40000 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 258 steps, run visited all 1 properties in 7 ms. (steps per millisecond=36 )
Probabilistic random walk after 258 steps, saw 184 distinct states, run finished after 7 ms. (steps per millisecond=36 ) properties seen :1
Negative knowledge disproves property using: (G p3)
Knowledge based reduction with 20 factoid took 107 ms. Proved property starting from automaton with 6 states, 9 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 1123 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-11 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-11 finished in 49633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 116 transition count 210
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 113 transition count 210
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 6 place count 113 transition count 180
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 66 place count 83 transition count 180
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 79 transition count 168
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 79 transition count 168
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 86 place count 73 transition count 162
Applied a total of 86 rules in 26 ms. Remains 73 /116 variables (removed 43) and now considering 162/213 (removed 51) transitions.
[2026-05-26 02:19:20] [INFO ] Flow matrix only has 99 transitions (discarded 63 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11723325778774749925.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16337379351478750085.kers'
[2026-05-26 02:19:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11723325778774749925.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16337379351478750085.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 99 rows 73 cols 246 entries
Finished phase 1 with 60 SingleSign rule and 3 generalized
[2026-05-26 02:19:20] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16337379351478750085.kers
Total runtime 1 ms.
[2026-05-26 02:19:21] [INFO ] Implicit Places using invariants in 145 ms returned []
[2026-05-26 02:19:21] [INFO ] Flow matrix only has 99 transitions (discarded 63 similar events)
[2026-05-26 02:19:21] [INFO ] Invariant cache hit.
[2026-05-26 02:19:21] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-26 02:19:21] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2026-05-26 02:19:21] [INFO ] Redundant transitions in 3 ms returned []
Running 159 sub problems to find dead transitions.
[2026-05-26 02:19:21] [INFO ] Flow matrix only has 99 transitions (discarded 63 similar events)
[2026-05-26 02:19:21] [INFO ] Invariant cache hit.
[2026-05-26 02:19:21] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 99/172 variables, 73/101 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 46/147 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/172 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 147 constraints, problems are : Problem set: 0 solved, 159 unsolved in 9846 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (OVERLAPS) 99/172 variables, 73/102 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 46/148 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 159/307 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (OVERLAPS) 0/172 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 310 constraints, problems are : Problem set: 0 solved, 159 unsolved in 14315 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24189ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 24190ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/116 places, 162/213 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24663 ms. Remains : 73/116 places, 162/213 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 132 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-12 finished in 24883 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p2)||p1)))))'
Support contains 6 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 211
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 114 transition count 211
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 4 place count 114 transition count 181
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 64 place count 84 transition count 181
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 79 transition count 166
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 79 transition count 166
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 86 place count 73 transition count 160
Applied a total of 86 rules in 16 ms. Remains 73 /116 variables (removed 43) and now considering 160/213 (removed 53) transitions.
[2026-05-26 02:19:45] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5776805307820238146.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4023876226613130996.kers'
[2026-05-26 02:19:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5776805307820238146.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4023876226613130996.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 73 cols 242 entries
Finished phase 1 with 60 SingleSign rule and 3 generalized
[2026-05-26 02:19:45] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4023876226613130996.kers
Total runtime 1 ms.
[2026-05-26 02:19:45] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-26 02:19:45] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2026-05-26 02:19:45] [INFO ] Invariant cache hit.
[2026-05-26 02:19:46] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-26 02:19:46] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2026-05-26 02:19:46] [INFO ] Redundant transitions in 2 ms returned []
Running 157 sub problems to find dead transitions.
[2026-05-26 02:19:46] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2026-05-26 02:19:46] [INFO ] Invariant cache hit.
[2026-05-26 02:19:46] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 97/170 variables, 73/106 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 44/150 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 0/170 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 150 constraints, problems are : Problem set: 0 solved, 157 unsolved in 14662 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 97/170 variables, 73/109 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 44/153 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 157/310 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 3/313 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/170 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/170 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 13 (OVERLAPS) 0/170 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/170 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 15 (OVERLAPS) 0/170 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 316 constraints, problems are : Problem set: 0 solved, 157 unsolved in 27839 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42521ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 42522ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/116 places, 160/213 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42905 ms. Remains : 73/116 places, 160/213 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p2)||p1)))))'
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 119 ms.
Product exploration explored 100000 steps with 0 reset in 135 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 11 factoid took 68 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 5 to 3
RANDOM walk for 40000 steps (8 resets) in 162 ms. (245 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
Probably explored full state space saw : 5871 states, properties seen :2
Probabilistic random walk after 23484 steps, saw 5871 distinct states, run finished after 88 ms. (steps per millisecond=266 ) properties seen :2
Explored full state space saw : 5871 states, properties seen :0
Exhaustive walk after 23484 steps, saw 5871 distinct states, run finished after 41 ms. (steps per millisecond=572 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge based reduction with 12 factoid took 126 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 620 ms.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 6 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 160/160 transitions.
Applied a total of 0 rules in 5 ms. Remains 73 /73 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2026-05-26 02:20:29] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2026-05-26 02:20:29] [INFO ] Invariant cache hit.
[2026-05-26 02:20:29] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-26 02:20:29] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2026-05-26 02:20:29] [INFO ] Invariant cache hit.
[2026-05-26 02:20:30] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-26 02:20:30] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2026-05-26 02:20:30] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 297 ms. Remains : 73/73 places, 160/160 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 5 factoid took 57 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 6838 steps, run visited all 2 properties in 30 ms. (steps per millisecond=227 )
Probabilistic random walk after 6838 steps, saw 2011 distinct states, run finished after 31 ms. (steps per millisecond=220 ) properties seen :2
Knowledge based reduction with 5 factoid took 77 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 369 ms.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 131 ms.
Product exploration explored 100000 steps with 0 reset in 146 ms.
Built C files in :
/tmp/ltsmin915463275073905796
[2026-05-26 02:20:31] [INFO ] Computing symmetric may disable matrix : 160 transitions.
[2026-05-26 02:20:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:20:31] [INFO ] Computing symmetric may enable matrix : 160 transitions.
[2026-05-26 02:20:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:20:31] [INFO ] Computing Do-Not-Accords matrix : 160 transitions.
[2026-05-26 02:20:31] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:20:31] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin915463275073905796
Running compilation step : cd /tmp/ltsmin915463275073905796;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 645 ms.
Running link step : cd /tmp/ltsmin915463275073905796;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin915463275073905796;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18211425028728436979.hoa' '--buchi-type=spotba'
LTSmin run took 143 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-13 finished in 46235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 116 transition count 210
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 113 transition count 210
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 6 place count 113 transition count 181
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 64 place count 84 transition count 181
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 79 transition count 166
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 79 transition count 166
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 86 place count 73 transition count 160
Applied a total of 86 rules in 14 ms. Remains 73 /116 variables (removed 43) and now considering 160/213 (removed 53) transitions.
[2026-05-26 02:20:32] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11646393247565733137.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4363887074196180140.kers'
[2026-05-26 02:20:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11646393247565733137.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4363887074196180140.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 73 cols 242 entries
Finished phase 1 with 60 SingleSign rule and 3 generalized
[2026-05-26 02:20:32] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4363887074196180140.kers
Total runtime 1 ms.
[2026-05-26 02:20:32] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-26 02:20:32] [INFO ] Flow matrix only has 97 transitions (discarded 63 similar events)
[2026-05-26 02:20:32] [INFO ] Invariant cache hit.
[2026-05-26 02:20:32] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-26 02:20:32] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2026-05-26 02:20:32] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/116 places, 160/213 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 283 ms. Remains : 73/116 places, 160/213 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLFireability-15
Product exploration explored 100000 steps with 769 reset in 110 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLFireability-15 finished in 450 ms.
All properties solved by simple procedures.
Total runtime 452561 ms.

BK_STOP 1779762032506

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is EisenbergMcGuire-PT-03, 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 r114-smll-177955740500236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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