About the Execution of ITS-Tools for Echo-PT-d03r07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4217.287 | 3600000.00 | 3788792.00 | 9721.30 | ?TFTTFTFFTFFFF?? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r114-smll-177955740400188.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is Echo-PT-d03r07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740400188
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 7.5K Mar 7 05:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 7 05:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 7 05:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 05:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 09:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 09:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 09:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 05:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Mar 7 05:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Mar 7 05:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Mar 7 05:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 2.2M 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 Echo-PT-d03r07-LTLFireability-00
FORMULA_NAME Echo-PT-d03r07-LTLFireability-01
FORMULA_NAME Echo-PT-d03r07-LTLFireability-02
FORMULA_NAME Echo-PT-d03r07-LTLFireability-03
FORMULA_NAME Echo-PT-d03r07-LTLFireability-04
FORMULA_NAME Echo-PT-d03r07-LTLFireability-05
FORMULA_NAME Echo-PT-d03r07-LTLFireability-06
FORMULA_NAME Echo-PT-d03r07-LTLFireability-07
FORMULA_NAME Echo-PT-d03r07-LTLFireability-08
FORMULA_NAME Echo-PT-d03r07-LTLFireability-09
FORMULA_NAME Echo-PT-d03r07-LTLFireability-10
FORMULA_NAME Echo-PT-d03r07-LTLFireability-11
FORMULA_NAME Echo-PT-d03r07-LTLFireability-12
FORMULA_NAME Echo-PT-d03r07-LTLFireability-13
FORMULA_NAME Echo-PT-d03r07-LTLFireability-14
FORMULA_NAME Echo-PT-d03r07-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779728750179
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d03r07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 17:05:52] [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-25 17:05:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 17:05:53] [INFO ] Load time of PNML (sax parser for PT used): 653 ms
[2026-05-25 17:05:53] [INFO ] Transformed 4209 places.
[2026-05-25 17:05:53] [INFO ] Transformed 3518 transitions.
[2026-05-25 17:05:53] [INFO ] Found NUPN structural information;
[2026-05-25 17:05:53] [INFO ] Parsed PT model containing 4209 places and 3518 transitions and 25540 arcs in 915 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Echo-PT-d03r07-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r07-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r07-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r07-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 126 out of 4209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4209/4209 places, 3518/3518 transitions.
Reduce places removed 343 places and 0 transitions.
Iterating post reduction 0 with 343 rules applied. Total rules applied 343 place count 3866 transition count 3518
Applied a total of 343 rules in 990 ms. Remains 3866 /4209 variables (removed 343) and now considering 3518/3518 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12341160998044887867.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2518422385563276324.kers'
[2026-05-25 17:05:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12341160998044887867.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2518422385563276324.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 3518 rows 3866 cols 23781 entries
[2026-05-25 17:06:21] [INFO ] Invariants computation overflowed in 26534 ms
Computed 0 P flows in 26536 ms.
Exported basis to /tmp/petrispot-output-2518422385563276324.kers
Total runtime 26542 ms.
[2026-05-25 17:06:26] [INFO ] Implicit Places using invariants in 32233 ms returned []
[2026-05-25 17:06:27] [INFO ] Invariant cache hit.
[2026-05-25 17:09:07] [INFO ] Implicit Places using invariants and state equation in 160032 ms returned []
Implicit Place search using SMT with State Equation took 192361 ms to find 0 implicit places.
Running 3517 sub problems to find dead transitions.
[2026-05-25 17:09:07] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3865 variables, 3865/3865 constraints. Problems are: Problem set: 0 solved, 3517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3865/7384 variables, and 3865 constraints, problems are : Problem set: 0 solved, 3517 unsolved in 30151 ms.
Refiners :[Domain max(s): 3865/3866 constraints, State Equation: 0/3866 constraints, PredecessorRefiner: 3517/3517 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3865 variables, 3865/3865 constraints. Problems are: Problem set: 0 solved, 3517 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3865/7384 variables, and 3865 constraints, problems are : Problem set: 0 solved, 3517 unsolved in 30078 ms.
Refiners :[Domain max(s): 3865/3866 constraints, State Equation: 0/3866 constraints, PredecessorRefiner: 0/3517 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63161ms problems are : Problem set: 0 solved, 3517 unsolved
Search for dead transitions found 0 dead transitions in 63232ms
Starting structural reductions in LTL mode, iteration 1 : 3866/4209 places, 3518/3518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256658 ms. Remains : 3866/4209 places, 3518/3518 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 262 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
[2026-05-25 17:10:10] [INFO ] Invariant cache hit.
[2026-05-25 17:10:16] [INFO ] Implicit Places using invariants in 5761 ms returned []
[2026-05-25 17:10:16] [INFO ] Invariant cache hit.
[2026-05-25 17:12:56] [INFO ] Implicit Places using invariants and state equation in 160009 ms returned []
Implicit Place search using SMT with State Equation took 165814 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 166080 ms. Remains : 3866/3866 places, 3518/3518 transitions.
Support contains 126 out of 3866 places after structural reductions.
[2026-05-25 17:12:57] [INFO ] Flatten gal took : 640 ms
[2026-05-25 17:12:57] [INFO ] Flatten gal took : 277 ms
[2026-05-25 17:12:58] [INFO ] Input system was already deterministic with 3518 transitions.
Reduction of identical properties reduced properties to check from 36 to 33
RANDOM walk for 40000 steps (56 resets) in 4701 ms. (8 steps per ms) remains 3/33 properties
BEST_FIRST walk for 40004 steps (8 resets) in 666 ms. (59 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 733 ms. (54 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 800 ms. (49 steps per ms) remains 3/3 properties
[2026-05-25 17:13:00] [INFO ] Invariant cache hit.
Problem AtomicPropp32 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 134/156 variables, 22/44 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 959/1115 variables, 289/333 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1115 variables, 289/622 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1115 variables, 0/622 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1683/2798 variables, 739/1361 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2798 variables, 739/2100 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2798 variables, 0/2100 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1913/4711 variables, 1067/3167 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4711 variables, 1067/4234 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4711 variables, 0/4234 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1431/6142 variables, 883/5117 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
SMT process timed out in 5085ms, After SMT, problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 18 out of 3866 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Graph (complete) has 14527 edges and 3866 vertex of which 3853 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.38 ms
Discarding 13 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 3853 transition count 3511
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 3852 transition count 3510
Applied a total of 8 rules in 893 ms. Remains 3852 /3866 variables (removed 14) and now considering 3510/3518 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 895 ms. Remains : 3852/3866 places, 3510/3518 transitions.
RANDOM walk for 40000 steps (56 resets) in 2595 ms. (15 steps per ms) remains 0/2 properties
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 3866 stabilizing places and 3518 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3866 transition count 3518
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 U (p1||G(!p0)))) U (((G(!p2)||G(!p3))&&X((!p0 U (p1||G(!p0)))))||G(X((!p0 U (p1||G(!p0)))))))&&p4)))'
Support contains 19 out of 3866 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 414 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
[2026-05-25 17:13:08] [INFO ] Invariant cache hit.
[2026-05-25 17:13:14] [INFO ] Implicit Places using invariants in 6471 ms returned []
[2026-05-25 17:13:14] [INFO ] Invariant cache hit.
[2026-05-25 17:15:54] [INFO ] Implicit Places using invariants and state equation in 160017 ms returned []
Implicit Place search using SMT with State Equation took 166539 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 166957 ms. Remains : 3866/3866 places, 3518/3518 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 U (p1||G(!p0)))) U (((G(!p2)||G(!p3))&&X((!p0 U (p1||G(!p0)))))||G(X((!p0 U (p1||G(!p0)))))))&&p4)))'
Stuttering acceptance computed with spot in 1014 ms :[(OR (NOT p4) (AND p0 (NOT p1))), (OR (NOT p4) (AND p0 (NOT p1))), true, (AND p2 p3 (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p3), (AND p0 (NOT p1)), (AND p2 p3 (NOT p1) p0), (AND (NOT p1) p0 p2), (AND (NOT p1) p0 p3), p2, p3, (OR (AND (NOT p0) p2 p3) (AND p1 p2 p3))]
Running random walk in product with property : Echo-PT-d03r07-LTLFireability-00
Product exploration explored 100000 steps with 25014 reset in 2150 ms.
Product exploration explored 100000 steps with 24932 reset in 1918 ms.
Computed a total of 3866 stabilizing places and 3518 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3866 transition count 3518
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 31 factoid took 360 ms. Reduced automaton from 14 states, 71 edges and 5 AP (stutter sensitive) to 14 states, 66 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (56 resets) in 3118 ms. (12 steps per ms) remains 7/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 745 ms. (53 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 759 ms. (52 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 707 ms. (56 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 784 ms. (50 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 629 ms. (63 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 601 ms. (66 steps per ms) remains 6/6 properties
[2026-05-25 17:16:06] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 128/147 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 979/1126 variables, 291/329 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1126 variables, 291/620 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1126 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1594/2720 variables, 754/1374 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2720 variables, 754/2128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2720 variables, 0/2128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1736/4456 variables, 944/3072 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4456 variables, 944/4016 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4456 variables, 0/4016 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1389/5845 variables, 827/4843 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 5093ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 3866 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Graph (complete) has 14527 edges and 3866 vertex of which 3853 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.4 ms
Discarding 13 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 3853 transition count 3511
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 3852 transition count 3510
Applied a total of 8 rules in 581 ms. Remains 3852 /3866 variables (removed 14) and now considering 3510/3518 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 582 ms. Remains : 3852/3866 places, 3510/3518 transitions.
RANDOM walk for 40000 steps (56 resets) in 2128 ms. (18 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 488 ms. (81 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 501 ms. (79 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 430 ms. (92 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 515 ms. (77 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 471 ms. (84 steps per ms) remains 5/5 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5820152606650791205.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10856497790368790017.kers'
[2026-05-25 17:16:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5820152606650791205.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10856497790368790017.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 3510 rows 3852 cols 23688 entries
[2026-05-25 17:16:37] [INFO ] Invariants computation overflowed in 24486 ms
Computed 0 P flows in 24487 ms.
Exported basis to /tmp/petrispot-output-10856497790368790017.kers
Total runtime 24491 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 128/147 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 971/1118 variables, 289/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1118 variables, 289/616 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1118 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1580/2698 variables, 742/1358 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2698 variables, 742/2100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2698 variables, 0/2100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1736/4434 variables, 944/3044 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4434 variables, 944/3988 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4434 variables, 0/3988 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1389/5823 variables, 827/4815 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5823 variables, 827/5642 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5823 variables, 0/5642 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 878/6701 variables, 564/6206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/6701 variables, 564/6770 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/6701 variables, 0/6770 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 439/7140 variables, 297/7067 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/7140 variables, 297/7364 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/7140 variables, 0/7364 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 175/7315 variables, 129/7493 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/7315 variables, 129/7622 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/7315 variables, 0/7622 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 43/7358 variables, 37/7659 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/7358 variables, 37/7696 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/7358 variables, 0/7696 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 4/7362 variables, 4/7700 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/7362 variables, 4/7704 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/7362 variables, 0/7704 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 0/7362 variables, 0/7704 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7362/7362 variables, and 7704 constraints, problems are : Problem set: 0 solved, 5 unsolved in 26359 ms.
Refiners :[Domain max(s): 3852/3852 constraints, State Equation: 3852/3852 constraints, PredecessorRefiner: 5/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 128/147 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 971/1118 variables, 289/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1118 variables, 289/616 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1118 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1118 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1580/2698 variables, 742/1360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2698 variables, 742/2102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2698 variables, 0/2102 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1736/4434 variables, 944/3046 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4434 variables, 944/3990 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4434 variables, 0/3990 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1389/5823 variables, 827/4817 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5823 variables, 827/5644 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5823 variables, 0/5644 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 878/6701 variables, 564/6208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/6701 variables, 564/6772 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/6701 variables, 0/6772 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 439/7140 variables, 297/7069 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/7140 variables, 297/7366 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/7140 variables, 0/7366 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 175/7315 variables, 129/7495 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/7315 variables, 129/7624 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7315/7362 variables, and 7624 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45023 ms.
Refiners :[Domain max(s): 3811/3852 constraints, State Equation: 3811/3852 constraints, PredecessorRefiner: 5/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 95939ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 3852 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3852/3852 places, 3510/3510 transitions.
Applied a total of 0 rules in 392 ms. Remains 3852 /3852 variables (removed 0) and now considering 3510/3510 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 392 ms. Remains : 3852/3852 places, 3510/3510 transitions.
Knowledge based reduction with 31 factoid took 1033 ms. Reduced automaton from 14 states, 66 edges and 4 AP (stutter sensitive) to 14 states, 66 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 732 ms :[(AND p0 p2 p3 (NOT p1)), (AND p0 p2 p3 (NOT p1)), true, (AND p0 p2 p3 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p3), (AND p0 (NOT p1)), (AND p0 p2 p3 (NOT p1)), (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p3), p2, p3, (OR (AND (NOT p0) p2 p3) (AND p1 p2 p3))]
Knowledge-based reduction took 111292 ms.
Stuttering acceptance computed with spot in 791 ms :[(AND p0 p2 p3 (NOT p1)), (AND p0 p2 p3 (NOT p1)), true, (AND p0 p2 p3 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p3), (AND p0 (NOT p1)), (AND p0 p2 p3 (NOT p1)), (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p3), p2, p3, (OR (AND (NOT p0) p2 p3) (AND p1 p2 p3))]
Support contains 19 out of 3866 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 419 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11293612818990626819.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3136208980499764325.kers'
[2026-05-25 17:17:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11293612818990626819.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3136208980499764325.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 3518 rows 3866 cols 23781 entries
[2026-05-25 17:18:20] [INFO ] Invariants computation overflowed in 27942 ms
Computed 0 P flows in 27943 ms.
Exported basis to /tmp/petrispot-output-3136208980499764325.kers
Total runtime 27949 ms.
[2026-05-25 17:18:26] [INFO ] Implicit Places using invariants in 33812 ms returned []
[2026-05-25 17:18:26] [INFO ] Invariant cache hit.
[2026-05-25 17:21:06] [INFO ] Implicit Places using invariants and state equation in 160007 ms returned []
Implicit Place search using SMT with State Equation took 193866 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 194286 ms. Remains : 3866/3866 places, 3518/3518 transitions.
Computed a total of 3866 stabilizing places and 3518 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3866 transition count 3518
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 21 factoid took 261 ms. Reduced automaton from 14 states, 66 edges and 4 AP (stutter sensitive) to 14 states, 66 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (56 resets) in 2840 ms. (14 steps per ms) remains 6/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 544 ms. (73 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 486 ms. (82 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 704 ms. (56 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 708 ms. (56 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 711 ms. (56 steps per ms) remains 5/5 properties
[2026-05-25 17:21:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 128/147 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 979/1126 variables, 291/329 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1126 variables, 291/620 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1126 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1594/2720 variables, 754/1374 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2720 variables, 754/2128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2720 variables, 0/2128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1736/4456 variables, 944/3072 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4456 variables, 944/4016 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4456 variables, 0/4016 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1389/5845 variables, 827/4843 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SMT process timed out in 5067ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 3866 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Graph (complete) has 14527 edges and 3866 vertex of which 3853 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.6 ms
Discarding 13 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 3853 transition count 3511
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 3852 transition count 3510
Applied a total of 8 rules in 788 ms. Remains 3852 /3866 variables (removed 14) and now considering 3510/3518 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 788 ms. Remains : 3852/3866 places, 3510/3518 transitions.
RANDOM walk for 40000 steps (56 resets) in 2660 ms. (15 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 507 ms. (78 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 475 ms. (84 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 578 ms. (69 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5467423741123936660.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-239854512967573582.kers'
[2026-05-25 17:21:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5467423741123936660.kers, --Pflows, --basisKERS=/tmp/petrispot-output-239854512967573582.kers]
Culled 0 columns in 10 ms.
// Phase 1: matrix 3510 rows 3852 cols 23688 entries
[2026-05-25 17:21:43] [INFO ] Invariants computation overflowed in 24542 ms
Computed 0 P flows in 24543 ms.
Exported basis to /tmp/petrispot-output-239854512967573582.kers
Total runtime 24549 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 128/147 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 971/1118 variables, 289/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1118 variables, 289/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1118 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1580/2698 variables, 742/1358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2698 variables, 742/2100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2698 variables, 0/2100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1736/4434 variables, 944/3044 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4434 variables, 944/3988 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4434 variables, 0/3988 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1389/5823 variables, 827/4815 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5823 variables, 827/5642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5823 variables, 0/5642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 878/6701 variables, 564/6206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/6701 variables, 564/6770 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/6701 variables, 0/6770 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 439/7140 variables, 297/7067 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/7140 variables, 297/7364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/7140 variables, 0/7364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 175/7315 variables, 129/7493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/7315 variables, 129/7622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/7315 variables, 0/7622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 43/7358 variables, 37/7659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/7358 variables, 37/7696 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/7358 variables, 0/7696 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 4/7362 variables, 4/7700 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/7362 variables, 4/7704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/7362 variables, 0/7704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 0/7362 variables, 0/7704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7362/7362 variables, and 7704 constraints, problems are : Problem set: 0 solved, 3 unsolved in 23675 ms.
Refiners :[Domain max(s): 3852/3852 constraints, State Equation: 3852/3852 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 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/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 128/147 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 971/1118 variables, 289/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1118 variables, 289/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1118 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1118 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1580/2698 variables, 742/1359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2698 variables, 742/2101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2698 variables, 0/2101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1736/4434 variables, 944/3045 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4434 variables, 944/3989 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4434 variables, 0/3989 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1389/5823 variables, 827/4816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5823 variables, 827/5643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5823 variables, 0/5643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 878/6701 variables, 564/6207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/6701 variables, 564/6771 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/6701 variables, 0/6771 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 439/7140 variables, 297/7068 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/7140 variables, 297/7365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/7140 variables, 0/7365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 175/7315 variables, 129/7494 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/7315 variables, 129/7623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/7315 variables, 0/7623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 43/7358 variables, 37/7660 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/7358 variables, 37/7697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/7358 variables, 0/7697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 4/7362 variables, 4/7701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/7362 variables, 4/7705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/7362 variables, 0/7705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 0/7362 variables, 0/7705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7362/7362 variables, and 7705 constraints, problems are : Problem set: 0 solved, 3 unsolved in 24681 ms.
Refiners :[Domain max(s): 3852/3852 constraints, State Equation: 3852/3852 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72968ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 3955 ms.
Support contains 19 out of 3852 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3852/3852 places, 3510/3510 transitions.
Applied a total of 0 rules in 228 ms. Remains 3852 /3852 variables (removed 0) and now considering 3510/3510 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 3852/3852 places, 3510/3510 transitions.
RANDOM walk for 40000 steps (56 resets) in 1811 ms. (22 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 475 ms. (84 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 495 ms. (80 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 462 ms. (86 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 88587 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 3
Probabilistic random walk after 88587 steps, saw 68837 distinct states, run finished after 3007 ms. (steps per millisecond=29 ) properties seen :0
[2026-05-25 17:22:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 128/147 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 971/1118 variables, 289/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1118 variables, 289/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1118 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1580/2698 variables, 742/1358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2698 variables, 742/2100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2698 variables, 0/2100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1736/4434 variables, 944/3044 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4434 variables, 944/3988 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4434 variables, 0/3988 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1389/5823 variables, 827/4815 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5823 variables, 827/5642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5823 variables, 0/5642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 878/6701 variables, 564/6206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/6701 variables, 564/6770 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/6701 variables, 0/6770 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 439/7140 variables, 297/7067 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/7140 variables, 297/7364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/7140 variables, 0/7364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 175/7315 variables, 129/7493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/7315 variables, 129/7622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/7315 variables, 0/7622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 43/7358 variables, 37/7659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/7358 variables, 37/7696 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/7358 variables, 0/7696 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 4/7362 variables, 4/7700 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/7362 variables, 4/7704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/7362 variables, 0/7704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 0/7362 variables, 0/7704 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7362/7362 variables, and 7704 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29209 ms.
Refiners :[Domain max(s): 3852/3852 constraints, State Equation: 3852/3852 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 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/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 128/147 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 971/1118 variables, 289/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1118 variables, 289/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1118 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1118 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1580/2698 variables, 742/1359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2698 variables, 742/2101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2698 variables, 0/2101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1736/4434 variables, 944/3045 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4434 variables, 944/3989 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4434 variables, 0/3989 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1389/5823 variables, 827/4816 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5823 variables, 827/5643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5823 variables, 0/5643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 878/6701 variables, 564/6207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/6701 variables, 564/6771 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/6701 variables, 0/6771 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 439/7140 variables, 297/7068 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/7140 variables, 297/7365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/7140 variables, 0/7365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 175/7315 variables, 129/7494 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/7315 variables, 129/7623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/7315 variables, 0/7623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 43/7358 variables, 37/7660 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/7358 variables, 37/7697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/7358 variables, 0/7697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 4/7362 variables, 4/7701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/7362 variables, 4/7705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/7362 variables, 0/7705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 0/7362 variables, 0/7705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7362/7362 variables, and 7705 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29431 ms.
Refiners :[Domain max(s): 3852/3852 constraints, State Equation: 3852/3852 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58673ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 19 out of 3852 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3852/3852 places, 3510/3510 transitions.
Applied a total of 0 rules in 373 ms. Remains 3852 /3852 variables (removed 0) and now considering 3510/3510 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 374 ms. Remains : 3852/3852 places, 3510/3510 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3852/3852 places, 3510/3510 transitions.
Applied a total of 0 rules in 354 ms. Remains 3852 /3852 variables (removed 0) and now considering 3510/3510 (removed 0) transitions.
[2026-05-25 17:23:39] [INFO ] Invariant cache hit.
[2026-05-25 17:23:45] [INFO ] Implicit Places using invariants in 6078 ms returned []
[2026-05-25 17:23:45] [INFO ] Invariant cache hit.
[2026-05-25 17:26:25] [INFO ] Implicit Places using invariants and state equation in 160012 ms returned []
Implicit Place search using SMT with State Equation took 166126 ms to find 0 implicit places.
[2026-05-25 17:26:25] [INFO ] Redundant transitions in 287 ms returned []
Running 3504 sub problems to find dead transitions.
[2026-05-25 17:26:25] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3852 variables, 3852/3852 constraints. Problems are: Problem set: 0 solved, 3504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3852/7362 variables, and 3852 constraints, problems are : Problem set: 0 solved, 3504 unsolved in 30117 ms.
Refiners :[Domain max(s): 3852/3852 constraints, State Equation: 0/3852 constraints, PredecessorRefiner: 3504/3504 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3504 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3852 variables, 3852/3852 constraints. Problems are: Problem set: 0 solved, 3504 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3852/7362 variables, and 3852 constraints, problems are : Problem set: 0 solved, 3504 unsolved in 30113 ms.
Refiners :[Domain max(s): 3852/3852 constraints, State Equation: 0/3852 constraints, PredecessorRefiner: 0/3504 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62783ms problems are : Problem set: 0 solved, 3504 unsolved
Search for dead transitions found 0 dead transitions in 62800ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229588 ms. Remains : 3852/3852 places, 3510/3510 transitions.
Knowledge based reduction with 21 factoid took 943 ms. Reduced automaton from 14 states, 66 edges and 4 AP (stutter sensitive) to 14 states, 66 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 798 ms :[(AND p0 p2 p3 (NOT p1)), (AND p0 p2 p3 (NOT p1)), true, (AND p0 p2 p3 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p3), (AND p0 (NOT p1)), (AND p0 p2 p3 (NOT p1)), (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p3), p2, p3, (OR (AND (NOT p0) p2 p3) (AND p1 p2 p3))]
Knowledge-based reduction took 383603 ms.
Stuttering acceptance computed with spot in 794 ms :[(AND p0 p2 p3 (NOT p1)), (AND p0 p2 p3 (NOT p1)), true, (AND p0 p2 p3 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p3), (AND p0 (NOT p1)), (AND p0 p2 p3 (NOT p1)), (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p3), p2, p3, (OR (AND (NOT p0) p2 p3) (AND p1 p2 p3))]
Stuttering acceptance computed with spot in 779 ms :[(AND p0 p2 p3 (NOT p1)), (AND p0 p2 p3 (NOT p1)), true, (AND p0 p2 p3 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p3), (AND p0 (NOT p1)), (AND p0 p2 p3 (NOT p1)), (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p3), p2, p3, (OR (AND (NOT p0) p2 p3) (AND p1 p2 p3))]
Product exploration explored 100000 steps with 20025 reset in 1967 ms.
Product exploration explored 100000 steps with 20025 reset in 1819 ms.
Spot run failed in 102 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin9389227221538830259
[2026-05-25 17:27:35] [INFO ] Built C files in 118ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9389227221538830259
Running compilation step : cd /tmp/ltsmin9389227221538830259;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9389227221538830259;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9389227221538830259;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 19 out of 3866 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 253 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18419008641243946940.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6466163603438312246.kers'
[2026-05-25 17:27:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18419008641243946940.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6466163603438312246.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 3518 rows 3866 cols 23781 entries
[2026-05-25 17:28:06] [INFO ] Invariants computation overflowed in 27825 ms
Computed 0 P flows in 27826 ms.
Exported basis to /tmp/petrispot-output-6466163603438312246.kers
Total runtime 27830 ms.
[2026-05-25 17:28:13] [INFO ] Implicit Places using invariants in 34280 ms returned []
[2026-05-25 17:28:13] [INFO ] Invariant cache hit.
[2026-05-25 17:30:53] [INFO ] Implicit Places using invariants and state equation in 160008 ms returned []
Implicit Place search using SMT with State Equation took 194324 ms to find 0 implicit places.
Running 3517 sub problems to find dead transitions.
[2026-05-25 17:30:53] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3865 variables, 3865/3865 constraints. Problems are: Problem set: 0 solved, 3517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3865/7384 variables, and 3865 constraints, problems are : Problem set: 0 solved, 3517 unsolved in 30116 ms.
Refiners :[Domain max(s): 3865/3866 constraints, State Equation: 0/3866 constraints, PredecessorRefiner: 3517/3517 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3865 variables, 3865/3865 constraints. Problems are: Problem set: 0 solved, 3517 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3865/7384 variables, and 3865 constraints, problems are : Problem set: 0 solved, 3517 unsolved in 30110 ms.
Refiners :[Domain max(s): 3865/3866 constraints, State Equation: 0/3866 constraints, PredecessorRefiner: 0/3517 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62909ms problems are : Problem set: 0 solved, 3517 unsolved
Search for dead transitions found 0 dead transitions in 62923ms
Finished structural reductions in LTL mode , in 1 iterations and 257509 ms. Remains : 3866/3866 places, 3518/3518 transitions.
Built C files in :
/tmp/ltsmin6319497031568999231
[2026-05-25 17:31:56] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6319497031568999231
Running compilation step : cd /tmp/ltsmin6319497031568999231;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6319497031568999231;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6319497031568999231;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-25 17:32:00] [INFO ] Flatten gal took : 334 ms
[2026-05-25 17:32:00] [INFO ] Flatten gal took : 291 ms
[2026-05-25 17:32:00] [INFO ] Time to serialize gal into /tmp/LTL14417493064214690468.gal : 97 ms
[2026-05-25 17:32:00] [INFO ] Time to serialize properties into /tmp/LTL1482080328978102807.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14417493064214690468.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4624903601750863052.hoa' '-atoms' '/tmp/LTL1482080328978102807.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1482080328978102807.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4624903601750863052.hoa
Detected timeout of ITS tools.
[2026-05-25 17:32:16] [INFO ] Flatten gal took : 161 ms
[2026-05-25 17:32:16] [INFO ] Flatten gal took : 158 ms
[2026-05-25 17:32:16] [INFO ] Time to serialize gal into /tmp/LTL5437052640272075541.gal : 29 ms
[2026-05-25 17:32:16] [INFO ] Time to serialize properties into /tmp/LTL15415129726962257167.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5437052640272075541.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15415129726962257167.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(((X((!("((((p1339==1)&&(p1340==1))&&((p1341==1)&&(p1343==1)))&&(p3101==1))"))U(("((!((((p1482==1)&&(p1483==1))&&((p1484==1)&&(p14...1200
Formula 0 simplified : X(!"((((p1339==0)||(p1340==0))||((p1341==0)||(p1343==0)))||(p3101==0))" | (X("((((p1339==1)&&(p1340==1))&&((p1341==1)&&(p1343==1)))&...928
Detected timeout of ITS tools.
[2026-05-25 17:32:31] [INFO ] Flatten gal took : 153 ms
[2026-05-25 17:32:31] [INFO ] Applying decomposition
[2026-05-25 17:32:31] [INFO ] Flatten gal took : 159 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12499634568974152489.txt' '-o' '/tmp/graph12499634568974152489.bin' '-w' '/tmp/graph12499634568974152489.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12499634568974152489.bin' '-l' '-1' '-v' '-w' '/tmp/graph12499634568974152489.weights' '-q' '0' '-e' '0.001'
[2026-05-25 17:32:32] [INFO ] Decomposing Gal with order
[2026-05-25 17:32:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 17:32:33] [INFO ] Removed a total of 6324 redundant transitions.
[2026-05-25 17:32:33] [INFO ] Flatten gal took : 855 ms
[2026-05-25 17:32:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 938 labels/synchronizations in 265 ms.
[2026-05-25 17:32:34] [INFO ] Time to serialize gal into /tmp/LTL11858058697483488685.gal : 76 ms
[2026-05-25 17:32:34] [INFO ] Time to serialize properties into /tmp/LTL10448954905591189825.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11858058697483488685.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10448954905591189825.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(((X((!("((((i7.u5.p1339==1)&&(i2.i1.u194.p1340==1))&&((i4.i2.u198.p1341==1)&&(i2.i1.u44.p1343==1)))&&(i7.u199.p3101==1))"))U(("((...1912
Formula 0 simplified : X(!"((((i7.u5.p1339==0)||(i2.i1.u194.p1340==0))||((i4.i2.u198.p1341==0)||(i2.i1.u44.p1343==0)))||(i7.u199.p3101==0))" | (X("((((i7.u...1502
Detected timeout of ITS tools.
Treatment of property Echo-PT-d03r07-LTLFireability-00 finished in 1181683 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p0)) U (p1||(p2 U X(p2)))))'
Support contains 12 out of 3866 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 201 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
[2026-05-25 17:32:49] [INFO ] Invariant cache hit.
[2026-05-25 17:32:55] [INFO ] Implicit Places using invariants in 5453 ms returned []
[2026-05-25 17:32:55] [INFO ] Invariant cache hit.
[2026-05-25 17:35:35] [INFO ] Implicit Places using invariants and state equation in 160006 ms returned []
Implicit Place search using SMT with State Equation took 165504 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 165706 ms. Remains : 3866/3866 places, 3518/3518 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p0)) U ((p1 U X(p1))||p2)))'
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2), true, (NOT p0), (NOT p1)]
Running random walk in product with property : Echo-PT-d03r07-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d03r07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r07-LTLFireability-02 finished in 166073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 6 out of 3866 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Graph (complete) has 14527 edges and 3866 vertex of which 3859 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.68 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 673 ms. Remains 3858 /3866 variables (removed 8) and now considering 3516/3518 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11263286243421599029.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11708607889805864781.kers'
[2026-05-25 17:35:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11263286243421599029.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11708607889805864781.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 3516 rows 3858 cols 23730 entries
[2026-05-25 17:36:03] [INFO ] Invariants computation overflowed in 26910 ms
Computed 0 P flows in 26915 ms.
Exported basis to /tmp/petrispot-output-11708607889805864781.kers
Total runtime 26919 ms.
[2026-05-25 17:36:09] [INFO ] Implicit Places using invariants in 33398 ms returned []
[2026-05-25 17:36:09] [INFO ] Invariant cache hit.
[2026-05-25 17:37:33] [INFO ] Performed 30/3858 implicitness test of which 0 returned IMPLICIT in 38 seconds.
[2026-05-25 17:38:49] [INFO ] Implicit Places using invariants and state equation in 160013 ms returned []
Implicit Place search using SMT with State Equation took 193452 ms to find 0 implicit places.
[2026-05-25 17:38:50] [INFO ] Redundant transitions in 332 ms returned []
Running 3510 sub problems to find dead transitions.
[2026-05-25 17:38:50] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3858 variables, 3858/3858 constraints. Problems are: Problem set: 0 solved, 3510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3858/7374 variables, and 3858 constraints, problems are : Problem set: 0 solved, 3510 unsolved in 30117 ms.
Refiners :[Domain max(s): 3858/3858 constraints, State Equation: 0/3858 constraints, PredecessorRefiner: 3510/3510 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3510 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3858 variables, 3858/3858 constraints. Problems are: Problem set: 0 solved, 3510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3858/7374 variables, and 3858 constraints, problems are : Problem set: 0 solved, 3510 unsolved in 30119 ms.
Refiners :[Domain max(s): 3858/3858 constraints, State Equation: 0/3858 constraints, PredecessorRefiner: 0/3510 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62292ms problems are : Problem set: 0 solved, 3510 unsolved
Search for dead transitions found 0 dead transitions in 62303ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3858/3866 places, 3516/3518 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 256805 ms. Remains : 3858/3866 places, 3516/3518 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Echo-PT-d03r07-LTLFireability-04
Product exploration explored 100000 steps with 276 reset in 5108 ms.
Product exploration explored 100000 steps with 265 reset in 5661 ms.
Computed a total of 3858 stabilizing places and 3516 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3858 transition count 3516
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 13 ms. Proved property starting from automaton with 3 states, 5 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 3759 ms.
FORMULA Echo-PT-d03r07-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r07-LTLFireability-04 finished in 271554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 2 out of 3866 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Graph (complete) has 14527 edges and 3866 vertex of which 3859 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.11 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 282 ms. Remains 3858 /3866 variables (removed 8) and now considering 3516/3518 (removed 2) transitions.
[2026-05-25 17:40:07] [INFO ] Invariant cache hit.
[2026-05-25 17:40:13] [INFO ] Implicit Places using invariants in 6277 ms returned []
[2026-05-25 17:40:13] [INFO ] Invariant cache hit.
[2026-05-25 17:42:53] [INFO ] Implicit Places using invariants and state equation in 160007 ms returned []
Implicit Place search using SMT with State Equation took 166325 ms to find 0 implicit places.
[2026-05-25 17:42:53] [INFO ] Redundant transitions in 150 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 3858/3866 places, 3516/3518 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166767 ms. Remains : 3858/3866 places, 3516/3518 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(p0)||G(p1)))'
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r07-LTLFireability-07
Entered a terminal (fully accepting) state of product in 216 steps with 0 reset in 11 ms.
FORMULA Echo-PT-d03r07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r07-LTLFireability-07 finished in 166927 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 X((!p1&&X((F(p2)||G(!p1))))))))'
Support contains 12 out of 3866 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 369 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4418967416822872468.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14570915292044428284.kers'
[2026-05-25 17:42:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4418967416822872468.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14570915292044428284.kers]
Culled 0 columns in 11 ms.
// Phase 1: matrix 3518 rows 3866 cols 23781 entries
[2026-05-25 17:43:21] [INFO ] Invariants computation overflowed in 27116 ms
Computed 0 P flows in 27117 ms.
Exported basis to /tmp/petrispot-output-14570915292044428284.kers
Total runtime 27125 ms.
[2026-05-25 17:43:27] [INFO ] Implicit Places using invariants in 32780 ms returned []
[2026-05-25 17:43:27] [INFO ] Invariant cache hit.
[2026-05-25 17:46:07] [INFO ] Implicit Places using invariants and state equation in 160011 ms returned []
Implicit Place search using SMT with State Equation took 192835 ms to find 0 implicit places.
Running 3517 sub problems to find dead transitions.
[2026-05-25 17:46:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3865 variables, 3865/3865 constraints. Problems are: Problem set: 0 solved, 3517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3865/7384 variables, and 3865 constraints, problems are : Problem set: 0 solved, 3517 unsolved in 30078 ms.
Refiners :[Domain max(s): 3865/3866 constraints, State Equation: 0/3866 constraints, PredecessorRefiner: 3517/3517 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3865 variables, 3865/3865 constraints. Problems are: Problem set: 0 solved, 3517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3865/7384 variables, and 3865 constraints, problems are : Problem set: 0 solved, 3517 unsolved in 30105 ms.
Refiners :[Domain max(s): 3865/3866 constraints, State Equation: 0/3866 constraints, PredecessorRefiner: 0/3517 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62275ms problems are : Problem set: 0 solved, 3517 unsolved
Search for dead transitions found 0 dead transitions in 62286ms
Finished structural reductions in LTL mode , in 1 iterations and 255499 ms. Remains : 3866/3866 places, 3518/3518 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 X((!p1&&X((F(p2)||G(!p1))))))))'
Stuttering acceptance computed with spot in 544 ms :[p1, p1, p1, p1, true, (AND (NOT p2) p1), (NOT p2), (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (NOT p0), (AND p1 (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Echo-PT-d03r07-LTLFireability-08
Stuttering criterion allowed to conclude after 17016 steps with 113 reset in 1000 ms.
FORMULA Echo-PT-d03r07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r07-LTLFireability-08 finished in 257121 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(p0)&&X(p1))||((!p2&&F(!p3)) U (G((G(!p2)||(!p2&&F(!p3))))||((G(!p2)||(!p2&&F(!p3)))&&X(!p4)))))))'
Support contains 23 out of 3866 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 216 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
[2026-05-25 17:47:11] [INFO ] Invariant cache hit.
[2026-05-25 17:47:17] [INFO ] Implicit Places using invariants in 5576 ms returned []
[2026-05-25 17:47:17] [INFO ] Invariant cache hit.
[2026-05-25 17:49:57] [INFO ] Implicit Places using invariants and state equation in 160007 ms returned []
Implicit Place search using SMT with State Equation took 165629 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 165846 ms. Remains : 3866/3866 places, 3518/3518 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((!p0&&F(!p1)) U (G((G(!p0)||(!p0&&F(!p1))))||((G(!p0)||(!p0&&F(!p1)))&&X(!p2))))||(F(p3)&&X(p4)))))'
Stuttering acceptance computed with spot in 482 ms :[(OR (AND p0 (NOT p4)) (AND p0 (NOT p3))), (OR (AND p0 (NOT p3)) (AND p0 (NOT p4))), (NOT p3), (NOT p4), (AND p0 p2 (NOT p3)), (AND p0 p2 (NOT p4)), (AND (NOT p3) p1 p0), (AND p0 p1 (NOT p4)), true, (AND p0 p2), (AND p1 p0), (AND (NOT p3) p1), p1]
Running random walk in product with property : Echo-PT-d03r07-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 1542 ms.
Product exploration explored 100000 steps with 33333 reset in 1691 ms.
Computed a total of 3866 stabilizing places and 3518 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3866 transition count 3518
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 28 factoid took 34 ms. Proved property starting from automaton with 13 states, 27 edges and 5 AP (stutter sensitive
Knowledge-based reduction took 3360 ms.
FORMULA Echo-PT-d03r07-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r07-LTLFireability-09 finished in 173001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 8 out of 3866 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 215 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
[2026-05-25 17:50:04] [INFO ] Invariant cache hit.
[2026-05-25 17:50:09] [INFO ] Implicit Places using invariants in 5439 ms returned []
[2026-05-25 17:50:09] [INFO ] Invariant cache hit.
[2026-05-25 17:52:49] [INFO ] Implicit Places using invariants and state equation in 160006 ms returned []
Implicit Place search using SMT with State Equation took 165492 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 165707 ms. Remains : 3866/3866 places, 3518/3518 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(p0)||X(G(p1))))'
Stuttering acceptance computed with spot in 150 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r07-LTLFireability-10
Entered a terminal (fully accepting) state of product in 587 steps with 0 reset in 26 ms.
FORMULA Echo-PT-d03r07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r07-LTLFireability-10 finished in 165920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(X(F(p2)))))'
Support contains 12 out of 3866 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 215 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
[2026-05-25 17:52:50] [INFO ] Invariant cache hit.
[2026-05-25 17:52:55] [INFO ] Implicit Places using invariants in 5398 ms returned []
[2026-05-25 17:52:55] [INFO ] Invariant cache hit.
[2026-05-25 17:55:35] [INFO ] Implicit Places using invariants and state equation in 160006 ms returned []
Implicit Place search using SMT with State Equation took 165454 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 165671 ms. Remains : 3866/3866 places, 3518/3518 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(X(F(p2)))))'
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Echo-PT-d03r07-LTLFireability-11
Stuttering criterion allowed to conclude after 686 steps with 0 reset in 31 ms.
FORMULA Echo-PT-d03r07-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r07-LTLFireability-11 finished in 165926 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(G(p0))&&F(p1))))'
Support contains 10 out of 3866 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Graph (complete) has 14527 edges and 3866 vertex of which 3859 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 269 ms. Remains 3858 /3866 variables (removed 8) and now considering 3516/3518 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3364762626034197414.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13610277644591994401.kers'
[2026-05-25 17:55:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3364762626034197414.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13610277644591994401.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 3516 rows 3858 cols 23730 entries
[2026-05-25 17:56:01] [INFO ] Invariants computation overflowed in 24723 ms
Computed 0 P flows in 24723 ms.
Exported basis to /tmp/petrispot-output-13610277644591994401.kers
Total runtime 24729 ms.
[2026-05-25 17:56:06] [INFO ] Implicit Places using invariants in 30223 ms returned []
[2026-05-25 17:56:06] [INFO ] Invariant cache hit.
[2026-05-25 17:57:24] [INFO ] Performed 1/3858 implicitness test of which 0 returned IMPLICIT in 33 seconds.
[2026-05-25 17:58:46] [INFO ] Implicit Places using invariants and state equation in 160005 ms returned []
Implicit Place search using SMT with State Equation took 190269 ms to find 0 implicit places.
[2026-05-25 17:58:46] [INFO ] Redundant transitions in 153 ms returned []
Running 3510 sub problems to find dead transitions.
[2026-05-25 17:58:46] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3858 variables, 3858/3858 constraints. Problems are: Problem set: 0 solved, 3510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3858/7374 variables, and 3858 constraints, problems are : Problem set: 0 solved, 3510 unsolved in 30070 ms.
Refiners :[Domain max(s): 3858/3858 constraints, State Equation: 0/3858 constraints, PredecessorRefiner: 3510/3510 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3510 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3858 variables, 3858/3858 constraints. Problems are: Problem set: 0 solved, 3510 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3858/7374 variables, and 3858 constraints, problems are : Problem set: 0 solved, 3510 unsolved in 30070 ms.
Refiners :[Domain max(s): 3858/3858 constraints, State Equation: 0/3858 constraints, PredecessorRefiner: 0/3510 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62109ms problems are : Problem set: 0 solved, 3510 unsolved
Search for dead transitions found 0 dead transitions in 62120ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3858/3866 places, 3516/3518 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 252827 ms. Remains : 3858/3866 places, 3516/3518 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))&&F(p1))))'
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Echo-PT-d03r07-LTLFireability-12
Stuttering criterion allowed to conclude after 684 steps with 0 reset in 28 ms.
FORMULA Echo-PT-d03r07-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r07-LTLFireability-12 finished in 253009 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(p0) U G(((X(!p1) U p2)||!p3))))'
Support contains 11 out of 3866 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 229 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1381022338740435112.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13451963582537215508.kers'
[2026-05-25 17:59:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1381022338740435112.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13451963582537215508.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 3518 rows 3866 cols 23781 entries
[2026-05-25 18:00:17] [INFO ] Invariants computation overflowed in 27837 ms
Computed 0 P flows in 27841 ms.
Exported basis to /tmp/petrispot-output-13451963582537215508.kers
Total runtime 27845 ms.
[2026-05-25 18:00:23] [INFO ] Implicit Places using invariants in 33781 ms returned []
[2026-05-25 18:00:23] [INFO ] Invariant cache hit.
[2026-05-25 18:03:03] [INFO ] Implicit Places using invariants and state equation in 160006 ms returned []
Implicit Place search using SMT with State Equation took 193831 ms to find 0 implicit places.
Running 3517 sub problems to find dead transitions.
[2026-05-25 18:03:03] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3865 variables, 3865/3865 constraints. Problems are: Problem set: 0 solved, 3517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3865/7384 variables, and 3865 constraints, problems are : Problem set: 0 solved, 3517 unsolved in 30071 ms.
Refiners :[Domain max(s): 3865/3866 constraints, State Equation: 0/3866 constraints, PredecessorRefiner: 3517/3517 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3865 variables, 3865/3865 constraints. Problems are: Problem set: 0 solved, 3517 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3865/7384 variables, and 3865 constraints, problems are : Problem set: 0 solved, 3517 unsolved in 30074 ms.
Refiners :[Domain max(s): 3865/3866 constraints, State Equation: 0/3866 constraints, PredecessorRefiner: 0/3517 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62432ms problems are : Problem set: 0 solved, 3517 unsolved
Search for dead transitions found 0 dead transitions in 62444ms
Finished structural reductions in LTL mode , in 1 iterations and 256520 ms. Remains : 3866/3866 places, 3518/3518 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(p0) U G(((X(!p1) U p2)||!p3))))'
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p3) p2), (OR (NOT p3) p2), (OR (AND p0 (NOT p3)) (AND p0 p2)), (AND (NOT p1) p2)]
Running random walk in product with property : Echo-PT-d03r07-LTLFireability-13
Stuttering criterion allowed to conclude after 1377 steps with 3 reset in 92 ms.
FORMULA Echo-PT-d03r07-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r07-LTLFireability-13 finished in 256897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))||G(!p1)))'
Support contains 6 out of 3866 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 366 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
[2026-05-25 18:04:06] [INFO ] Invariant cache hit.
[2026-05-25 18:04:11] [INFO ] Implicit Places using invariants in 5441 ms returned []
[2026-05-25 18:04:11] [INFO ] Invariant cache hit.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Echo-PT-d03r07"
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 Echo-PT-d03r07, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-smll-177955740400188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Echo-PT-d03r07.tgz
mv Echo-PT-d03r07 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 '
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 ;