Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366000204.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 Anderson-PT-11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366000204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.6K Mar 4 18:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 4 18:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 4 18:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 4 18:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 4 18:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 4 18:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 4 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 4 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:04 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 1.6M 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 Anderson-PT-11-LTLFireability-00
FORMULA_NAME Anderson-PT-11-LTLFireability-01
FORMULA_NAME Anderson-PT-11-LTLFireability-02
FORMULA_NAME Anderson-PT-11-LTLFireability-03
FORMULA_NAME Anderson-PT-11-LTLFireability-04
FORMULA_NAME Anderson-PT-11-LTLFireability-05
FORMULA_NAME Anderson-PT-11-LTLFireability-06
FORMULA_NAME Anderson-PT-11-LTLFireability-07
FORMULA_NAME Anderson-PT-11-LTLFireability-08
FORMULA_NAME Anderson-PT-11-LTLFireability-09
FORMULA_NAME Anderson-PT-11-LTLFireability-10
FORMULA_NAME Anderson-PT-11-LTLFireability-11
FORMULA_NAME Anderson-PT-11-LTLFireability-12
FORMULA_NAME Anderson-PT-11-LTLFireability-13
FORMULA_NAME Anderson-PT-11-LTLFireability-14
FORMULA_NAME Anderson-PT-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779465044982

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 15:50:46] [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-22 15:50:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 15:50:46] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2026-05-22 15:50:46] [INFO ] Transformed 749 places.
[2026-05-22 15:50:46] [INFO ] Transformed 3245 transitions.
[2026-05-22 15:50:46] [INFO ] Found NUPN structural information;
[2026-05-22 15:50:46] [INFO ] Parsed PT model containing 749 places and 3245 transitions and 12540 arcs in 343 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Anderson-PT-11-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 749 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 749/749 places, 3245/3245 transitions.
Discarding 197 places :
Symmetric choice reduction at 0 with 197 rule applications. Total rules 197 place count 552 transition count 1228
Iterating global reduction 0 with 197 rules applied. Total rules applied 394 place count 552 transition count 1228
Applied a total of 394 rules in 112 ms. Remains 552 /749 variables (removed 197) and now considering 1228/3245 (removed 2017) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4355540093053409464.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3913725675743273577.kers'
[2026-05-22 15:50:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4355540093053409464.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3913725675743273577.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1228 rows 552 cols 4442 entries
Finished phase 1 with 254 SingleSign rule and 273 generalized
[2026-05-22 15:50:47] [INFO ] Computed 25 invariants in 5 ms
Computed 25 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3913725675743273577.kers
Total runtime 7 ms.
[2026-05-22 15:50:48] [INFO ] Implicit Places using invariants in 1089 ms returned []
[2026-05-22 15:50:48] [INFO ] Invariant cache hit.
[2026-05-22 15:50:48] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-22 15:50:52] [INFO ] Implicit Places using invariants and state equation in 3941 ms returned []
Implicit Place search using SMT with State Equation took 5095 ms to find 0 implicit places.
Running 1217 sub problems to find dead transitions.
[2026-05-22 15:50:52] [INFO ] Invariant cache hit.
[2026-05-22 15:50:52] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 1217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 1217 unsolved
SMT process timed out in 31186ms, After SMT, problems are : Problem set: 0 solved, 1217 unsolved
Search for dead transitions found 0 dead transitions in 31219ms
Starting structural reductions in LTL mode, iteration 1 : 552/749 places, 1228/3245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36495 ms. Remains : 552/749 places, 1228/3245 transitions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 1228/1228 transitions.
Applied a total of 0 rules in 11 ms. Remains 552 /552 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2026-05-22 15:51:23] [INFO ] Invariant cache hit.
[2026-05-22 15:51:24] [INFO ] Implicit Places using invariants in 589 ms returned []
[2026-05-22 15:51:24] [INFO ] Invariant cache hit.
[2026-05-22 15:51:24] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-22 15:51:27] [INFO ] Implicit Places using invariants and state equation in 3706 ms returned []
Implicit Place search using SMT with State Equation took 4307 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 4320 ms. Remains : 552/552 places, 1228/1228 transitions.
Support contains 48 out of 552 places after structural reductions.
[2026-05-22 15:51:28] [INFO ] Flatten gal took : 109 ms
[2026-05-22 15:51:28] [INFO ] Flatten gal took : 60 ms
[2026-05-22 15:51:28] [INFO ] Input system was already deterministic with 1228 transitions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 40000 steps (8 resets) in 2001 ms. (19 steps per ms) remains 16/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 13/13 properties
[2026-05-22 15:51:29] [INFO ] Invariant cache hit.
[2026-05-22 15:51:29] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 518/539 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/539 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 4/543 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 6 (OVERLAPS) 9/552 variables, 8/25 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1228/1780 variables, 552/577 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1780 variables, 110/687 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1780 variables, 0/687 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/1780 variables, 0/687 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1780/1780 variables, and 687 constraints, problems are : Problem set: 1 solved, 12 unsolved in 4083 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 552/552 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 517/536 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/536 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/536 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 7/543 variables, 3/17 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 9/552 variables, 8/25 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1228/1780 variables, 552/577 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1780 variables, 110/687 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1780 variables, 12/699 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1780/1780 variables, and 699 constraints, problems are : Problem set: 1 solved, 12 unsolved in 5031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 552/552 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 12/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9159ms problems are : Problem set: 1 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1228/1228 transitions.
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 109 Pre rules applied. Total rules applied 0 place count 552 transition count 1119
Deduced a syphon composed of 109 places in 1 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 0 with 218 rules applied. Total rules applied 218 place count 443 transition count 1119
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 231 place count 430 transition count 906
Iterating global reduction 0 with 13 rules applied. Total rules applied 244 place count 430 transition count 906
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 246 place count 429 transition count 905
Applied a total of 246 rules in 150 ms. Remains 429 /552 variables (removed 123) and now considering 905/1228 (removed 323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 429/552 places, 905/1228 transitions.
RANDOM walk for 40000 steps (8 resets) in 516 ms. (77 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 266 ms. (149 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 5/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 70 ms. (563 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 158 ms. (251 steps per ms) remains 3/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17926050628263770197.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11413177977099973944.kers'
[2026-05-22 15:51:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17926050628263770197.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11413177977099973944.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 905 rows 429 cols 3376 entries
Finished phase 1 with 131 SingleSign rule and 273 generalized
[2026-05-22 15:51:38] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11413177977099973944.kers
Total runtime 5 ms.
[2026-05-22 15:51:38] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 373/379 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 40/419 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 10/429 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/429 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/429 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 905/1334 variables, 429/458 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1334 variables, 110/568 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1334 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1334 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1334/1334 variables, and 568 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2566 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 429/429 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 373/379 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 40/419 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 10/429 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 905/1334 variables, 429/458 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1334 variables, 110/568 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1334 variables, 3/571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1334 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1334 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1334/1334 variables, and 571 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1693 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 429/429 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4304ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 2414 steps, including 42 resets, run visited all 3 properties in 27 ms. (steps per millisecond=89 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 36 ms.
FORMULA Anderson-PT-11-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA Anderson-PT-11-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&(G(p1)||F(p2))))'
Support contains 3 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 1228/1228 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 531 transition count 847
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 531 transition count 847
Applied a total of 42 rules in 43 ms. Remains 531 /552 variables (removed 21) and now considering 847/1228 (removed 381) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15376627323794862276.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5188640193761497383.kers'
[2026-05-22 15:51:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15376627323794862276.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5188640193761497383.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 847 rows 531 cols 2924 entries
Finished phase 1 with 233 SingleSign rule and 273 generalized
[2026-05-22 15:51:44] [INFO ] Computed 25 invariants in 13 ms
Computed 25 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-5188640193761497383.kers
Total runtime 21 ms.
[2026-05-22 15:51:45] [INFO ] Implicit Places using invariants in 864 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 876 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 530/552 places, 847/1228 transitions.
Applied a total of 0 rules in 24 ms. Remains 530 /530 variables (removed 0) and now considering 847/847 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 943 ms. Remains : 530/552 places, 847/1228 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))&&(G(p1)||F(p2))))'
Stuttering acceptance computed with spot in 396 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p0), true]
Running random walk in product with property : Anderson-PT-11-LTLFireability-00
Product exploration explored 100000 steps with 28 reset in 271 ms.
Stack based approach found an accepted trace after 13520 steps with 3 reset with depth 10584 and stack size 7045 in 57 ms.
FORMULA Anderson-PT-11-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-00 finished in 1812 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 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 1228/1228 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 552 transition count 1118
Deduced a syphon composed of 110 places in 2 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 442 transition count 1118
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 242 place count 420 transition count 736
Iterating global reduction 0 with 22 rules applied. Total rules applied 264 place count 420 transition count 736
Applied a total of 264 rules in 79 ms. Remains 420 /552 variables (removed 132) and now considering 736/1228 (removed 492) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-480183984214991018.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17363137079835162691.kers'
[2026-05-22 15:51:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-480183984214991018.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17363137079835162691.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 736 rows 420 cols 2702 entries
Finished phase 1 with 122 SingleSign rule and 273 generalized
[2026-05-22 15:51:45] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17363137079835162691.kers
Total runtime 6 ms.
[2026-05-22 15:51:46] [INFO ] Implicit Places using invariants in 724 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 739 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 419/552 places, 736/1228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 419 transition count 616
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 299 transition count 616
Applied a total of 240 rules in 22 ms. Remains 299 /419 variables (removed 120) and now considering 616/736 (removed 120) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1944761045427603478.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10764020262195225280.kers'
[2026-05-22 15:51:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1944761045427603478.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10764020262195225280.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 616 rows 299 cols 2220 entries
Finished phase 1 with 123 SingleSign rule and 152 generalized
[2026-05-22 15:51:46] [INFO ] Computed 24 invariants in 2 ms
Computed 24 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10764020262195225280.kers
Total runtime 6 ms.
[2026-05-22 15:51:47] [INFO ] Implicit Places using invariants in 417 ms returned []
[2026-05-22 15:51:47] [INFO ] Invariant cache hit.
[2026-05-22 15:51:47] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-22 15:51:48] [INFO ] Implicit Places using invariants and state equation in 1249 ms returned []
Implicit Place search using SMT with State Equation took 1670 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 299/552 places, 616/1228 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2511 ms. Remains : 299/552 places, 616/1228 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 63 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-01
Product exploration explored 100000 steps with 8 reset in 262 ms.
Stack based approach found an accepted trace after 164 steps with 0 reset with depth 165 and stack size 165 in 0 ms.
FORMULA Anderson-PT-11-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-01 finished in 2886 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(X(X(X(F(p0)))))) U (p1||(p0 U p2))))'
Support contains 5 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 1228/1228 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 531 transition count 867
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 531 transition count 867
Applied a total of 42 rules in 41 ms. Remains 531 /552 variables (removed 21) and now considering 867/1228 (removed 361) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4557292077044290681.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12810046952664905756.kers'
[2026-05-22 15:51:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4557292077044290681.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12810046952664905756.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 867 rows 531 cols 3006 entries
Finished phase 1 with 233 SingleSign rule and 273 generalized
[2026-05-22 15:51:48] [INFO ] Computed 25 invariants in 12 ms
Computed 25 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-12810046952664905756.kers
Total runtime 15 ms.
[2026-05-22 15:51:49] [INFO ] Implicit Places using invariants in 899 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 925 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 530/552 places, 867/1228 transitions.
Applied a total of 0 rules in 11 ms. Remains 530 /530 variables (removed 0) and now considering 867/867 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 977 ms. Remains : 530/552 places, 867/1228 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(X(X(X(F(p0)))))) U ((p0 U p1)||p2)))'
Stuttering acceptance computed with spot in 633 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-11-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 203 ms.
Stack based approach found an accepted trace after 74 steps with 0 reset with depth 75 and stack size 75 in 0 ms.
FORMULA Anderson-PT-11-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-02 finished in 1875 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((X((p1 U p2)) U (!p3&&X((p1 U p2)))))||p0)))'
Support contains 6 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 1228/1228 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 531 transition count 867
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 531 transition count 867
Applied a total of 42 rules in 31 ms. Remains 531 /552 variables (removed 21) and now considering 867/1228 (removed 361) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1851085945790811612.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16256618477606733048.kers'
[2026-05-22 15:51:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1851085945790811612.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16256618477606733048.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 867 rows 531 cols 3006 entries
Finished phase 1 with 233 SingleSign rule and 273 generalized
[2026-05-22 15:51:50] [INFO ] Computed 25 invariants in 13 ms
Computed 25 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-16256618477606733048.kers
Total runtime 14 ms.
[2026-05-22 15:51:51] [INFO ] Implicit Places using invariants in 628 ms returned []
[2026-05-22 15:51:51] [INFO ] Invariant cache hit.
[2026-05-22 15:51:51] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-22 15:51:54] [INFO ] Implicit Places using invariants and state equation in 3476 ms returned []
Implicit Place search using SMT with State Equation took 4121 ms to find 0 implicit places.
Running 856 sub problems to find dead transitions.
[2026-05-22 15:51:54] [INFO ] Invariant cache hit.
[2026-05-22 15:51:54] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 856 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1398 variables, and 38 constraints, problems are : Problem set: 0 solved, 856 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/531 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 856/856 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 856 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 856 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1398 variables, and 38 constraints, problems are : Problem set: 0 solved, 856 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/531 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/856 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60468ms problems are : Problem set: 0 solved, 856 unsolved
Search for dead transitions found 0 dead transitions in 60471ms
Starting structural reductions in LTL mode, iteration 1 : 531/552 places, 867/1228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64630 ms. Remains : 531/552 places, 867/1228 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((X((p1 U p2)) U (!p3&&X((p1 U p2)))))||p0)))'
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)), (OR (NOT p2) p3), (NOT p2), true]
Running random walk in product with property : Anderson-PT-11-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 331 ms.
Product exploration explored 100000 steps with 50000 reset in 299 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 3 factoid took 76 ms. Proved property starting from automaton with 5 states, 7 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 85 ms.
FORMULA Anderson-PT-11-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-11-LTLFireability-03 finished in 65564 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)))'
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 1228/1228 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 552 transition count 1118
Deduced a syphon composed of 110 places in 2 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 442 transition count 1118
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 242 place count 420 transition count 736
Iterating global reduction 0 with 22 rules applied. Total rules applied 264 place count 420 transition count 736
Applied a total of 264 rules in 71 ms. Remains 420 /552 variables (removed 132) and now considering 736/1228 (removed 492) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2628756951882269246.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4844178689611596264.kers'
[2026-05-22 15:52:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2628756951882269246.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4844178689611596264.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 736 rows 420 cols 2702 entries
Finished phase 1 with 122 SingleSign rule and 273 generalized
[2026-05-22 15:52:56] [INFO ] Computed 25 invariants in 16 ms
Computed 25 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-4844178689611596264.kers
Total runtime 18 ms.
[2026-05-22 15:52:57] [INFO ] Implicit Places using invariants in 852 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 854 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 419/552 places, 736/1228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 419 transition count 616
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 299 transition count 616
Applied a total of 240 rules in 13 ms. Remains 299 /419 variables (removed 120) and now considering 616/736 (removed 120) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4755584041150466131.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1919643336981875272.kers'
[2026-05-22 15:52:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4755584041150466131.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1919643336981875272.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 616 rows 299 cols 2220 entries
Finished phase 1 with 123 SingleSign rule and 152 generalized
[2026-05-22 15:52:57] [INFO ] Computed 24 invariants in 2 ms
Computed 24 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1919643336981875272.kers
Total runtime 3 ms.
[2026-05-22 15:52:57] [INFO ] Implicit Places using invariants in 307 ms returned []
[2026-05-22 15:52:57] [INFO ] Invariant cache hit.
[2026-05-22 15:52:57] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-22 15:52:58] [INFO ] Implicit Places using invariants and state equation in 1243 ms returned []
Implicit Place search using SMT with State Equation took 1567 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 299/552 places, 616/1228 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2505 ms. Remains : 299/552 places, 616/1228 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)))'
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-04
Product exploration explored 100000 steps with 1 reset in 154 ms.
Stack based approach found an accepted trace after 59 steps with 0 reset with depth 60 and stack size 60 in 1 ms.
FORMULA Anderson-PT-11-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-04 finished in 2772 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 ((G(p2) U p3)&&F(!p1)))))'
Support contains 8 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 1228/1228 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 552 transition count 1118
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 442 transition count 1118
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 240 place count 422 transition count 778
Iterating global reduction 0 with 20 rules applied. Total rules applied 260 place count 422 transition count 778
Applied a total of 260 rules in 34 ms. Remains 422 /552 variables (removed 130) and now considering 778/1228 (removed 450) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15409095251376475848.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14037543569792058400.kers'
[2026-05-22 15:52:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15409095251376475848.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14037543569792058400.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 778 rows 422 cols 2870 entries
Finished phase 1 with 124 SingleSign rule and 273 generalized
[2026-05-22 15:52:59] [INFO ] Computed 25 invariants in 5 ms
Computed 25 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14037543569792058400.kers
Total runtime 7 ms.
[2026-05-22 15:52:59] [INFO ] Implicit Places using invariants in 719 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 721 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 421/552 places, 778/1228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 421 transition count 682
Reduce places removed 96 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 107 rules applied. Total rules applied 203 place count 325 transition count 671
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 214 place count 314 transition count 671
Applied a total of 214 rules in 27 ms. Remains 314 /421 variables (removed 107) and now considering 671/778 (removed 107) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3965002824746142939.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9069371034898286654.kers'
[2026-05-22 15:52:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3965002824746142939.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9069371034898286654.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 671 rows 314 cols 2414 entries
Finished phase 1 with 138 SingleSign rule and 152 generalized
[2026-05-22 15:52:59] [INFO ] Computed 24 invariants in 2 ms
Computed 24 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9069371034898286654.kers
Total runtime 3 ms.
[2026-05-22 15:53:00] [INFO ] Implicit Places using invariants in 316 ms returned []
[2026-05-22 15:53:00] [INFO ] Invariant cache hit.
[2026-05-22 15:53:00] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-22 15:53:01] [INFO ] Implicit Places using invariants and state equation in 1350 ms returned []
Implicit Place search using SMT with State Equation took 1669 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 314/552 places, 671/1228 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2451 ms. Remains : 314/552 places, 671/1228 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 ((G(p2) U p3)&&F(!p1)))))'
Stuttering acceptance computed with spot in 758 ms :[(OR (NOT p3) p1), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p3) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2) p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), p1, (AND p1 (NOT p2))]
Running random walk in product with property : Anderson-PT-11-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 182 ms.
Stack based approach found an accepted trace after 43 steps with 0 reset with depth 44 and stack size 44 in 0 ms.
FORMULA Anderson-PT-11-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-05 finished in 3490 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((F(p0)&&(X((!p1||X(p2))) U ((!p1&&X((!p1||X(p2))))||X(G((!p1||X(p2)))))))))))'
Support contains 5 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 1228/1228 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 532 transition count 868
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 532 transition count 868
Applied a total of 40 rules in 57 ms. Remains 532 /552 variables (removed 20) and now considering 868/1228 (removed 360) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17498555978746797238.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11988995503995096197.kers'
[2026-05-22 15:53:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17498555978746797238.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11988995503995096197.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 868 rows 532 cols 3008 entries
Finished phase 1 with 234 SingleSign rule and 273 generalized
[2026-05-22 15:53:02] [INFO ] Computed 25 invariants in 13 ms
Computed 25 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-11988995503995096197.kers
Total runtime 16 ms.
[2026-05-22 15:53:03] [INFO ] Implicit Places using invariants in 762 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 765 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 531/552 places, 868/1228 transitions.
Applied a total of 0 rules in 27 ms. Remains 531 /531 variables (removed 0) and now considering 868/868 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 850 ms. Remains : 531/552 places, 868/1228 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((F(p0)&&(X((!p1||X(p2))) U ((!p1&&X((!p1||X(p2))))||X(G((!p1||X(p2)))))))))))'
Stuttering acceptance computed with spot in 467 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : Anderson-PT-11-LTLFireability-07
Product exploration explored 100000 steps with 1 reset in 179 ms.
Stack based approach found an accepted trace after 147 steps with 1 reset with depth 144 and stack size 144 in 0 ms.
FORMULA Anderson-PT-11-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-07 finished in 1574 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||G(p1)))))'
Support contains 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 1228/1228 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 552 transition count 1118
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 442 transition count 1118
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 241 place count 421 transition count 757
Iterating global reduction 0 with 21 rules applied. Total rules applied 262 place count 421 transition count 757
Applied a total of 262 rules in 39 ms. Remains 421 /552 variables (removed 131) and now considering 757/1228 (removed 471) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12213631580197989777.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15251502848459033621.kers'
[2026-05-22 15:53:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12213631580197989777.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15251502848459033621.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 757 rows 421 cols 2786 entries
Finished phase 1 with 123 SingleSign rule and 273 generalized
[2026-05-22 15:53:04] [INFO ] Computed 25 invariants in 11 ms
Computed 25 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-15251502848459033621.kers
Total runtime 13 ms.
[2026-05-22 15:53:04] [INFO ] Implicit Places using invariants in 764 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 765 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 420/552 places, 757/1228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 420 transition count 638
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 301 transition count 638
Applied a total of 238 rules in 16 ms. Remains 301 /420 variables (removed 119) and now considering 638/757 (removed 119) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2127168178204223573.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1287322198725028532.kers'
[2026-05-22 15:53:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2127168178204223573.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1287322198725028532.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 638 rows 301 cols 2306 entries
Finished phase 1 with 125 SingleSign rule and 152 generalized
[2026-05-22 15:53:04] [INFO ] Computed 24 invariants in 8 ms
Computed 24 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-1287322198725028532.kers
Total runtime 9 ms.
[2026-05-22 15:53:05] [INFO ] Implicit Places using invariants in 398 ms returned []
[2026-05-22 15:53:05] [INFO ] Invariant cache hit.
[2026-05-22 15:53:05] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-22 15:53:06] [INFO ] Implicit Places using invariants and state equation in 1453 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 301/552 places, 638/1228 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2677 ms. Remains : 301/552 places, 638/1228 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((G(p0)||p1))))'
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-11-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 262 ms.
Product exploration explored 100000 steps with 0 reset in 238 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 9 factoid took 65 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 429 ms. (93 steps per ms) remains 2/4 properties
BEST_FIRST walk for 12442 steps (2 resets) in 67 ms. (182 steps per ms) remains 0/2 properties
Knowledge based reduction with 9 factoid took 84 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 436 ms.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 638/638 transitions.
Applied a total of 0 rules in 23 ms. Remains 301 /301 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2026-05-22 15:53:07] [INFO ] Invariant cache hit.
[2026-05-22 15:53:08] [INFO ] Implicit Places using invariants in 466 ms returned []
[2026-05-22 15:53:08] [INFO ] Invariant cache hit.
[2026-05-22 15:53:08] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-22 15:53:09] [INFO ] Implicit Places using invariants and state equation in 1280 ms returned []
Implicit Place search using SMT with State Equation took 1753 ms to find 0 implicit places.
[2026-05-22 15:53:09] [INFO ] Redundant transitions in 55 ms returned []
Running 627 sub problems to find dead transitions.
[2026-05-22 15:53:09] [INFO ] Invariant cache hit.
[2026-05-22 15:53:09] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 627 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 301/939 variables, and 36 constraints, problems are : Problem set: 0 solved, 627 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/301 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 627/627 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 627 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 627 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/939 variables, and 37 constraints, problems are : Problem set: 0 solved, 627 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/301 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/627 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60271ms problems are : Problem set: 0 solved, 627 unsolved
Search for dead transitions found 0 dead transitions in 60273ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62113 ms. Remains : 301/301 places, 638/638 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 9 factoid took 57 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 36927 steps (8 resets) in 227 ms. (161 steps per ms) remains 0/4 properties
Knowledge based reduction with 9 factoid took 92 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 393 ms.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 231 ms.
Product exploration explored 100000 steps with 2 reset in 222 ms.
Built C files in :
/tmp/ltsmin696064049113972336
[2026-05-22 15:54:11] [INFO ] Computing symmetric may disable matrix : 638 transitions.
[2026-05-22 15:54:11] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 15:54:11] [INFO ] Computing symmetric may enable matrix : 638 transitions.
[2026-05-22 15:54:11] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 15:54:11] [INFO ] Computing Do-Not-Accords matrix : 638 transitions.
[2026-05-22 15:54:11] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 15:54:11] [INFO ] Built C files in 136ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin696064049113972336
Running compilation step : cd /tmp/ltsmin696064049113972336;'/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 1865 ms.
Running link step : cd /tmp/ltsmin696064049113972336;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 108 ms.
Running LTSmin : cd /tmp/ltsmin696064049113972336;'/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/stateBased5448968539479569333.hoa' '--buchi-type=spotba'
LTSmin run took 2619 ms.
FORMULA Anderson-PT-11-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-11-LTLFireability-08 finished in 71955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(X((F(X(p0)) U !p1)) U (G(F(p2))||G(p3))))'
Support contains 7 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 1228/1228 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 531 transition count 847
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 531 transition count 847
Applied a total of 42 rules in 52 ms. Remains 531 /552 variables (removed 21) and now considering 847/1228 (removed 381) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3268777658849145216.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15125006015877879274.kers'
[2026-05-22 15:54:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3268777658849145216.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15125006015877879274.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 847 rows 531 cols 2924 entries
Finished phase 1 with 233 SingleSign rule and 273 generalized
[2026-05-22 15:54:16] [INFO ] Computed 25 invariants in 19 ms
Computed 25 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-15125006015877879274.kers
Total runtime 22 ms.
[2026-05-22 15:54:16] [INFO ] Implicit Places using invariants in 765 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 767 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 530/552 places, 847/1228 transitions.
Applied a total of 0 rules in 13 ms. Remains 530 /530 variables (removed 0) and now considering 847/847 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 833 ms. Remains : 530/552 places, 847/1228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(X((F(X(p0)) U !p1)) U (G(F(p2))||G(p3))))'
Stuttering acceptance computed with spot in 312 ms :[(OR p2 p3), p2, p3, (AND (NOT p1) p3), (AND p3 (NOT p1) p0), (AND p3 p1 p0)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 178 ms.
Stack based approach found an accepted trace after 6882 steps with 0 reset with depth 6883 and stack size 5034 in 13 ms.
FORMULA Anderson-PT-11-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-09 finished in 1425 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 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 1228/1228 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 552 transition count 1118
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 442 transition count 1118
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 243 place count 419 transition count 715
Iterating global reduction 0 with 23 rules applied. Total rules applied 266 place count 419 transition count 715
Applied a total of 266 rules in 42 ms. Remains 419 /552 variables (removed 133) and now considering 715/1228 (removed 513) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12059806134915909541.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5169328857594552817.kers'
[2026-05-22 15:54:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12059806134915909541.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5169328857594552817.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 715 rows 419 cols 2618 entries
Finished phase 1 with 121 SingleSign rule and 273 generalized
[2026-05-22 15:54:17] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5169328857594552817.kers
Total runtime 5 ms.
[2026-05-22 15:54:18] [INFO ] Implicit Places using invariants in 685 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 688 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 418/552 places, 715/1228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 418 transition count 594
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 297 transition count 594
Applied a total of 242 rules in 26 ms. Remains 297 /418 variables (removed 121) and now considering 594/715 (removed 121) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7036712805662626488.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10390215926820039815.kers'
[2026-05-22 15:54:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7036712805662626488.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10390215926820039815.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 594 rows 297 cols 2134 entries
Finished phase 1 with 121 SingleSign rule and 152 generalized
[2026-05-22 15:54:18] [INFO ] Computed 24 invariants in 4 ms
Computed 24 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-10390215926820039815.kers
Total runtime 6 ms.
[2026-05-22 15:54:18] [INFO ] Implicit Places using invariants in 364 ms returned []
[2026-05-22 15:54:18] [INFO ] Invariant cache hit.
[2026-05-22 15:54:18] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-22 15:54:19] [INFO ] Implicit Places using invariants and state equation in 1291 ms returned []
Implicit Place search using SMT with State Equation took 1671 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 297/552 places, 594/1228 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2427 ms. Remains : 297/552 places, 594/1228 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 34 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 213 ms.
Stack based approach found an accepted trace after 155 steps with 0 reset with depth 156 and stack size 156 in 1 ms.
FORMULA Anderson-PT-11-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-12 finished in 2736 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((p0||G(p1)))||(!p2 U (G(!p2)||(!p2&&G(!p3)))))))'
Support contains 6 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 1228/1228 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 532 transition count 868
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 532 transition count 868
Applied a total of 40 rules in 24 ms. Remains 532 /552 variables (removed 20) and now considering 868/1228 (removed 360) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5281845579098978648.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15223076315221805569.kers'
[2026-05-22 15:54:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5281845579098978648.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15223076315221805569.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 868 rows 532 cols 3008 entries
Finished phase 1 with 234 SingleSign rule and 273 generalized
[2026-05-22 15:54:20] [INFO ] Computed 25 invariants in 5 ms
Computed 25 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-15223076315221805569.kers
Total runtime 7 ms.
[2026-05-22 15:54:20] [INFO ] Implicit Places using invariants in 554 ms returned []
[2026-05-22 15:54:20] [INFO ] Invariant cache hit.
[2026-05-22 15:54:21] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-22 15:54:24] [INFO ] Implicit Places using invariants and state equation in 3353 ms returned []
Implicit Place search using SMT with State Equation took 3924 ms to find 0 implicit places.
Running 857 sub problems to find dead transitions.
[2026-05-22 15:54:24] [INFO ] Invariant cache hit.
[2026-05-22 15:54:24] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 857 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1400 variables, and 35 constraints, problems are : Problem set: 0 solved, 857 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/532 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 857/857 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 857 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 857 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 857 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1400 variables, and 39 constraints, problems are : Problem set: 0 solved, 857 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/532 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/857 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60450ms problems are : Problem set: 0 solved, 857 unsolved
Search for dead transitions found 0 dead transitions in 60453ms
Starting structural reductions in LTL mode, iteration 1 : 532/552 places, 868/1228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64405 ms. Remains : 532/552 places, 868/1228 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||G(p1)))||(!p2 U (G(!p2)||(!p2&&G(!p3)))))))'
Stuttering acceptance computed with spot in 818 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p3 p2 (NOT p0)), p3, p2, (AND p3 p2), (AND (NOT p1) p2), (AND (NOT p1) p3 p2), (AND (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1334 steps with 0 reset in 3 ms.
FORMULA Anderson-PT-11-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-11-LTLFireability-13 finished in 65306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U p1)))'
Support contains 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 1228/1228 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 530 transition count 846
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 530 transition count 846
Applied a total of 44 rules in 25 ms. Remains 530 /552 variables (removed 22) and now considering 846/1228 (removed 382) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6472051038943524234.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8402479140399551418.kers'
[2026-05-22 15:55:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6472051038943524234.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8402479140399551418.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 846 rows 530 cols 2922 entries
Finished phase 1 with 232 SingleSign rule and 273 generalized
[2026-05-22 15:55:25] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8402479140399551418.kers
Total runtime 6 ms.
[2026-05-22 15:55:26] [INFO ] Implicit Places using invariants in 738 ms returned []
[2026-05-22 15:55:26] [INFO ] Invariant cache hit.
[2026-05-22 15:55:26] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-22 15:55:29] [INFO ] Implicit Places using invariants and state equation in 3419 ms returned []
Implicit Place search using SMT with State Equation took 4181 ms to find 0 implicit places.
Running 835 sub problems to find dead transitions.
[2026-05-22 15:55:29] [INFO ] Invariant cache hit.
[2026-05-22 15:55:29] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 835 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1376 variables, and 30 constraints, problems are : Problem set: 0 solved, 835 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/530 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 835/835 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 835 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 835 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1376 variables, and 40 constraints, problems are : Problem set: 0 solved, 835 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/530 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/835 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60474ms problems are : Problem set: 0 solved, 835 unsolved
Search for dead transitions found 0 dead transitions in 60478ms
Starting structural reductions in LTL mode, iteration 1 : 530/552 places, 846/1228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64689 ms. Remains : 530/552 places, 846/1228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U p1)))'
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), true, p0]
Running random walk in product with property : Anderson-PT-11-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2964 steps with 0 reset in 8 ms.
FORMULA Anderson-PT-11-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-11-LTLFireability-14 finished in 64873 ms.
All properties solved by simple procedures.
Total runtime 343919 ms.

BK_STOP 1779465390380

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="Anderson-PT-11"
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 Anderson-PT-11, 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 r002-oct2-177944366000204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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