Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 39K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748931782834

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-11a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 06:23:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 06:23:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 06:23:05] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2025-06-03 06:23:05] [INFO ] Transformed 113 places.
[2025-06-03 06:23:05] [INFO ] Transformed 155 transitions.
[2025-06-03 06:23:05] [INFO ] Found NUPN structural information;
[2025-06-03 06:23:05] [INFO ] Parsed PT model containing 113 places and 155 transitions and 498 arcs in 364 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 155/155 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 107 transition count 149
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 107 transition count 149
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 101 transition count 143
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 101 transition count 143
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 96 transition count 133
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 96 transition count 133
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 40 place count 96 transition count 127
Applied a total of 40 rules in 68 ms. Remains 96 /113 variables (removed 17) and now considering 127/155 (removed 28) transitions.
// Phase 1: matrix 127 rows 96 cols
[2025-06-03 06:23:06] [INFO ] Computed 2 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:06] [INFO ] Implicit Places using invariants in 368 ms returned []
[2025-06-03 06:23:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:06] [INFO ] State equation strengthened by 82 read => feed constraints.
[2025-06-03 06:23:06] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2025-06-03 06:23:06] [INFO ] Invariant cache hit.
[2025-06-03 06:23:06] [INFO ] State equation strengthened by 82 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 127/223 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 82/180 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 0/223 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 180 constraints, problems are : Problem set: 0 solved, 126 unsolved in 7257 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 127/223 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 82/180 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 126/306 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/223 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 306 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5797 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13154ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 13176ms
Starting structural reductions in LTL mode, iteration 1 : 96/113 places, 127/155 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14020 ms. Remains : 96/113 places, 127/155 transitions.
Support contains 30 out of 96 places after structural reductions.
[2025-06-03 06:23:20] [INFO ] Flatten gal took : 42 ms
[2025-06-03 06:23:20] [INFO ] Flatten gal took : 18 ms
[2025-06-03 06:23:20] [INFO ] Input system was already deterministic with 127 transitions.
Support contains 28 out of 96 places (down from 30) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 29 to 27
RANDOM walk for 27495 steps (227 resets) in 654 ms. (41 steps per ms) remains 0/27 properties
FORMULA DiscoveryGPU-PT-11a-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 14 stabilizing places and 12 stable transitions
Graph (complete) has 284 edges and 96 vertex of which 91 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G((G(F(p1)) U (G(!p2)||(!p2&&F(!p3))))))))'
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 127/127 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 91 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 91 transition count 122
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 87 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 87 transition count 118
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 84 transition count 115
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 84 transition count 115
Applied a total of 24 rules in 14 ms. Remains 84 /96 variables (removed 12) and now considering 115/127 (removed 12) transitions.
// Phase 1: matrix 115 rows 84 cols
[2025-06-03 06:23:21] [INFO ] Computed 2 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:21] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-03 06:23:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:21] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-03 06:23:21] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2025-06-03 06:23:21] [INFO ] Invariant cache hit.
[2025-06-03 06:23:21] [INFO ] State equation strengthened by 78 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 115/199 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 78/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 0/199 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 164 constraints, problems are : Problem set: 0 solved, 114 unsolved in 5502 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 115/199 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 78/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 114/278 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 278 constraints, problems are : Problem set: 0 solved, 114 unsolved in 4438 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9979ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 9982ms
Starting structural reductions in LTL mode, iteration 1 : 84/96 places, 115/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10263 ms. Remains : 84/96 places, 115/127 transitions.
Stuttering acceptance computed with spot in 635 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), (NOT p1), (NOT p1), p2, p2, (AND p2 p3), (AND (NOT p1) p3), (AND (NOT p1) p3 (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-01
Stuttering criterion allowed to conclude after 857 steps with 11 reset in 17 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-01 finished in 11018 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0&&G(p1)&&X((F(!p1)||G(!p0)))) U p2)))'
Support contains 5 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 127/127 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 123
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 123
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 89 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 89 transition count 120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 87 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 87 transition count 118
Applied a total of 18 rules in 22 ms. Remains 87 /96 variables (removed 9) and now considering 118/127 (removed 9) transitions.
// Phase 1: matrix 118 rows 87 cols
[2025-06-03 06:23:32] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:32] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-03 06:23:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:32] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-03 06:23:32] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2025-06-03 06:23:32] [INFO ] Invariant cache hit.
[2025-06-03 06:23:32] [INFO ] State equation strengthened by 79 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 118/205 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 117 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/205 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 168 constraints, problems are : Problem set: 0 solved, 117 unsolved in 5120 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 118/205 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 117/285 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 285 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4685 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9823ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 9825ms
Starting structural reductions in LTL mode, iteration 1 : 87/96 places, 118/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10077 ms. Remains : 87/96 places, 118/127 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) p0), (NOT p2), (OR (NOT p1) (NOT p2) p0), (NOT p2), true]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 470 ms.
Product exploration explored 100000 steps with 50000 reset in 410 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Graph (complete) has 269 edges and 87 vertex of which 85 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 12 stable transitions
Detected a total of 14/87 stabilizing places and 12/118 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1))))), (X (NOT p0)), (X p1), (X (X (NOT (OR p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 18 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-11a-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-02 finished in 11179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0&&X(X(X(p1))))||G(p1))))'
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 127/127 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 91 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 91 transition count 122
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 87 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 87 transition count 118
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 83 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 83 transition count 114
Applied a total of 26 rules in 19 ms. Remains 83 /96 variables (removed 13) and now considering 114/127 (removed 13) transitions.
// Phase 1: matrix 114 rows 83 cols
[2025-06-03 06:23:43] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:43] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-03 06:23:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:43] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-03 06:23:43] [INFO ] Implicit Places using invariants and state equation in 199 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 285 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/96 places, 114/127 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 310 ms. Remains : 82/96 places, 114/127 transitions.
Stuttering acceptance computed with spot in 328 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-03
Stuttering criterion allowed to conclude after 117 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-03 finished in 660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 127/127 transitions.
Graph (complete) has 284 edges and 96 vertex of which 92 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 106 edges and 89 vertex of which 80 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Graph (trivial) has 87 edges and 80 vertex of which 42 / 80 are part of one of the 21 SCC in 2 ms
Free SCC test removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 59 transition count 102
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 49 place count 48 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 47 transition count 80
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 59 place count 38 transition count 62
Iterating global reduction 3 with 9 rules applied. Total rules applied 68 place count 38 transition count 62
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 77 place count 29 transition count 44
Iterating global reduction 3 with 9 rules applied. Total rules applied 86 place count 29 transition count 44
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 94 place count 21 transition count 28
Iterating global reduction 3 with 8 rules applied. Total rules applied 102 place count 21 transition count 28
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 110 place count 13 transition count 20
Iterating global reduction 3 with 8 rules applied. Total rules applied 118 place count 13 transition count 20
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 3 with 2 rules applied. Total rules applied 120 place count 12 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 11 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 11 transition count 17
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 127 place count 8 transition count 14
Applied a total of 127 rules in 41 ms. Remains 8 /96 variables (removed 88) and now considering 14/127 (removed 113) transitions.
[2025-06-03 06:23:44] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2025-06-03 06:23:44] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:44] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-03 06:23:44] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2025-06-03 06:23:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:44] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:23:44] [INFO ] Redundant transitions in 1 ms returned []
Running 8 sub problems to find dead transitions.
[2025-06-03 06:23:44] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2025-06-03 06:23:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 4/18 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 8 constraints, problems are : Problem set: 0 solved, 8 unsolved in 152 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 4/18 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 16 constraints, problems are : Problem set: 0 solved, 8 unsolved in 138 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 296ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 296ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/96 places, 14/127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 395 ms. Remains : 8/96 places, 14/127 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-04 finished in 450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 127/127 transitions.
Graph (complete) has 284 edges and 96 vertex of which 91 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 91 transition count 117
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 86 transition count 117
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 16 place count 81 transition count 112
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 81 transition count 112
Applied a total of 21 rules in 15 ms. Remains 81 /96 variables (removed 15) and now considering 112/127 (removed 15) transitions.
// Phase 1: matrix 112 rows 81 cols
[2025-06-03 06:23:44] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:44] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-03 06:23:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:44] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-03 06:23:44] [INFO ] Implicit Places using invariants and state equation in 237 ms returned [80]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 315 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/96 places, 112/127 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 58 transition count 90
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 48 transition count 70
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 48 transition count 70
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 73 place count 39 transition count 52
Iterating global reduction 0 with 9 rules applied. Total rules applied 82 place count 39 transition count 52
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 91 place count 30 transition count 43
Iterating global reduction 0 with 9 rules applied. Total rules applied 100 place count 30 transition count 43
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 109 place count 21 transition count 25
Iterating global reduction 0 with 9 rules applied. Total rules applied 118 place count 21 transition count 25
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 127 place count 12 transition count 16
Iterating global reduction 0 with 9 rules applied. Total rules applied 136 place count 12 transition count 16
Applied a total of 136 rules in 16 ms. Remains 12 /80 variables (removed 68) and now considering 16/112 (removed 96) transitions.
[2025-06-03 06:23:44] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 12 cols
[2025-06-03 06:23:44] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:44] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-03 06:23:44] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2025-06-03 06:23:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:44] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-03 06:23:44] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/96 places, 16/127 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 410 ms. Remains : 12/96 places, 16/127 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-05
Stuttering criterion allowed to conclude after 73 steps with 1 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-05 finished in 459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 127/127 transitions.
Graph (complete) has 284 edges and 96 vertex of which 91 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 91 transition count 117
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 86 transition count 117
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 16 place count 81 transition count 112
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 81 transition count 112
Applied a total of 21 rules in 15 ms. Remains 81 /96 variables (removed 15) and now considering 112/127 (removed 15) transitions.
// Phase 1: matrix 112 rows 81 cols
[2025-06-03 06:23:44] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:44] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-03 06:23:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-03 06:23:45] [INFO ] Implicit Places using invariants and state equation in 162 ms returned [80]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 222 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/96 places, 112/127 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 59 transition count 91
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 49 transition count 71
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 49 transition count 71
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 39 transition count 51
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 39 transition count 51
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 29 transition count 41
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 29 transition count 41
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 111 place count 20 transition count 23
Iterating global reduction 0 with 9 rules applied. Total rules applied 120 place count 20 transition count 23
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 128 place count 12 transition count 15
Iterating global reduction 0 with 8 rules applied. Total rules applied 136 place count 12 transition count 15
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 12 transition count 15
Applied a total of 137 rules in 16 ms. Remains 12 /80 variables (removed 68) and now considering 15/112 (removed 97) transitions.
[2025-06-03 06:23:45] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 12 cols
[2025-06-03 06:23:45] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:45] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-03 06:23:45] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2025-06-03 06:23:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:45] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-03 06:23:45] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/96 places, 15/127 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 330 ms. Remains : 12/96 places, 15/127 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-06
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-06 finished in 428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0)||(G(F(p2))&&p1)) U X(p2)) U p3))'
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 127/127 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 91 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 91 transition count 122
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 87 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 87 transition count 118
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 83 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 83 transition count 114
Applied a total of 26 rules in 5 ms. Remains 83 /96 variables (removed 13) and now considering 114/127 (removed 13) transitions.
// Phase 1: matrix 114 rows 83 cols
[2025-06-03 06:23:45] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:45] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-03 06:23:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-03 06:23:45] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2025-06-03 06:23:45] [INFO ] Invariant cache hit.
[2025-06-03 06:23:45] [INFO ] State equation strengthened by 78 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/197 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 78/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 0/197 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 163 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4053 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/197 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 78/163 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 113/276 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 276 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4799 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8871ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 8875ms
Starting structural reductions in LTL mode, iteration 1 : 83/96 places, 114/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9076 ms. Remains : 83/96 places, 114/127 transitions.
Stuttering acceptance computed with spot in 300 ms :[(NOT p3), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-07
Stuttering criterion allowed to conclude after 359 steps with 3 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-07 finished in 9412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X(p1)) U G(p2))))'
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 127/127 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 91 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 91 transition count 122
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 88 transition count 119
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 88 transition count 119
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 85 transition count 116
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 85 transition count 116
Applied a total of 22 rules in 5 ms. Remains 85 /96 variables (removed 11) and now considering 116/127 (removed 11) transitions.
// Phase 1: matrix 116 rows 85 cols
[2025-06-03 06:23:54] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:54] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-03 06:23:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:54] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-03 06:23:55] [INFO ] Implicit Places using invariants and state equation in 195 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 262 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/96 places, 116/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 271 ms. Remains : 84/96 places, 116/127 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-09 finished in 526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(G(p1)||X(p2))))'
Support contains 5 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 127/127 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 91 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 91 transition count 122
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 88 transition count 119
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 88 transition count 119
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 85 transition count 116
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 85 transition count 116
Applied a total of 22 rules in 4 ms. Remains 85 /96 variables (removed 11) and now considering 116/127 (removed 11) transitions.
// Phase 1: matrix 116 rows 85 cols
[2025-06-03 06:23:55] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:55] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-03 06:23:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:23:55] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-03 06:23:55] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2025-06-03 06:23:55] [INFO ] Invariant cache hit.
[2025-06-03 06:23:55] [INFO ] State equation strengthened by 79 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 116/201 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 79/166 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 166 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4293 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 116/201 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 79/166 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 115/281 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 281 constraints, problems are : Problem set: 0 solved, 115 unsolved in 5574 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9881ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 9882ms
Starting structural reductions in LTL mode, iteration 1 : 85/96 places, 116/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10186 ms. Remains : 85/96 places, 116/127 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-10 finished in 10435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 127/127 transitions.
Graph (complete) has 284 edges and 96 vertex of which 91 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 105 edges and 88 vertex of which 78 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Graph (trivial) has 86 edges and 78 vertex of which 42 / 78 are part of one of the 21 SCC in 1 ms
Free SCC test removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 57 transition count 100
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 48 place count 46 transition count 79
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 56 place count 38 transition count 63
Iterating global reduction 2 with 8 rules applied. Total rules applied 64 place count 38 transition count 63
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 30 transition count 47
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 30 transition count 47
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 88 place count 22 transition count 31
Iterating global reduction 2 with 8 rules applied. Total rules applied 96 place count 22 transition count 31
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 104 place count 14 transition count 23
Iterating global reduction 2 with 8 rules applied. Total rules applied 112 place count 14 transition count 23
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 11 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 11 transition count 19
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 122 place count 8 transition count 16
Applied a total of 122 rules in 15 ms. Remains 8 /96 variables (removed 88) and now considering 16/127 (removed 111) transitions.
[2025-06-03 06:24:05] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 8 cols
[2025-06-03 06:24:05] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:24:05] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-03 06:24:05] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2025-06-03 06:24:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:24:05] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:24:05] [INFO ] Redundant transitions in 1 ms returned []
Running 8 sub problems to find dead transitions.
[2025-06-03 06:24:05] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2025-06-03 06:24:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 5/19 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/20 variables, and 8 constraints, problems are : Problem set: 0 solved, 8 unsolved in 140 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 5/19 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/20 variables, and 16 constraints, problems are : Problem set: 0 solved, 8 unsolved in 120 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 265ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 265ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/96 places, 16/127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 346 ms. Remains : 8/96 places, 16/127 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-12
Stuttering criterion allowed to conclude after 46 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-12 finished in 429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (p1&&X(G(p0))))))'
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 127/127 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 123
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 123
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 89 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 89 transition count 120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 87 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 87 transition count 118
Applied a total of 18 rules in 4 ms. Remains 87 /96 variables (removed 9) and now considering 118/127 (removed 9) transitions.
// Phase 1: matrix 118 rows 87 cols
[2025-06-03 06:24:06] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:24:06] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-03 06:24:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:24:06] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-03 06:24:06] [INFO ] Implicit Places using invariants and state equation in 240 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 320 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 86/96 places, 118/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 327 ms. Remains : 86/96 places, 118/127 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-13 finished in 463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 127/127 transitions.
Graph (complete) has 284 edges and 96 vertex of which 91 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 105 edges and 88 vertex of which 77 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Graph (trivial) has 86 edges and 77 vertex of which 44 / 77 are part of one of the 22 SCC in 1 ms
Free SCC test removed 22 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 55 transition count 100
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 47 place count 45 transition count 78
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 57 place count 35 transition count 58
Iterating global reduction 2 with 10 rules applied. Total rules applied 67 place count 35 transition count 58
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 76 place count 26 transition count 40
Iterating global reduction 2 with 9 rules applied. Total rules applied 85 place count 26 transition count 40
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 94 place count 17 transition count 22
Iterating global reduction 2 with 9 rules applied. Total rules applied 103 place count 17 transition count 22
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 112 place count 8 transition count 13
Iterating global reduction 2 with 9 rules applied. Total rules applied 121 place count 8 transition count 13
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 123 place count 7 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 5 transition count 8
Applied a total of 127 rules in 16 ms. Remains 5 /96 variables (removed 91) and now considering 8/127 (removed 119) transitions.
[2025-06-03 06:24:06] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2025-06-03 06:24:06] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:24:06] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-03 06:24:06] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2025-06-03 06:24:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:24:06] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:24:06] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-03 06:24:06] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2025-06-03 06:24:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/10 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 61 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/10 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 75 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 140ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 140ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/96 places, 8/127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 5/96 places, 8/127 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-14
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-14 finished in 250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 127/127 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 123
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 123
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 88 transition count 119
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 88 transition count 119
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 84 transition count 115
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 84 transition count 115
Applied a total of 24 rules in 3 ms. Remains 84 /96 variables (removed 12) and now considering 115/127 (removed 12) transitions.
// Phase 1: matrix 115 rows 84 cols
[2025-06-03 06:24:06] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:24:06] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-03 06:24:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:24:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-03 06:24:07] [INFO ] Implicit Places using invariants and state equation in 194 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 259 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/96 places, 115/127 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 263 ms. Remains : 83/96 places, 115/127 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-15
Stuttering criterion allowed to conclude after 113 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-15 finished in 453 ms.
All properties solved by simple procedures.
Total runtime 61943 ms.

BK_STOP 1748931847356

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-11a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r058-smll-174854064600692"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-11a.tgz
mv DiscoveryGPU-PT-11a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;