MCC'2026- Execution of r130-smll-177955809000211

About the Execution of ITS-Tools for FireWire-PT-09

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1475.695	1115676.00	1265567.00	3683.50	FFTTFFFTFFFFFFFT	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.r130-smll-177955809000211.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 FireWire-PT-09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809000211
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.8K Mar 7 05:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 7 05:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 05:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 05:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 05:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Mar 7 05:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 05:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Mar 7 05:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 100K 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 FireWire-PT-09-LTLCardinality-00
FORMULA_NAME FireWire-PT-09-LTLCardinality-01
FORMULA_NAME FireWire-PT-09-LTLCardinality-02
FORMULA_NAME FireWire-PT-09-LTLCardinality-03
FORMULA_NAME FireWire-PT-09-LTLCardinality-04
FORMULA_NAME FireWire-PT-09-LTLCardinality-05
FORMULA_NAME FireWire-PT-09-LTLCardinality-06
FORMULA_NAME FireWire-PT-09-LTLCardinality-07
FORMULA_NAME FireWire-PT-09-LTLCardinality-08
FORMULA_NAME FireWire-PT-09-LTLCardinality-09
FORMULA_NAME FireWire-PT-09-LTLCardinality-10
FORMULA_NAME FireWire-PT-09-LTLCardinality-11
FORMULA_NAME FireWire-PT-09-LTLCardinality-12
FORMULA_NAME FireWire-PT-09-LTLCardinality-13
FORMULA_NAME FireWire-PT-09-LTLCardinality-14
FORMULA_NAME FireWire-PT-09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779806360885

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-26 14:39:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 14:39:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 14:39:23] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2026-05-26 14:39:23] [INFO ] Transformed 130 places.
[2026-05-26 14:39:23] [INFO ] Transformed 408 transitions.
[2026-05-26 14:39:23] [INFO ] Found NUPN structural information;
[2026-05-26 14:39:23] [INFO ] Parsed PT model containing 130 places and 408 transitions and 1525 arcs in 296 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-09-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-09-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-09-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-09-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 352/352 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 128 transition count 348
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 128 transition count 348
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 128 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 12 place count 128 transition count 340
Applied a total of 12 rules in 65 ms. Remains 128 /130 variables (removed 2) and now considering 340/352 (removed 12) transitions.
[2026-05-26 14:39:23] [INFO ] Flow matrix only has 314 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16010393253362640921.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5046560153102587047.kers'
[2026-05-26 14:39:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16010393253362640921.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5046560153102587047.kers]
Normalized transition count is 313 out of 314 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 313 rows 128 cols 1073 entries
Finished phase 1 with 120 SingleSign rule and 0 generalized
[2026-05-26 14:39:23] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5046560153102587047.kers
Total runtime 3 ms.
[2026-05-26 14:39:23] [INFO ] Implicit Places using invariants in 400 ms returned []
[2026-05-26 14:39:23] [INFO ] Flow matrix only has 314 transitions (discarded 26 similar events)
[2026-05-26 14:39:23] [INFO ] Invariant cache hit.
[2026-05-26 14:39:24] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 14:39:24] [INFO ] Implicit Places using invariants and state equation in 465 ms returned [13, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 918 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/130 places, 340/352 transitions.
Applied a total of 0 rules in 7 ms. Remains 126 /126 variables (removed 0) and now considering 340/340 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1013 ms. Remains : 126/130 places, 340/352 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 340/340 transitions.
Applied a total of 0 rules in 7 ms. Remains 126 /126 variables (removed 0) and now considering 340/340 (removed 0) transitions.
[2026-05-26 14:39:24] [INFO ] Flow matrix only has 314 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2578913488151980010.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6751317796054379450.kers'
[2026-05-26 14:39:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2578913488151980010.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6751317796054379450.kers]
Normalized transition count is 313 out of 314 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 313 rows 126 cols 1067 entries
Finished phase 1 with 120 SingleSign rule and 0 generalized
[2026-05-26 14:39:24] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6751317796054379450.kers
Total runtime 3 ms.
[2026-05-26 14:39:24] [INFO ] Implicit Places using invariants in 144 ms returned []
[2026-05-26 14:39:24] [INFO ] Flow matrix only has 314 transitions (discarded 26 similar events)
[2026-05-26 14:39:24] [INFO ] Invariant cache hit.
[2026-05-26 14:39:24] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 14:39:24] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2026-05-26 14:39:24] [INFO ] Flow matrix only has 314 transitions (discarded 26 similar events)
[2026-05-26 14:39:24] [INFO ] Invariant cache hit.
[2026-05-26 14:39:24] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (OVERLAPS) 313/439 variables, 126/137 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 44/181 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (OVERLAPS) 1/440 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 9 (OVERLAPS) 0/440 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 339 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 182 constraints, problems are : Problem set: 0 solved, 339 unsolved in 25725 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (OVERLAPS) 313/439 variables, 126/137 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 44/181 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 339/520 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/440 variables, and 520 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 126/126 constraints, ReadFeed: 44/45 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56169ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 56192ms
Finished structural reductions in LTL mode , in 1 iterations and 56693 ms. Remains : 126/126 places, 340/340 transitions.
Support contains 29 out of 126 places after structural reductions.
[2026-05-26 14:40:21] [INFO ] Flatten gal took : 116 ms
[2026-05-26 14:40:21] [INFO ] Flatten gal took : 58 ms
[2026-05-26 14:40:21] [INFO ] Input system was already deterministic with 340 transitions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40000 steps (2190 resets) in 2294 ms. (17 steps per ms) remains 11/19 properties
BEST_FIRST walk for 40002 steps (568 resets) in 234 ms. (170 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (671 resets) in 237 ms. (168 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (589 resets) in 106 ms. (373 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (590 resets) in 102 ms. (388 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (552 resets) in 149 ms. (266 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40002 steps (569 resets) in 133 ms. (298 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (591 resets) in 210 ms. (189 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (536 resets) in 158 ms. (251 steps per ms) remains 5/8 properties
[2026-05-26 14:40:22] [INFO ] Flow matrix only has 314 transitions (discarded 26 similar events)
[2026-05-26 14:40:22] [INFO ] Invariant cache hit.
[2026-05-26 14:40:22] [INFO ] State equation strengthened by 45 read => feed constraints.
Problem AtomicPropp12 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 105/114 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/122 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 313/435 variables, 122/128 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 44/172 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/439 variables, 4/176 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/440 variables, 1/177 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/440 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 177 constraints, problems are : Problem set: 1 solved, 4 unsolved in 601 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 95/102 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 20/122 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 313/435 variables, 122/131 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 44/175 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 4/179 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 4/439 variables, 4/183 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/440 variables, 1/184 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/440 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/440 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 184 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1054 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1669ms problems are : Problem set: 1 solved, 4 unsolved
Parikh walk visited 2 properties in 950 ms.
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 340/340 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 126 transition count 337
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 125 transition count 335
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 125 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 125 transition count 334
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 124 transition count 333
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 121 transition count 339
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 20 place count 121 transition count 333
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 23 place count 121 transition count 330
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 121 transition count 328
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 27 place count 119 transition count 328
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 118 transition count 327
Applied a total of 28 rules in 131 ms. Remains 118 /126 variables (removed 8) and now considering 327/340 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 118/126 places, 327/340 transitions.
RANDOM walk for 40000 steps (2310 resets) in 314 ms. (126 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (539 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (564 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1230595 steps, run timeout after 3001 ms. (steps per millisecond=410 ) properties seen :1 out of 2
Probabilistic random walk after 1230595 steps, saw 267215 distinct states, run finished after 3009 ms. (steps per millisecond=408 ) properties seen :1
[2026-05-26 14:40:28] [INFO ] Flow matrix only has 299 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18251179812621077864.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3790062386309062790.kers'
[2026-05-26 14:40:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18251179812621077864.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3790062386309062790.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 299 rows 118 cols 1021 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-26 14:40:28] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3790062386309062790.kers
Total runtime 2 ms.
[2026-05-26 14:40:28] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 119/325 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 23/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/327 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/327 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/327 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 90/417 variables, 46/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 22/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/417 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 119/325 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 23/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/327 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/327 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 90/417 variables, 46/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 22/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/417 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 170 constraints, problems are : Problem set: 0 solved, 1 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 599ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 327/327 transitions.
Applied a total of 0 rules in 32 ms. Remains 118 /118 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 118/118 places, 327/327 transitions.
RANDOM walk for 40000 steps (2321 resets) in 239 ms. (166 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (553 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1304154 steps, run timeout after 3001 ms. (steps per millisecond=434 ) properties seen :0 out of 1
Probabilistic random walk after 1304154 steps, saw 285604 distinct states, run finished after 3001 ms. (steps per millisecond=434 ) properties seen :0
[2026-05-26 14:40:32] [INFO ] Flow matrix only has 299 transitions (discarded 28 similar events)
[2026-05-26 14:40:32] [INFO ] Invariant cache hit.
[2026-05-26 14:40:32] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 119/325 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 23/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/327 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/327 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/327 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 90/417 variables, 46/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 22/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/417 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 119/325 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 23/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/327 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/327 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 90/417 variables, 46/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 22/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/417 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 170 constraints, problems are : Problem set: 0 solved, 1 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 628ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 327/327 transitions.
Applied a total of 0 rules in 10 ms. Remains 118 /118 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 118/118 places, 327/327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 327/327 transitions.
Applied a total of 0 rules in 11 ms. Remains 118 /118 variables (removed 0) and now considering 327/327 (removed 0) transitions.
[2026-05-26 14:40:33] [INFO ] Flow matrix only has 299 transitions (discarded 28 similar events)
[2026-05-26 14:40:33] [INFO ] Invariant cache hit.
[2026-05-26 14:40:33] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-26 14:40:33] [INFO ] Flow matrix only has 299 transitions (discarded 28 similar events)
[2026-05-26 14:40:33] [INFO ] Invariant cache hit.
[2026-05-26 14:40:33] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 14:40:33] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2026-05-26 14:40:33] [INFO ] Redundant transitions in 22 ms returned []
Running 325 sub problems to find dead transitions.
[2026-05-26 14:40:33] [INFO ] Flow matrix only has 299 transitions (discarded 28 similar events)
[2026-05-26 14:40:33] [INFO ] Invariant cache hit.
[2026-05-26 14:40:33] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (OVERLAPS) 299/416 variables, 117/132 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 7 (OVERLAPS) 1/417 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 417/417 variables, and 178 constraints, problems are : Problem set: 0 solved, 325 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 299/416 variables, 117/132 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 325/502 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 2/505 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/417 variables, and 505 constraints, problems are : Problem set: 0 solved, 325 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 117/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60241ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 60245ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60735 ms. Remains : 118/118 places, 327/327 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 113 edges and 118 vertex of which 31 / 118 are part of one of the 5 SCC in 4 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 122 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 129 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 91 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 91 transition count 195
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 90 transition count 194
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 90 transition count 193
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 89 transition count 192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 88 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 88 transition count 159
Free-agglomeration rule applied 2 times with reduction of 1 identical transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 88 transition count 156
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 86 transition count 155
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 86 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 86 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 85 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 85 transition count 153
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 85 transition count 153
Applied a total of 22 rules in 87 ms. Remains 85 /118 variables (removed 33) and now considering 153/327 (removed 174) transitions.
Running SMT prover for 1 properties.
[2026-05-26 14:41:34] [INFO ] Flow matrix only has 151 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11741383459375158579.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17478504934052825672.kers'
[2026-05-26 14:41:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11741383459375158579.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17478504934052825672.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 151 rows 85 cols 547 entries
Finished phase 1 with 79 SingleSign rule and 0 generalized
[2026-05-26 14:41:34] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17478504934052825672.kers
Total runtime 2 ms.
[2026-05-26 14:41:34] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-26 14:41:34] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 14:41:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2026-05-26 14:41:34] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 14:41:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 204 ms
TRAPS : Iteration 1
[2026-05-26 14:41:34] [INFO ] After 334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 14:41:34] [INFO ] After 403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 681 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 22 stabilizing places and 47 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 340/340 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 338
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 338
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 124 transition count 335
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 124 transition count 335
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 123 transition count 333
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 123 transition count 333
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 122 transition count 330
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 122 transition count 330
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 121 transition count 328
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 121 transition count 328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 120 transition count 325
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 120 transition count 325
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 119 transition count 323
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 119 transition count 323
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 118 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 117 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 117 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 116 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 115 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 115 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 114 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 114 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 113 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 113 transition count 309
Applied a total of 26 rules in 32 ms. Remains 113 /126 variables (removed 13) and now considering 309/340 (removed 31) transitions.
[2026-05-26 14:41:34] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11762680337232661520.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16703031022308162122.kers'
[2026-05-26 14:41:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11762680337232661520.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16703031022308162122.kers]
Normalized transition count is 282 out of 283 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 282 rows 113 cols 955 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-26 14:41:34] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16703031022308162122.kers
Total runtime 2 ms.
[2026-05-26 14:41:35] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-26 14:41:35] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2026-05-26 14:41:35] [INFO ] Invariant cache hit.
[2026-05-26 14:41:35] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 14:41:35] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2026-05-26 14:41:35] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2026-05-26 14:41:35] [INFO ] Invariant cache hit.
[2026-05-26 14:41:35] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 282/395 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 1/396 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (OVERLAPS) 0/396 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 163 constraints, problems are : Problem set: 0 solved, 308 unsolved in 26658 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 282/395 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 308/470 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/396 variables, and 471 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 56795ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 56797ms
Starting structural reductions in LTL mode, iteration 1 : 113/126 places, 309/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57612 ms. Remains : 113/126 places, 309/340 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 356 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-09-LTLCardinality-00
Stuttering criterion allowed to conclude after 11 steps with 3 reset in 3 ms.
FORMULA FireWire-PT-09-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-09-LTLCardinality-00 finished in 58059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 340/340 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 123 transition count 335
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 123 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 123 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 122 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 122 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 121 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 121 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 120 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 120 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 119 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 119 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 118 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 118 transition count 321
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 117 transition count 320
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 114 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 114 transition count 320
Applied a total of 29 rules in 77 ms. Remains 114 /126 variables (removed 12) and now considering 320/340 (removed 20) transitions.
[2026-05-26 14:42:32] [INFO ] Flow matrix only has 287 transitions (discarded 33 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8016157806945542726.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3739474316303503562.kers'
[2026-05-26 14:42:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8016157806945542726.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3739474316303503562.kers]
Normalized transition count is 286 out of 287 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 286 rows 114 cols 971 entries
Finished phase 1 with 108 SingleSign rule and 0 generalized
[2026-05-26 14:42:32] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3739474316303503562.kers
Total runtime 3 ms.
[2026-05-26 14:42:33] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-26 14:42:33] [INFO ] Flow matrix only has 287 transitions (discarded 33 similar events)
[2026-05-26 14:42:33] [INFO ] Invariant cache hit.
[2026-05-26 14:42:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-26 14:42:33] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
[2026-05-26 14:42:33] [INFO ] Redundant transitions in 13 ms returned []
Running 317 sub problems to find dead transitions.
[2026-05-26 14:42:33] [INFO ] Flow matrix only has 287 transitions (discarded 33 similar events)
[2026-05-26 14:42:33] [INFO ] Invariant cache hit.
[2026-05-26 14:42:33] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 286/399 variables, 113/126 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 42/168 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/401 variables, and 169 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 114/114 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 286/399 variables, 113/127 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 42/169 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 317/486 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 2/488 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/401 variables, and 488 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/114 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in SI_LTL mode, iteration 1 : 114/126 places, 320/340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61019 ms. Remains : 114/126 places, 320/340 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-09-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 365 ms.
Product exploration explored 100000 steps with 0 reset in 233 ms.
Computed a total of 14 stabilizing places and 30 stable transitions
Computed a total of 14 stabilizing places and 30 stable transitions
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 19817 steps (1129 resets) in 132 ms. (149 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 374 ms.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 320/320 transitions.
Applied a total of 0 rules in 14 ms. Remains 114 /114 variables (removed 0) and now considering 320/320 (removed 0) transitions.
[2026-05-26 14:43:35] [INFO ] Flow matrix only has 287 transitions (discarded 33 similar events)
[2026-05-26 14:43:35] [INFO ] Invariant cache hit.
[2026-05-26 14:43:35] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-26 14:43:35] [INFO ] Flow matrix only has 287 transitions (discarded 33 similar events)
[2026-05-26 14:43:35] [INFO ] Invariant cache hit.
[2026-05-26 14:43:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-26 14:43:36] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
[2026-05-26 14:43:36] [INFO ] Redundant transitions in 8 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 881 ms. Remains : 114/114 places, 320/320 transitions.
Computed a total of 14 stabilizing places and 30 stable transitions
Computed a total of 14 stabilizing places and 30 stable transitions
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 34806 steps (2081 resets) in 166 ms. (208 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 304 ms.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 85 ms.
Product exploration explored 100000 steps with 0 reset in 111 ms.
Built C files in :
/tmp/ltsmin6859719791748312378
[2026-05-26 14:43:36] [INFO ] Computing symmetric may disable matrix : 320 transitions.
[2026-05-26 14:43:36] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:43:36] [INFO ] Computing symmetric may enable matrix : 320 transitions.
[2026-05-26 14:43:36] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:43:36] [INFO ] Computing Do-Not-Accords matrix : 320 transitions.
[2026-05-26 14:43:36] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:43:36] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6859719791748312378
Running compilation step : cd /tmp/ltsmin6859719791748312378;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1865 ms.
Running link step : cd /tmp/ltsmin6859719791748312378;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin6859719791748312378;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14337295198135653399.hoa' '--buchi-type=spotba'
LTSmin run took 1629 ms.
FORMULA FireWire-PT-09-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-09-LTLCardinality-01 finished in 67570 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))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 340/340 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 336
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 124 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 123 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 123 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 122 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 122 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 121 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 121 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 120 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 120 transition count 325
Applied a total of 13 rules in 11 ms. Remains 120 /126 variables (removed 6) and now considering 325/340 (removed 15) transitions.
[2026-05-26 14:43:40] [INFO ] Flow matrix only has 299 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16761674612644483338.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13066419117346181639.kers'
[2026-05-26 14:43:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16761674612644483338.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13066419117346181639.kers]
Normalized transition count is 298 out of 299 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 298 rows 120 cols 1013 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-26 14:43:40] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13066419117346181639.kers
Total runtime 2 ms.
[2026-05-26 14:43:40] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-26 14:43:40] [INFO ] Flow matrix only has 299 transitions (discarded 26 similar events)
[2026-05-26 14:43:40] [INFO ] Invariant cache hit.
[2026-05-26 14:43:40] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-26 14:43:40] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2026-05-26 14:43:40] [INFO ] Flow matrix only has 299 transitions (discarded 26 similar events)
[2026-05-26 14:43:40] [INFO ] Invariant cache hit.
[2026-05-26 14:43:40] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 298/418 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (OVERLAPS) 1/419 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 9 (OVERLAPS) 0/419 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 174 constraints, problems are : Problem set: 0 solved, 324 unsolved in 30002 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 298/418 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 324/497 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 2/499 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/419 variables, and 499 constraints, problems are : Problem set: 0 solved, 324 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 42/43 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 120/126 places, 325/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60530 ms. Remains : 120/126 places, 325/340 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))'
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FireWire-PT-09-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 265 ms.
Product exploration explored 100000 steps with 50000 reset in 358 ms.
Computed a total of 17 stabilizing places and 35 stable transitions
Computed a total of 17 stabilizing places and 35 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 13 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 24 ms.
FORMULA FireWire-PT-09-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-09-LTLCardinality-02 finished in 61300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p1&&F((p2&&X(p3)))))||p0)))'
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 340/340 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 338
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 338
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 124 transition count 335
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 124 transition count 335
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 123 transition count 333
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 123 transition count 333
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 122 transition count 330
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 122 transition count 330
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 121 transition count 328
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 121 transition count 328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 120 transition count 325
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 120 transition count 325
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 119 transition count 323
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 119 transition count 323
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 118 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 117 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 117 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 116 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 115 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 115 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 114 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 114 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 113 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 113 transition count 309
Applied a total of 26 rules in 22 ms. Remains 113 /126 variables (removed 13) and now considering 309/340 (removed 31) transitions.
[2026-05-26 14:44:41] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9129136096598479288.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15228616811581135051.kers'
[2026-05-26 14:44:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9129136096598479288.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15228616811581135051.kers]
Normalized transition count is 282 out of 283 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 282 rows 113 cols 955 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-26 14:44:41] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15228616811581135051.kers
Total runtime 2 ms.
[2026-05-26 14:44:41] [INFO ] Implicit Places using invariants in 144 ms returned []
[2026-05-26 14:44:41] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2026-05-26 14:44:41] [INFO ] Invariant cache hit.
[2026-05-26 14:44:42] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 14:44:42] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2026-05-26 14:44:42] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2026-05-26 14:44:42] [INFO ] Invariant cache hit.
[2026-05-26 14:44:42] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 282/395 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 1/396 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (OVERLAPS) 0/396 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 163 constraints, problems are : Problem set: 0 solved, 308 unsolved in 25605 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 282/395 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 308/470 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/396 variables, and 471 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55724ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 55726ms
Starting structural reductions in LTL mode, iteration 1 : 113/126 places, 309/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56536 ms. Remains : 113/126 places, 309/340 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p1&&F((p2&&X(p3)))))||p0)))'
Stuttering acceptance computed with spot in 256 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), true, (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : FireWire-PT-09-LTLCardinality-04
Product exploration explored 100000 steps with 1 reset in 424 ms.
Product exploration explored 100000 steps with 0 reset in 149 ms.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Knowledge based reduction with 25 factoid took 75 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter sensitive) to 5 states, 14 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 12 to 10
RANDOM walk for 40000 steps (2239 resets) in 338 ms. (117 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (533 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (543 resets) in 126 ms. (314 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (577 resets) in 183 ms. (217 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (606 resets) in 152 ms. (261 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (555 resets) in 145 ms. (273 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (655 resets) in 223 ms. (178 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (566 resets) in 216 ms. (184 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (614 resets) in 169 ms. (235 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (592 resets) in 185 ms. (215 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (591 resets) in 143 ms. (277 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 625355 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :7 out of 10
Probabilistic random walk after 625355 steps, saw 121347 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :7
[2026-05-26 14:45:42] [INFO ] Flow matrix only has 283 transitions (discarded 26 similar events)
[2026-05-26 14:45:42] [INFO ] Invariant cache hit.
[2026-05-26 14:45:42] [INFO ] State equation strengthened by 40 read => feed constraints.
Problem apf5 is UNSAT
Problem apf6 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Real declared 4/396 variables, and 0 constraints, problems are : Problem set: 3 solved, 0 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/113 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge based reduction with 28 factoid took 162 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0)]
Knowledge-based reduction took 3993 ms.
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0)]
Support contains 2 out of 113 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 309/309 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 307
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 108 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 108 transition count 307
Applied a total of 14 rules in 34 ms. Remains 108 /113 variables (removed 5) and now considering 307/309 (removed 2) transitions.
[2026-05-26 14:45:43] [INFO ] Flow matrix only has 274 transitions (discarded 33 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17022266024167679978.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2939434836104119830.kers'
[2026-05-26 14:45:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17022266024167679978.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2939434836104119830.kers]
Normalized transition count is 273 out of 274 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 273 rows 108 cols 923 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-26 14:45:43] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2939434836104119830.kers
Total runtime 2 ms.
[2026-05-26 14:45:43] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-26 14:45:43] [INFO ] Flow matrix only has 274 transitions (discarded 33 similar events)
[2026-05-26 14:45:43] [INFO ] Invariant cache hit.
[2026-05-26 14:45:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 14:45:43] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
[2026-05-26 14:45:43] [INFO ] Redundant transitions in 4 ms returned []
Running 304 sub problems to find dead transitions.
[2026-05-26 14:45:43] [INFO ] Flow matrix only has 274 transitions (discarded 33 similar events)
[2026-05-26 14:45:43] [INFO ] Invariant cache hit.
[2026-05-26 14:45:43] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 273/380 variables, 107/120 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 40/160 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 1/381 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/382 variables, and 161 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 273/380 variables, 107/120 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 40/160 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 304/464 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 2/466 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/382 variables, and 467 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Starting structural reductions in SI_LTL mode, iteration 1 : 108/113 places, 307/309 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60838 ms. Remains : 108/113 places, 307/309 transitions.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (2365 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (651 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 82344 steps, run visited all 1 properties in 268 ms. (steps per millisecond=307 )
Probabilistic random walk after 82344 steps, saw 17207 distinct states, run finished after 277 ms. (steps per millisecond=297 ) properties seen :1
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Knowledge-based reduction took 571 ms.
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 64 ms.
Product exploration explored 100000 steps with 2 reset in 154 ms.
Built C files in :
/tmp/ltsmin14253094709511573323
[2026-05-26 14:46:44] [INFO ] Computing symmetric may disable matrix : 307 transitions.
[2026-05-26 14:46:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:46:44] [INFO ] Computing symmetric may enable matrix : 307 transitions.
[2026-05-26 14:46:45] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:46:45] [INFO ] Computing Do-Not-Accords matrix : 307 transitions.
[2026-05-26 14:46:45] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:46:45] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14253094709511573323
Running compilation step : cd /tmp/ltsmin14253094709511573323;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1118 ms.
Running link step : cd /tmp/ltsmin14253094709511573323;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin14253094709511573323;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15473197119492145945.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 307/307 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 107 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 107 transition count 304
Applied a total of 3 rules in 12 ms. Remains 107 /108 variables (removed 1) and now considering 304/307 (removed 3) transitions.
[2026-05-26 14:47:00] [INFO ] Flow matrix only has 271 transitions (discarded 33 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2475053088504187979.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18261943883138887653.kers'
[2026-05-26 14:47:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2475053088504187979.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18261943883138887653.kers]
Normalized transition count is 270 out of 271 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 270 rows 107 cols 911 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-26 14:47:00] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18261943883138887653.kers
Total runtime 1 ms.
[2026-05-26 14:47:00] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-26 14:47:00] [INFO ] Flow matrix only has 271 transitions (discarded 33 similar events)
[2026-05-26 14:47:00] [INFO ] Invariant cache hit.
[2026-05-26 14:47:00] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 14:47:00] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2026-05-26 14:47:00] [INFO ] Redundant transitions in 2 ms returned []
Running 301 sub problems to find dead transitions.
[2026-05-26 14:47:00] [INFO ] Flow matrix only has 271 transitions (discarded 33 similar events)
[2026-05-26 14:47:00] [INFO ] Invariant cache hit.
[2026-05-26 14:47:00] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 270/376 variables, 106/118 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 40/158 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (OVERLAPS) 1/377 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 377/378 variables, and 160 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 270/376 variables, 106/119 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 40/159 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 301/460 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
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 376/378 variables, and 465 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 106/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Starting structural reductions in SI_LTL mode, iteration 1 : 107/108 places, 304/307 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60473 ms. Remains : 107/108 places, 304/307 transitions.
Built C files in :
/tmp/ltsmin14814179074737438693
[2026-05-26 14:48:00] [INFO ] Computing symmetric may disable matrix : 304 transitions.
[2026-05-26 14:48:00] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:48:00] [INFO ] Computing symmetric may enable matrix : 304 transitions.
[2026-05-26 14:48:00] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:48:00] [INFO ] Computing Do-Not-Accords matrix : 304 transitions.
[2026-05-26 14:48:00] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:48:00] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14814179074737438693
Running compilation step : cd /tmp/ltsmin14814179074737438693;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1119 ms.
Running link step : cd /tmp/ltsmin14814179074737438693;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin14814179074737438693;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9570003464589611108.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 14:48:15] [INFO ] Flatten gal took : 24 ms
[2026-05-26 14:48:15] [INFO ] Flatten gal took : 31 ms
[2026-05-26 14:48:15] [INFO ] Time to serialize gal into /tmp/LTL10865275904492189268.gal : 11 ms
[2026-05-26 14:48:15] [INFO ] Time to serialize properties into /tmp/LTL1795410338843797243.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/LTL10865275904492189268.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6324519928347100115.hoa' '-atoms' '/tmp/LTL1795410338843797243.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/LTL1795410338843797243.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6324519928347100115.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t7, t8, t12, t13, t15, t18, t20, t24, t25, t27, t30, t32, t36, t37, t39, t40, t42, t4...613
Computing Next relation with stutter on 48059 deadlock states
Detected timeout of ITS tools.
[2026-05-26 14:48:30] [INFO ] Flatten gal took : 23 ms
[2026-05-26 14:48:30] [INFO ] Flatten gal took : 21 ms
[2026-05-26 14:48:30] [INFO ] Time to serialize gal into /tmp/LTL6916086177061803354.gal : 4 ms
[2026-05-26 14:48:30] [INFO ] Time to serialize properties into /tmp/LTL14903951895250052705.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/LTL6916086177061803354.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14903951895250052705.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 : !((G(("((p44==0)||(p58==1))")||(G(("((p44==0)||(p58==1))")&&(F(("((p99==0)||(p94==1))")&&(X("((p17==0)||(p20==1))")))))))))
Formula 0 simplified : F!"((p44==0)||(p58==1))"
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t7, t8, t12, t13, t15, t18, t20, t24, t25, t27, t30, t32, t36, t37, t39, t40, t42, t4...619
Computing Next relation with stutter on 49519 deadlock states
Detected timeout of ITS tools.
[2026-05-26 14:48:45] [INFO ] Flatten gal took : 18 ms
[2026-05-26 14:48:45] [INFO ] Applying decomposition
[2026-05-26 14:48:45] [INFO ] Flatten gal took : 16 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/graph16159136724469255127.txt' '-o' '/tmp/graph16159136724469255127.bin' '-w' '/tmp/graph16159136724469255127.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16159136724469255127.bin' '-l' '-1' '-v' '-w' '/tmp/graph16159136724469255127.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:48:45] [INFO ] Decomposing Gal with order
[2026-05-26 14:48:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:48:46] [INFO ] Removed a total of 436 redundant transitions.
[2026-05-26 14:48:46] [INFO ] Flatten gal took : 109 ms
[2026-05-26 14:48:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 29 ms.
[2026-05-26 14:48:46] [INFO ] Time to serialize gal into /tmp/LTL649598087151715078.gal : 11 ms
[2026-05-26 14:48:46] [INFO ] Time to serialize properties into /tmp/LTL4640312648037653072.ltl : 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/LTL649598087151715078.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4640312648037653072.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...253
Read 1 LTL properties
Checking formula 0 : !((G(("((i2.i0.u11.p44==0)||(i3.u16.p58==1))")||(G(("((i2.i0.u11.p44==0)||(i3.u16.p58==1))")&&(F(("((i5.i1.u28.p99==0)||(i5.i1.u26.p94...213
Formula 0 simplified : F!"((i2.i0.u11.p44==0)||(i3.u16.p58==1))"
Reverse transition relation is NOT exact ! Due to transitions t7, t40, t42, t43, t46, t47, t49, t57, t62, t67, t72, t77, t80, t81, t89, t90, t91, t92, t95,...714
Computing Next relation with stutter on 49519 deadlock states
Detected timeout of ITS tools.
Treatment of property FireWire-PT-09-LTLCardinality-04 finished in 259430 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(p1)&&p0)))'
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 340/340 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 336
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 124 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 123 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 123 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 122 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 122 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 121 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 121 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 120 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 120 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 119 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 119 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 118 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 117 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 117 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 116 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 113 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 113 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 112 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 112 transition count 306
Applied a total of 29 rules in 16 ms. Remains 112 /126 variables (removed 14) and now considering 306/340 (removed 34) transitions.
[2026-05-26 14:49:01] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16453133380891457604.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5262675148954217016.kers'
[2026-05-26 14:49:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16453133380891457604.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5262675148954217016.kers]
Normalized transition count is 279 out of 280 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 112 cols 943 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-26 14:49:01] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5262675148954217016.kers
Total runtime 2 ms.
[2026-05-26 14:49:01] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-26 14:49:01] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2026-05-26 14:49:01] [INFO ] Invariant cache hit.
[2026-05-26 14:49:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 14:49:01] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2026-05-26 14:49:01] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2026-05-26 14:49:01] [INFO ] Invariant cache hit.
[2026-05-26 14:49:01] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 162 constraints, problems are : Problem set: 0 solved, 305 unsolved in 25619 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 305/466 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/392 variables, and 467 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55758ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 55760ms
Starting structural reductions in LTL mode, iteration 1 : 112/126 places, 306/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56146 ms. Remains : 112/126 places, 306/340 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(p1)&&p0)))'
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : FireWire-PT-09-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-09-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-09-LTLCardinality-05 finished in 56342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 340/340 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 337
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 124 transition count 336
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 123 transition count 335
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 120 transition count 341
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 17 place count 120 transition count 335
Applied a total of 17 rules in 30 ms. Remains 120 /126 variables (removed 6) and now considering 335/340 (removed 5) transitions.
[2026-05-26 14:49:57] [INFO ] Flow matrix only has 302 transitions (discarded 33 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13679358975333715517.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9116043054657296648.kers'
[2026-05-26 14:49:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13679358975333715517.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9116043054657296648.kers]
Normalized transition count is 301 out of 302 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 301 rows 120 cols 1023 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-26 14:49:57] [INFO ] Computed 6 invariants in 3 ms
Computed 6 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9116043054657296648.kers
Total runtime 4 ms.
[2026-05-26 14:49:57] [INFO ] Implicit Places using invariants in 199 ms returned []
[2026-05-26 14:49:57] [INFO ] Flow matrix only has 302 transitions (discarded 33 similar events)
[2026-05-26 14:49:57] [INFO ] Invariant cache hit.
[2026-05-26 14:49:57] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 14:49:58] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2026-05-26 14:49:58] [INFO ] Redundant transitions in 4 ms returned []
Running 332 sub problems to find dead transitions.
[2026-05-26 14:49:58] [INFO ] Flow matrix only has 302 transitions (discarded 33 similar events)
[2026-05-26 14:49:58] [INFO ] Invariant cache hit.
[2026-05-26 14:49:58] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (OVERLAPS) 301/420 variables, 119/132 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (OVERLAPS) 1/421 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/422 variables, and 179 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (OVERLAPS) 301/420 variables, 119/133 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 45/178 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 332/510 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/422 variables, and 514 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60181ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Starting structural reductions in SI_LTL mode, iteration 1 : 120/126 places, 335/340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60880 ms. Remains : 120/126 places, 335/340 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-09-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-09-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-09-LTLCardinality-06 finished in 60960 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) U X(p0)))'
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 340/340 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 336
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 124 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 123 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 123 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 122 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 122 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 121 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 121 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 120 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 120 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 119 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 119 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 118 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 117 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 117 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 116 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 113 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 113 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 112 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 112 transition count 306
Applied a total of 29 rules in 22 ms. Remains 112 /126 variables (removed 14) and now considering 306/340 (removed 34) transitions.
[2026-05-26 14:50:58] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12410009083945077216.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12440383809563182965.kers'
[2026-05-26 14:50:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12410009083945077216.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12440383809563182965.kers]
Normalized transition count is 279 out of 280 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 112 cols 943 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-26 14:50:58] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12440383809563182965.kers
Total runtime 2 ms.
[2026-05-26 14:50:58] [INFO ] Implicit Places using invariants in 158 ms returned []
[2026-05-26 14:50:58] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2026-05-26 14:50:58] [INFO ] Invariant cache hit.
[2026-05-26 14:50:58] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 14:50:59] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2026-05-26 14:50:59] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2026-05-26 14:50:59] [INFO ] Invariant cache hit.
[2026-05-26 14:50:59] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 162 constraints, problems are : Problem set: 0 solved, 305 unsolved in 25635 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 305/466 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/392 variables, and 467 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55778ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 55779ms
Starting structural reductions in LTL mode, iteration 1 : 112/126 places, 306/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56368 ms. Remains : 112/126 places, 306/340 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) U X(p0)))'
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-09-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 215 ms.
Product exploration explored 100000 steps with 50000 reset in 252 ms.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 18 ms. Proved property starting from automaton with 5 states, 9 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 23 ms.
FORMULA FireWire-PT-09-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-09-LTLCardinality-07 finished in 57088 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 340/340 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 123 transition count 335
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 123 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 123 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 122 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 122 transition count 331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 121 transition count 330
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 118 transition count 336
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 118 transition count 330
Applied a total of 21 rules in 32 ms. Remains 118 /126 variables (removed 8) and now considering 330/340 (removed 10) transitions.
[2026-05-26 14:51:55] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15595934210523754963.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11947285912137944924.kers'
[2026-05-26 14:51:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15595934210523754963.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11947285912137944924.kers]
Normalized transition count is 296 out of 297 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 296 rows 118 cols 1007 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-26 14:51:55] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11947285912137944924.kers
Total runtime 2 ms.
[2026-05-26 14:51:55] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-26 14:51:55] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
[2026-05-26 14:51:55] [INFO ] Invariant cache hit.
[2026-05-26 14:51:55] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-26 14:51:56] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2026-05-26 14:51:56] [INFO ] Redundant transitions in 3 ms returned []
Running 327 sub problems to find dead transitions.
[2026-05-26 14:51:56] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
[2026-05-26 14:51:56] [INFO ] Invariant cache hit.
[2026-05-26 14:51:56] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (OVERLAPS) 296/413 variables, 117/132 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 44/176 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 8 (OVERLAPS) 1/414 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/415 variables, and 177 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (OVERLAPS) 296/413 variables, 117/132 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 44/176 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 327/503 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 2/505 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/415 variables, and 507 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 117/118 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Starting structural reductions in SI_LTL mode, iteration 1 : 118/126 places, 330/340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60890 ms. Remains : 118/126 places, 330/340 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-09-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 104 ms.
Product exploration explored 100000 steps with 1 reset in 119 ms.
Computed a total of 18 stabilizing places and 40 stable transitions
Computed a total of 18 stabilizing places and 40 stable transitions
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 24952 steps (1413 resets) in 76 ms. (324 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Knowledge-based reduction took 244 ms.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 330/330 transitions.
Applied a total of 0 rules in 10 ms. Remains 118 /118 variables (removed 0) and now considering 330/330 (removed 0) transitions.
[2026-05-26 14:52:57] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
[2026-05-26 14:52:57] [INFO ] Invariant cache hit.
[2026-05-26 14:52:57] [INFO ] Implicit Places using invariants in 181 ms returned []
[2026-05-26 14:52:57] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
[2026-05-26 14:52:57] [INFO ] Invariant cache hit.
[2026-05-26 14:52:57] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-26 14:52:57] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
[2026-05-26 14:52:57] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 669 ms. Remains : 118/118 places, 330/330 transitions.
Computed a total of 18 stabilizing places and 40 stable transitions
Computed a total of 18 stabilizing places and 40 stable transitions
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 26330 steps (1505 resets) in 86 ms. (302 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Knowledge-based reduction took 224 ms.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 89 ms.
Product exploration explored 100000 steps with 4 reset in 102 ms.
Built C files in :
/tmp/ltsmin472286484259790168
[2026-05-26 14:52:58] [INFO ] Computing symmetric may disable matrix : 330 transitions.
[2026-05-26 14:52:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:52:58] [INFO ] Computing symmetric may enable matrix : 330 transitions.
[2026-05-26 14:52:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:52:58] [INFO ] Computing Do-Not-Accords matrix : 330 transitions.
[2026-05-26 14:52:58] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:52:58] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin472286484259790168
Running compilation step : cd /tmp/ltsmin472286484259790168;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1222 ms.
Running link step : cd /tmp/ltsmin472286484259790168;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin472286484259790168;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5936502403976126997.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 330/330 transitions.
Applied a total of 0 rules in 6 ms. Remains 118 /118 variables (removed 0) and now considering 330/330 (removed 0) transitions.
[2026-05-26 14:53:13] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
[2026-05-26 14:53:13] [INFO ] Invariant cache hit.
[2026-05-26 14:53:13] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-26 14:53:13] [INFO ] Flow matrix only has 297 transitions (discarded 33 similar events)
[2026-05-26 14:53:13] [INFO ] Invariant cache hit.
[2026-05-26 14:53:13] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-26 14:53:13] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2026-05-26 14:53:13] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 496 ms. Remains : 118/118 places, 330/330 transitions.
Built C files in :
/tmp/ltsmin8016496778500554222
[2026-05-26 14:53:13] [INFO ] Computing symmetric may disable matrix : 330 transitions.
[2026-05-26 14:53:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:53:13] [INFO ] Computing symmetric may enable matrix : 330 transitions.
[2026-05-26 14:53:13] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:53:13] [INFO ] Computing Do-Not-Accords matrix : 330 transitions.
[2026-05-26 14:53:13] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:53:13] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8016496778500554222
Running compilation step : cd /tmp/ltsmin8016496778500554222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1311 ms.
Running link step : cd /tmp/ltsmin8016496778500554222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin8016496778500554222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3624256729893916008.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 14:53:28] [INFO ] Flatten gal took : 20 ms
[2026-05-26 14:53:28] [INFO ] Flatten gal took : 19 ms
[2026-05-26 14:53:28] [INFO ] Time to serialize gal into /tmp/LTL3139155529486497744.gal : 4 ms
[2026-05-26 14:53:28] [INFO ] Time to serialize properties into /tmp/LTL1646190678453623963.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/LTL3139155529486497744.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1541400160940751312.hoa' '-atoms' '/tmp/LTL1646190678453623963.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...317
Loading property file /tmp/LTL1646190678453623963.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1541400160940751312.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t7, t8, t12, t13, t15, t18, t20, t24, t25, t27, t30, t32, t36, t37, t39, t40, t42, t4...674
Computing Next relation with stutter on 50074 deadlock states
Detected timeout of ITS tools.
[2026-05-26 14:53:43] [INFO ] Flatten gal took : 16 ms
[2026-05-26 14:53:43] [INFO ] Flatten gal took : 15 ms
[2026-05-26 14:53:43] [INFO ] Time to serialize gal into /tmp/LTL1391302365519341516.gal : 3 ms
[2026-05-26 14:53:43] [INFO ] Time to serialize properties into /tmp/LTL6441911252051519376.ltl : 0 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/LTL1391302365519341516.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6441911252051519376.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...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((p51==0)||(p117==1))"))))
Formula 0 simplified : GF!"((p51==0)||(p117==1))"
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t7, t8, t12, t13, t15, t18, t20, t24, t25, t27, t30, t32, t36, t37, t39, t40, t42, t4...674
Computing Next relation with stutter on 50074 deadlock states
Detected timeout of ITS tools.
[2026-05-26 14:53:59] [INFO ] Flatten gal took : 14 ms
[2026-05-26 14:53:59] [INFO ] Applying decomposition
[2026-05-26 14:53:59] [INFO ] Flatten gal took : 13 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/graph16359582019431112454.txt' '-o' '/tmp/graph16359582019431112454.bin' '-w' '/tmp/graph16359582019431112454.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16359582019431112454.bin' '-l' '-1' '-v' '-w' '/tmp/graph16359582019431112454.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:53:59] [INFO ] Decomposing Gal with order
[2026-05-26 14:53:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:53:59] [INFO ] Removed a total of 494 redundant transitions.
[2026-05-26 14:53:59] [INFO ] Flatten gal took : 55 ms
[2026-05-26 14:53:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 22 ms.
[2026-05-26 14:53:59] [INFO ] Time to serialize gal into /tmp/LTL10574265703272639401.gal : 6 ms
[2026-05-26 14:53:59] [INFO ] Time to serialize properties into /tmp/LTL15842680393289439096.ltl : 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/LTL10574265703272639401.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15842680393289439096.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 : !((F(G("((i3.i2.u14.p51==0)||(i2.u33.p117==1))"))))
Formula 0 simplified : GF!"((i3.i2.u14.p51==0)||(i2.u33.p117==1))"
Reverse transition relation is NOT exact ! Due to transitions t40, t42, t43, t46, t47, t49, t55, t57, t58, t62, t67, t72, t77, t81, t89, t90, t91, t92, t97...737
Computing Next relation with stutter on 50074 deadlock states
Detected timeout of ITS tools.
Treatment of property FireWire-PT-09-LTLCardinality-08 finished in 138661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X((X(G(p0)) U G(p0)))))))'
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 340/340 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 336
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 124 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 123 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 123 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 122 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 122 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 121 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 121 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 120 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 120 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 119 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 119 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 118 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 117 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 117 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 116 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 113 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 113 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 112 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 112 transition count 306
Applied a total of 29 rules in 13 ms. Remains 112 /126 variables (removed 14) and now considering 306/340 (removed 34) transitions.
[2026-05-26 14:54:14] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6172662154865605679.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9615196229260849251.kers'
[2026-05-26 14:54:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6172662154865605679.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9615196229260849251.kers]
Normalized transition count is 279 out of 280 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 112 cols 943 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-26 14:54:14] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9615196229260849251.kers
Total runtime 2 ms.
[2026-05-26 14:54:14] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-26 14:54:14] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2026-05-26 14:54:14] [INFO ] Invariant cache hit.
[2026-05-26 14:54:14] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 14:54:14] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2026-05-26 14:54:14] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2026-05-26 14:54:14] [INFO ] Invariant cache hit.
[2026-05-26 14:54:14] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 162 constraints, problems are : Problem set: 0 solved, 305 unsolved in 27401 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 279/391 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 39/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 305/466 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/392 variables, and 467 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 57547ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 57549ms
Starting structural reductions in LTL mode, iteration 1 : 112/126 places, 306/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58024 ms. Remains : 112/126 places, 306/340 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||X((X(G(p0)) U G(p0)))))))'
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-09-LTLCardinality-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-09-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-09-LTLCardinality-11 finished in 58305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 340/340 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 336
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 124 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 123 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 123 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 122 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 122 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 121 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 121 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 120 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 120 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 119 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 119 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 118 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 117 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 117 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 116 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 113 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 113 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 112 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 112 transition count 306
Applied a total of 29 rules in 22 ms. Remains 112 /126 variables (removed 14) and now considering 306/340 (removed 34) transitions.
[2026-05-26 14:55:12] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2026-05-26 14:55:12] [INFO ] Invariant cache hit.
[2026-05-26 14:55:12] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-26 14:55:12] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2026-05-26 14:55:12] [INFO ] Invariant cache hit.
[2026-05-26 14:55:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 14:55:13] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 112/126 places, 306/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 571 ms. Remains : 112/126 places, 306/340 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-09-LTLCardinality-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-09-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-09-LTLCardinality-12 finished in 708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 340/340 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 337
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 124 transition count 336
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 123 transition count 335
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 120 transition count 341
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 17 place count 120 transition count 335
Applied a total of 17 rules in 15 ms. Remains 120 /126 variables (removed 6) and now considering 335/340 (removed 5) transitions.
[2026-05-26 14:55:13] [INFO ] Flow matrix only has 302 transitions (discarded 33 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4026216656069985696.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9058229369844644405.kers'
[2026-05-26 14:55:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4026216656069985696.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9058229369844644405.kers]
Normalized transition count is 301 out of 302 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 301 rows 120 cols 1023 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-26 14:55:13] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9058229369844644405.kers
Total runtime 1 ms.
[2026-05-26 14:55:13] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-26 14:55:13] [INFO ] Flow matrix only has 302 transitions (discarded 33 similar events)
[2026-05-26 14:55:13] [INFO ] Invariant cache hit.
[2026-05-26 14:55:13] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 14:55:13] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2026-05-26 14:55:13] [INFO ] Redundant transitions in 4 ms returned []
Running 332 sub problems to find dead transitions.
[2026-05-26 14:55:13] [INFO ] Flow matrix only has 302 transitions (discarded 33 similar events)
[2026-05-26 14:55:13] [INFO ] Invariant cache hit.
[2026-05-26 14:55:13] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (OVERLAPS) 301/420 variables, 119/132 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (OVERLAPS) 1/421 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/422 variables, and 179 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (OVERLAPS) 301/420 variables, 119/133 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 45/178 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 332/510 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/422 variables, and 514 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60190ms
Starting structural reductions in SI_LTL mode, iteration 1 : 120/126 places, 335/340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60698 ms. Remains : 120/126 places, 335/340 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-09-LTLCardinality-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-09-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-09-LTLCardinality-13 finished in 60769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)&&X(p2)))'
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 340/340 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 336
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 124 transition count 335
Applied a total of 5 rules in 4 ms. Remains 124 /126 variables (removed 2) and now considering 335/340 (removed 5) transitions.
[2026-05-26 14:56:14] [INFO ] Flow matrix only has 309 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14851296365231206355.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14218135138542660055.kers'
[2026-05-26 14:56:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14851296365231206355.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14218135138542660055.kers]
Normalized transition count is 308 out of 309 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 308 rows 124 cols 1049 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-26 14:56:14] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14218135138542660055.kers
Total runtime 2 ms.
[2026-05-26 14:56:14] [INFO ] Implicit Places using invariants in 186 ms returned []
[2026-05-26 14:56:14] [INFO ] Flow matrix only has 309 transitions (discarded 26 similar events)
[2026-05-26 14:56:14] [INFO ] Invariant cache hit.
[2026-05-26 14:56:14] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 14:56:14] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
Running 334 sub problems to find dead transitions.
[2026-05-26 14:56:14] [INFO ] Flow matrix only has 309 transitions (discarded 26 similar events)
[2026-05-26 14:56:14] [INFO ] Invariant cache hit.
[2026-05-26 14:56:14] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 308/432 variables, 124/135 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 44/179 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 7 (OVERLAPS) 1/433 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (OVERLAPS) 0/433 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 334 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 180 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 308/432 variables, 124/135 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 44/179 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 334/513 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/433 variables, and 514 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 44/45 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in LTL mode, iteration 1 : 124/126 places, 335/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60887 ms. Remains : 124/126 places, 335/340 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)&&X(p2)))'
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : FireWire-PT-09-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-09-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-09-LTLCardinality-14 finished in 61073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p1&&F((p2&&X(p3)))))||p0)))'
Spot run failed in 154 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Spot run failed in 75 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-26 14:57:15] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9587897651870873485
[2026-05-26 14:57:15] [INFO ] Computing symmetric may disable matrix : 340 transitions.
[2026-05-26 14:57:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:57:15] [INFO ] Applying decomposition
[2026-05-26 14:57:15] [INFO ] Computing symmetric may enable matrix : 340 transitions.
[2026-05-26 14:57:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:57:15] [INFO ] Flatten gal took : 19 ms
[2026-05-26 14:57:15] [INFO ] Computing Do-Not-Accords matrix : 340 transitions.
[2026-05-26 14:57:15] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:57:15] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9587897651870873485
Running compilation step : cd /tmp/ltsmin9587897651870873485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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'
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/graph420154460060368395.txt' '-o' '/tmp/graph420154460060368395.bin' '-w' '/tmp/graph420154460060368395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph420154460060368395.bin' '-l' '-1' '-v' '-w' '/tmp/graph420154460060368395.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:57:15] [INFO ] Decomposing Gal with order
[2026-05-26 14:57:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:57:15] [INFO ] Removed a total of 545 redundant transitions.
[2026-05-26 14:57:15] [INFO ] Flatten gal took : 51 ms
[2026-05-26 14:57:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 19 ms.
[2026-05-26 14:57:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality11925050362666200993.gal : 6 ms
[2026-05-26 14:57:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality18328307138505506652.ltl : 0 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/LTLCardinality11925050362666200993.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18328307138505506652.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...278
Read 2 LTL properties
Checking formula 0 : !((G(("((i0.u14.p44==0)||(i4.u20.p58==1))")||(G(("((i0.u14.p44==0)||(i4.u20.p58==1))")&&(F(("((i1.i2.u34.p99==0)||(i1.i2.u32.p94==1))"...207
Formula 0 simplified : F!"((i0.u14.p44==0)||(i4.u20.p58==1))"
Compilation finished in 1273 ms.
Running link step : cd /tmp/ltsmin9587897651870873485;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9587897651870873485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](([](((LTLAPp1==true)&&<>(((LTLAPp2==true)&&X((LTLAPp3==true))))))||(LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t40, t42, t43, t46, t47, t57, t62, t67, t72, t75, t77, t92, t104, t136, t137, t138, t...814
Computing Next relation with stutter on 51625 deadlock states
LTSmin run took 6480 ms.
FORMULA FireWire-PT-09-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin9587897651870873485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp4==true)))' '--buchi-type=spotba'
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2139 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,21.4496,443792,1,0,736271,3646,3447,1.27446e+06,370,24242,2212716
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Checking formula 1 : !((F(G("((i3.i1.u17.p51==0)||(i6.i0.u42.p117==1))"))))
Formula 1 simplified : GF!"((i3.i1.u17.p51==0)||(i6.i0.u42.p117==1))"
Computing Next relation with stutter on 51625 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1540 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,36.848,775884,1,0,1.29391e+06,4156,3491,2.39681e+06,371,30477,3629802
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA FireWire-PT-09-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1113818 ms.

BK_STOP 1779807476561

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="FireWire-PT-09"
export BK_EXAMINATION="LTLCardinality"
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 FireWire-PT-09, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r130-smll-177955809000211"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-09.tgz
mv FireWire-PT-09 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;