Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064600660.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-09a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064600660
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K 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 32K 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-09a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748922573797

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-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 03:49:36] [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 03:49:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 03:49:36] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2025-06-03 03:49:36] [INFO ] Transformed 93 places.
[2025-06-03 03:49:36] [INFO ] Transformed 127 transitions.
[2025-06-03 03:49:36] [INFO ] Found NUPN structural information;
[2025-06-03 03:49:36] [INFO ] Parsed PT model containing 93 places and 127 transitions and 408 arcs in 349 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 127/127 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 87 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 87 transition count 121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 83 transition count 117
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 83 transition count 117
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 79 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 79 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 33 place count 79 transition count 104
Applied a total of 33 rules in 91 ms. Remains 79 /93 variables (removed 14) and now considering 104/127 (removed 23) transitions.
// Phase 1: matrix 104 rows 79 cols
[2025-06-03 03:49:37] [INFO ] Computed 2 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:37] [INFO ] Implicit Places using invariants in 383 ms returned []
[2025-06-03 03:49:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:37] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-03 03:49:37] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-03 03:49:37] [INFO ] Invariant cache hit.
[2025-06-03 03:49:37] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 104/183 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 68/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 0/183 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 149 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5552 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 104/183 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 68/149 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 103/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 252 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4805 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10468ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 10491ms
Starting structural reductions in LTL mode, iteration 1 : 79/93 places, 104/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11397 ms. Remains : 79/93 places, 104/127 transitions.
Support contains 29 out of 79 places after structural reductions.
[2025-06-03 03:49:48] [INFO ] Flatten gal took : 55 ms
[2025-06-03 03:49:48] [INFO ] Flatten gal took : 24 ms
[2025-06-03 03:49:48] [INFO ] Input system was already deterministic with 104 transitions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 6763 steps (68 resets) in 429 ms. (15 steps per ms) remains 0/29 properties
FORMULA DiscoveryGPU-PT-09a-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 12 stabilizing places and 10 stable transitions
Graph (complete) has 234 edges and 79 vertex of which 76 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 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(X((p0&&X(X(F(!p1)))))))) U ((p0&&X(X(X(X((p0&&X(X(F(!p1)))))))))||X(X(X(X(G((p0&&F(!p1))))))))))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 75 transition count 100
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 75 transition count 100
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 71 transition count 96
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 71 transition count 96
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 69 transition count 94
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 69 transition count 94
Applied a total of 20 rules in 18 ms. Remains 69 /79 variables (removed 10) and now considering 94/104 (removed 10) transitions.
// Phase 1: matrix 94 rows 69 cols
[2025-06-03 03:49:49] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:49] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-03 03:49:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:50] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-03 03:49:50] [INFO ] Implicit Places using invariants and state equation in 261 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 356 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/79 places, 94/104 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 378 ms. Remains : 68/79 places, 94/104 transitions.
Stuttering acceptance computed with spot in 579 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, p1]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-01
Entered a terminal (fully accepting) state of product in 74 steps with 10 reset in 4 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-01 finished in 1170 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(p1)&&p0)))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Graph (complete) has 234 edges and 79 vertex of which 76 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 76 transition count 96
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 71 transition count 96
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 15 place count 67 transition count 92
Iterating global reduction 0 with 4 rules applied. Total rules applied 19 place count 67 transition count 92
Applied a total of 19 rules in 42 ms. Remains 67 /79 variables (removed 12) and now considering 92/104 (removed 12) transitions.
// Phase 1: matrix 92 rows 67 cols
[2025-06-03 03:49:50] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:50] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-03 03:49:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:51] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-03 03:49:51] [INFO ] Implicit Places using invariants and state equation in 215 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 299 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/79 places, 92/104 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 50 transition count 76
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 42 transition count 60
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 42 transition count 60
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 34 transition count 44
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 34 transition count 44
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 71 place count 27 transition count 37
Iterating global reduction 0 with 7 rules applied. Total rules applied 78 place count 27 transition count 37
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 84 place count 21 transition count 25
Iterating global reduction 0 with 6 rules applied. Total rules applied 90 place count 21 transition count 25
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 96 place count 15 transition count 19
Iterating global reduction 0 with 6 rules applied. Total rules applied 102 place count 15 transition count 19
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 104 place count 15 transition count 19
Applied a total of 104 rules in 19 ms. Remains 15 /66 variables (removed 51) and now considering 19/92 (removed 73) transitions.
[2025-06-03 03:49:51] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 15 cols
[2025-06-03 03:49:51] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:51] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-03 03:49:51] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
[2025-06-03 03:49:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:51] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 03:49:51] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/79 places, 19/104 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 449 ms. Remains : 15/79 places, 19/104 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-03
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-03 finished in 578 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 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Graph (complete) has 234 edges and 79 vertex of which 76 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 76 transition count 97
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 72 transition count 97
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 68 transition count 93
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 68 transition count 93
Applied a total of 17 rules in 22 ms. Remains 68 /79 variables (removed 11) and now considering 93/104 (removed 11) transitions.
// Phase 1: matrix 93 rows 68 cols
[2025-06-03 03:49:51] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:51] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-03 03:49:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:51] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-03 03:49:51] [INFO ] Implicit Places using invariants and state equation in 205 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 306 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/79 places, 93/104 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 51 transition count 77
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 45 transition count 65
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 45 transition count 65
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 39 transition count 53
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 39 transition count 53
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 33 transition count 47
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 33 transition count 47
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 27 transition count 35
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 27 transition count 35
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 21 transition count 29
Iterating global reduction 0 with 6 rules applied. Total rules applied 92 place count 21 transition count 29
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 21 transition count 29
Applied a total of 94 rules in 40 ms. Remains 21 /67 variables (removed 46) and now considering 29/93 (removed 64) transitions.
[2025-06-03 03:49:51] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
// Phase 1: matrix 25 rows 21 cols
[2025-06-03 03:49:51] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:51] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-03 03:49:51] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2025-06-03 03:49:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:51] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-03 03:49:51] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/79 places, 29/104 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 474 ms. Remains : 21/79 places, 29/104 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-04
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-04 finished in 589 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)&&F(G((p1 U p2))))))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Graph (complete) has 234 edges and 79 vertex of which 76 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 76 transition count 96
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 71 transition count 96
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 15 place count 67 transition count 92
Iterating global reduction 0 with 4 rules applied. Total rules applied 19 place count 67 transition count 92
Applied a total of 19 rules in 14 ms. Remains 67 /79 variables (removed 12) and now considering 92/104 (removed 12) transitions.
// Phase 1: matrix 92 rows 67 cols
[2025-06-03 03:49:51] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:52] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-03 03:49:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:52] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-03 03:49:52] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:49:52] [INFO ] Redundant transitions in 4 ms returned []
Running 91 sub problems to find dead transitions.
[2025-06-03 03:49:52] [INFO ] Invariant cache hit.
[2025-06-03 03:49:52] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 92/159 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 64/133 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 0/159 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 133 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4085 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 92/159 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 64/133 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 91/224 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/159 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 224 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4723 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8838ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 8841ms
Starting structural reductions in SI_LTL mode, iteration 1 : 67/79 places, 92/104 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9068 ms. Remains : 67/79 places, 92/104 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-05
Stuttering criterion allowed to conclude after 141 steps with 1 reset in 5 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-05 finished in 9344 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))) U X((!p0||F(p2)))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 76 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 76 transition count 101
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 73 transition count 98
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 73 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 72 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 72 transition count 97
Applied a total of 14 rules in 16 ms. Remains 72 /79 variables (removed 7) and now considering 97/104 (removed 7) transitions.
// Phase 1: matrix 97 rows 72 cols
[2025-06-03 03:50:01] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:01] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-03 03:50:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:01] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-03 03:50:01] [INFO ] Implicit Places using invariants and state equation in 228 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 324 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 71/79 places, 97/104 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 344 ms. Remains : 71/79 places, 97/104 transitions.
Stuttering acceptance computed with spot in 230 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 633 ms.
Product exploration explored 100000 steps with 50000 reset in 403 ms.
Computed a total of 11 stabilizing places and 10 stable transitions
Graph (complete) has 190 edges and 71 vertex of which 69 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 27 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-09a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-06 finished in 1691 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(((p0 U G(p1))||X(p2)))))&&F(p0)))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 76 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 76 transition count 101
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 73 transition count 98
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 73 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 72 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 72 transition count 97
Applied a total of 14 rules in 9 ms. Remains 72 /79 variables (removed 7) and now considering 97/104 (removed 7) transitions.
// Phase 1: matrix 97 rows 72 cols
[2025-06-03 03:50:03] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:03] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-03 03:50:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:03] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-03 03:50:03] [INFO ] Implicit Places using invariants and state equation in 240 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 324 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 71/79 places, 97/104 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 335 ms. Remains : 71/79 places, 97/104 transitions.
Stuttering acceptance computed with spot in 576 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-07
Stuttering criterion allowed to conclude after 96 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-07 finished in 950 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((F(G(p1))||p0))))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 75 transition count 100
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 75 transition count 100
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 71 transition count 96
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 71 transition count 96
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 69 transition count 94
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 69 transition count 94
Applied a total of 20 rules in 5 ms. Remains 69 /79 variables (removed 10) and now considering 94/104 (removed 10) transitions.
// Phase 1: matrix 94 rows 69 cols
[2025-06-03 03:50:03] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:04] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-03 03:50:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:04] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-03 03:50:04] [INFO ] Implicit Places using invariants and state equation in 213 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 283 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/79 places, 94/104 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 289 ms. Remains : 68/79 places, 94/104 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 147 ms.
Product exploration explored 100000 steps with 33333 reset in 232 ms.
Computed a total of 11 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-09a-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-08 finished in 867 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' '!(((p0 U X(X(p1)))&&X(!(p1 U p2))))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 75 transition count 100
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 75 transition count 100
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 71 transition count 96
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 71 transition count 96
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 69 transition count 94
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 69 transition count 94
Applied a total of 20 rules in 7 ms. Remains 69 /79 variables (removed 10) and now considering 94/104 (removed 10) transitions.
[2025-06-03 03:50:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:04] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-03 03:50:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:04] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-03 03:50:05] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2025-06-03 03:50:05] [INFO ] Invariant cache hit.
[2025-06-03 03:50:05] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 94/163 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 64/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 0/163 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 135 constraints, problems are : Problem set: 0 solved, 93 unsolved in 4618 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 94/163 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 64/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 93/228 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 228 constraints, problems are : Problem set: 0 solved, 93 unsolved in 4709 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9349ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 9351ms
Starting structural reductions in LTL mode, iteration 1 : 69/79 places, 94/104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9619 ms. Remains : 69/79 places, 94/104 transitions.
Stuttering acceptance computed with spot in 382 ms :[(OR (NOT p1) p2), p2, (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 4 steps with 1 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-10 finished in 10032 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)&&F(!p1))||X(G(!p0))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 75 transition count 100
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 75 transition count 100
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 71 transition count 96
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 71 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 70 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 70 transition count 95
Applied a total of 18 rules in 4 ms. Remains 70 /79 variables (removed 9) and now considering 95/104 (removed 9) transitions.
// Phase 1: matrix 95 rows 70 cols
[2025-06-03 03:50:14] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:14] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-03 03:50:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:15] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-03 03:50:15] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2025-06-03 03:50:15] [INFO ] Invariant cache hit.
[2025-06-03 03:50:15] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 95/165 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 64/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 0/165 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 136 constraints, problems are : Problem set: 0 solved, 94 unsolved in 4407 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 95/165 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 64/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 94/230 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/165 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 230 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3820 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8247ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 8248ms
Starting structural reductions in LTL mode, iteration 1 : 70/79 places, 95/104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8491 ms. Remains : 70/79 places, 95/104 transitions.
Stuttering acceptance computed with spot in 211 ms :[p0, p0, (AND p1 p0), true, p1]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 273 ms.
Product exploration explored 100000 steps with 50000 reset in 289 ms.
Computed a total of 12 stabilizing places and 10 stable transitions
Graph (complete) has 218 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 14 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-09a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-11 finished in 9304 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(p1))) U G(p2))))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 77 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 77 transition count 102
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 75 transition count 100
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 75 transition count 100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 73 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 73 transition count 98
Applied a total of 12 rules in 3 ms. Remains 73 /79 variables (removed 6) and now considering 98/104 (removed 6) transitions.
// Phase 1: matrix 98 rows 73 cols
[2025-06-03 03:50:24] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:24] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-03 03:50:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:24] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-03 03:50:24] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2025-06-03 03:50:24] [INFO ] Invariant cache hit.
[2025-06-03 03:50:24] [INFO ] State equation strengthened by 66 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/171 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 0/171 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 141 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5063 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/171 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 97/238 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 0/171 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 238 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5289 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10364ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 10365ms
Starting structural reductions in LTL mode, iteration 1 : 73/79 places, 98/104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10555 ms. Remains : 73/79 places, 98/104 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-12
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-12 finished in 10745 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((X(F(p0))||(p1&&X(G((p1||G(p2)))))))))'
Support contains 3 out of 79 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 75 transition count 100
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 75 transition count 100
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 71 transition count 96
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 71 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 70 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 70 transition count 95
Applied a total of 18 rules in 5 ms. Remains 70 /79 variables (removed 9) and now considering 95/104 (removed 9) transitions.
// Phase 1: matrix 95 rows 70 cols
[2025-06-03 03:50:34] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:34] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-03 03:50:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:35] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-03 03:50:35] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2025-06-03 03:50:35] [INFO ] Invariant cache hit.
[2025-06-03 03:50:35] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 95/165 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 64/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 0/165 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 136 constraints, problems are : Problem set: 0 solved, 94 unsolved in 4771 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 95/165 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 64/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 94/230 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/165 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 230 constraints, problems are : Problem set: 0 solved, 94 unsolved in 5295 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10085ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 10086ms
Starting structural reductions in LTL mode, iteration 1 : 70/79 places, 95/104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10361 ms. Remains : 70/79 places, 95/104 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-13
Stuttering criterion allowed to conclude after 99 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-13 finished in 10563 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)||X(F(p1)))))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 104/104 transitions.
Graph (complete) has 234 edges and 79 vertex of which 76 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 86 edges and 73 vertex of which 63 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 68 edges and 63 vertex of which 34 / 63 are part of one of the 17 SCC in 5 ms
Free SCC test removed 17 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 46 transition count 82
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 38 place count 38 transition count 65
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 45 place count 31 transition count 51
Iterating global reduction 2 with 7 rules applied. Total rules applied 52 place count 31 transition count 51
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 58 place count 25 transition count 39
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 25 transition count 39
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 70 place count 19 transition count 27
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 19 transition count 27
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 82 place count 13 transition count 21
Iterating global reduction 2 with 6 rules applied. Total rules applied 88 place count 13 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 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 2 with 2 rules applied. Total rules applied 94 place count 11 transition count 17
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 97 place count 8 transition count 14
Applied a total of 97 rules in 43 ms. Remains 8 /79 variables (removed 71) and now considering 14/104 (removed 90) transitions.
[2025-06-03 03:50:45] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2025-06-03 03:50:45] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:45] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-03 03:50:45] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2025-06-03 03:50:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:45] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:50:45] [INFO ] Redundant transitions in 1 ms returned []
Running 7 sub problems to find dead transitions.
[2025-06-03 03:50:45] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2025-06-03 03:50:45] [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, 7 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4/18 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 8 constraints, problems are : Problem set: 0 solved, 7 unsolved in 165 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 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, 7 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 4/18 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 15 constraints, problems are : Problem set: 0 solved, 7 unsolved in 184 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 355ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 355ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/79 places, 14/104 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 479 ms. Remains : 8/79 places, 14/104 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-14
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-14 finished in 615 ms.
All properties solved by simple procedures.
Total runtime 69703 ms.

BK_STOP 1748922646128

--------------------
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-09a"
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-09a, 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-174854064600660"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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