Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K 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 28K 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-08a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748917854016

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-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 02:30:55] [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 02:30:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 02:30:56] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2025-06-03 02:30:56] [INFO ] Transformed 83 places.
[2025-06-03 02:30:56] [INFO ] Transformed 113 transitions.
[2025-06-03 02:30:56] [INFO ] Found NUPN structural information;
[2025-06-03 02:30:56] [INFO ] Parsed PT model containing 83 places and 113 transitions and 363 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 79 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 79 transition count 109
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 76 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 76 transition count 106
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 74 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 74 transition count 102
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 24 place count 74 transition count 96
Applied a total of 24 rules in 47 ms. Remains 74 /83 variables (removed 9) and now considering 96/113 (removed 17) transitions.
// Phase 1: matrix 96 rows 74 cols
[2025-06-03 02:30:56] [INFO ] Computed 2 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:30:56] [INFO ] Implicit Places using invariants in 311 ms returned []
[2025-06-03 02:30:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:30:57] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-03 02:30:57] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2025-06-03 02:30:57] [INFO ] Invariant cache hit.
[2025-06-03 02:30:57] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 96/170 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 61/137 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 0/170 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 137 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4045 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 96/170 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 61/137 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 95/232 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/170 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 232 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4065 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8191ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 8209ms
Starting structural reductions in LTL mode, iteration 1 : 74/83 places, 96/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8952 ms. Remains : 74/83 places, 96/113 transitions.
Support contains 24 out of 74 places after structural reductions.
[2025-06-03 02:31:05] [INFO ] Flatten gal took : 36 ms
[2025-06-03 02:31:05] [INFO ] Flatten gal took : 26 ms
[2025-06-03 02:31:05] [INFO ] Input system was already deterministic with 96 transitions.
RANDOM walk for 999 steps (7 resets) in 144 ms. (6 steps per ms) remains 0/25 properties
Computed a total of 11 stabilizing places and 9 stable transitions
Graph (complete) has 214 edges and 74 vertex of which 70 are kept as prefixes of interest. Removing 4 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' '!(F(G(p0)))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 96/96 transitions.
Graph (complete) has 214 edges and 74 vertex of which 70 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
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 70 transition count 87
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 65 transition count 87
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 16 place count 60 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 60 transition count 82
Applied a total of 21 rules in 26 ms. Remains 60 /74 variables (removed 14) and now considering 82/96 (removed 14) transitions.
// Phase 1: matrix 82 rows 60 cols
[2025-06-03 02:31:06] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:06] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-03 02:31:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:06] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 02:31:06] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:31:06] [INFO ] Redundant transitions in 2 ms returned []
Running 81 sub problems to find dead transitions.
[2025-06-03 02:31:06] [INFO ] Invariant cache hit.
[2025-06-03 02:31:06] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 82/142 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 57/119 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 0/142 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 119 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2930 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 82/142 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 57/119 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 81/200 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 200 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2712 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5674ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 5675ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/74 places, 82/96 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5886 ms. Remains : 60/74 places, 82/96 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-00
Stuttering criterion allowed to conclude after 83 steps with 0 reset in 5 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-00 finished in 6251 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))) U (X(p3)&&p2)))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 96/96 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 69 transition count 91
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 69 transition count 91
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 65 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 65 transition count 87
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 62 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 62 transition count 84
Applied a total of 24 rules in 14 ms. Remains 62 /74 variables (removed 12) and now considering 84/96 (removed 12) transitions.
// Phase 1: matrix 84 rows 62 cols
[2025-06-03 02:31:12] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:12] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-03 02:31:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:12] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 02:31:12] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2025-06-03 02:31:12] [INFO ] Invariant cache hit.
[2025-06-03 02:31:12] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/146 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 57/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 0/146 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 121 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2850 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/146 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 57/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 83/204 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 204 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3339 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6209ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 6211ms
Starting structural reductions in LTL mode, iteration 1 : 62/74 places, 84/96 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6421 ms. Remains : 62/74 places, 84/96 transitions.
Stuttering acceptance computed with spot in 483 ms :[(OR (NOT p2) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-02 finished in 6953 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(p1)&&X(p2))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 96/96 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 70 transition count 92
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 70 transition count 92
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 67 transition count 89
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 67 transition count 89
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 65 transition count 87
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 65 transition count 87
Applied a total of 18 rules in 15 ms. Remains 65 /74 variables (removed 9) and now considering 87/96 (removed 9) transitions.
// Phase 1: matrix 87 rows 65 cols
[2025-06-03 02:31:19] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:19] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-03 02:31:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:19] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-03 02:31:19] [INFO ] Implicit Places using invariants and state equation in 214 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 317 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/74 places, 87/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 336 ms. Remains : 64/74 places, 87/96 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-05
Product exploration explored 100000 steps with 5116 reset in 563 ms.
Stack based approach found an accepted trace after 32 steps with 2 reset with depth 6 and stack size 6 in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-05 finished in 1128 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 U p1) U X(!p1)) U (p2&&G(p0))))))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 96/96 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 71 transition count 93
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 71 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 69 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 69 transition count 91
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 67 transition count 89
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 67 transition count 89
Applied a total of 14 rules in 9 ms. Remains 67 /74 variables (removed 7) and now considering 89/96 (removed 7) transitions.
// Phase 1: matrix 89 rows 67 cols
[2025-06-03 02:31:20] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:20] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-03 02:31:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:20] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-03 02:31:20] [INFO ] Implicit Places using invariants and state equation in 172 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 236 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/74 places, 89/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 89/89 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 247 ms. Remains : 66/74 places, 89/96 transitions.
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), p1, (OR (NOT p0) (NOT p2)), p1, (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-06
Product exploration explored 100000 steps with 22274 reset in 383 ms.
Stack based approach found an accepted trace after 1326 steps with 292 reset with depth 4 and stack size 4 in 7 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-06 finished in 1019 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(X(G((p1||X(p2))))))))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 96/96 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 69 transition count 91
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 69 transition count 91
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 65 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 65 transition count 87
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 62 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 62 transition count 84
Applied a total of 24 rules in 13 ms. Remains 62 /74 variables (removed 12) and now considering 84/96 (removed 12) transitions.
// Phase 1: matrix 84 rows 62 cols
[2025-06-03 02:31:21] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:21] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-03 02:31:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:21] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 02:31:21] [INFO ] Implicit Places using invariants and state equation in 185 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 251 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/74 places, 84/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 267 ms. Remains : 61/74 places, 84/96 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1399 steps with 16 reset in 4 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-07 finished in 507 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)))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 96/96 transitions.
Graph (complete) has 214 edges and 74 vertex of which 70 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
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 70 transition count 88
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 66 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 62 transition count 84
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 62 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 19 place count 61 transition count 83
Applied a total of 19 rules in 22 ms. Remains 61 /74 variables (removed 13) and now considering 83/96 (removed 13) transitions.
// Phase 1: matrix 83 rows 61 cols
[2025-06-03 02:31:22] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:22] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-03 02:31:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:22] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 02:31:22] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:31:22] [INFO ] Redundant transitions in 3 ms returned []
Running 82 sub problems to find dead transitions.
[2025-06-03 02:31:22] [INFO ] Invariant cache hit.
[2025-06-03 02:31:22] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 83/144 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 57/120 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 0/144 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 120 constraints, problems are : Problem set: 0 solved, 82 unsolved in 3200 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 83/144 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 57/120 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 82/202 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/144 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 202 constraints, problems are : Problem set: 0 solved, 82 unsolved in 3240 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6458ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 6459ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/74 places, 83/96 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6711 ms. Remains : 61/74 places, 83/96 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-08
Product exploration explored 100000 steps with 1285 reset in 255 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-08 finished in 7123 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||G(p1)) U (F(G(p3))&&p2)))'
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 96/96 transitions.
Graph (complete) has 214 edges and 74 vertex of which 71 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 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 71 transition count 90
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 68 transition count 90
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 10 place count 65 transition count 87
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 65 transition count 87
Applied a total of 13 rules in 12 ms. Remains 65 /74 variables (removed 9) and now considering 87/96 (removed 9) transitions.
// Phase 1: matrix 87 rows 65 cols
[2025-06-03 02:31:29] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:29] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-03 02:31:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:29] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-03 02:31:29] [INFO ] Implicit Places using invariants and state equation in 143 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 234 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/74 places, 87/96 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 50 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 45 transition count 63
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 45 transition count 63
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 40 transition count 53
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 40 transition count 53
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 36 transition count 49
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 36 transition count 49
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 32 transition count 41
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 32 transition count 41
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 28 transition count 37
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 28 transition count 37
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 74 place count 28 transition count 37
Applied a total of 74 rules in 42 ms. Remains 28 /64 variables (removed 36) and now considering 37/87 (removed 50) transitions.
[2025-06-03 02:31:29] [INFO ] Flow matrix only has 31 transitions (discarded 6 similar events)
// Phase 1: matrix 31 rows 28 cols
[2025-06-03 02:31:29] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:29] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-03 02:31:29] [INFO ] Flow matrix only has 31 transitions (discarded 6 similar events)
[2025-06-03 02:31:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-03 02:31:29] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/74 places, 37/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 391 ms. Remains : 28/74 places, 37/96 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p2) (NOT p3)), true, (NOT p1), (NOT p3)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-09 finished in 551 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 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 96/96 transitions.
Graph (complete) has 214 edges and 74 vertex of which 70 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 78 edges and 67 vertex of which 56 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Graph (trivial) has 61 edges and 56 vertex of which 30 / 56 are part of one of the 15 SCC in 3 ms
Free SCC test removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 41 transition count 73
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 35 place count 34 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 33 transition count 57
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 43 place count 26 transition count 43
Iterating global reduction 3 with 7 rules applied. Total rules applied 50 place count 26 transition count 43
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 57 place count 19 transition count 29
Iterating global reduction 3 with 7 rules applied. Total rules applied 64 place count 19 transition count 29
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 70 place count 13 transition count 17
Iterating global reduction 3 with 6 rules applied. Total rules applied 76 place count 13 transition count 17
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 82 place count 7 transition count 11
Iterating global reduction 3 with 6 rules applied. Total rules applied 88 place count 7 transition count 11
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 90 place count 6 transition count 11
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 92 place count 6 transition count 9
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 4 transition count 7
Applied a total of 94 rules in 29 ms. Remains 4 /74 variables (removed 70) and now considering 7/96 (removed 89) transitions.
[2025-06-03 02:31:29] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 4 cols
[2025-06-03 02:31:29] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:29] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-03 02:31:29] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2025-06-03 02:31:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:29] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:31:29] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-03 02:31:29] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2025-06-03 02:31:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 4 constraints, problems are : Problem set: 0 solved, 4 unsolved in 112 ms.
Refiners :[State Equation: 4/4 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/9 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 58 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 199ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 200ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/74 places, 7/96 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 273 ms. Remains : 4/74 places, 7/96 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-11 finished in 353 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)&&(!p1 U (p2||G(!p1))))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 96/96 transitions.
Graph (complete) has 214 edges and 74 vertex of which 70 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 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 70 transition count 87
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 65 transition count 87
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 16 place count 60 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 60 transition count 82
Applied a total of 21 rules in 15 ms. Remains 60 /74 variables (removed 14) and now considering 82/96 (removed 14) transitions.
// Phase 1: matrix 82 rows 60 cols
[2025-06-03 02:31:30] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:30] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-03 02:31:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:30] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 02:31:30] [INFO ] Implicit Places using invariants and state equation in 118 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 175 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/74 places, 82/96 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 43 transition count 66
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 36 transition count 52
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 36 transition count 52
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 30 transition count 40
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 30 transition count 40
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 24 transition count 34
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 24 transition count 34
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 18 transition count 22
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 18 transition count 22
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 87 place count 13 transition count 17
Iterating global reduction 0 with 5 rules applied. Total rules applied 92 place count 13 transition count 17
Applied a total of 92 rules in 11 ms. Remains 13 /59 variables (removed 46) and now considering 17/82 (removed 65) transitions.
[2025-06-03 02:31:30] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
// Phase 1: matrix 15 rows 13 cols
[2025-06-03 02:31:30] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:30] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-03 02:31:30] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
[2025-06-03 02:31:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:30] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-03 02:31:30] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/74 places, 17/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 271 ms. Remains : 13/74 places, 17/96 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-13 finished in 413 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(F(p1)))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 96/96 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 69 transition count 91
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 69 transition count 91
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 66 transition count 88
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 66 transition count 88
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 64 transition count 86
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 64 transition count 86
Applied a total of 20 rules in 9 ms. Remains 64 /74 variables (removed 10) and now considering 86/96 (removed 10) transitions.
// Phase 1: matrix 86 rows 64 cols
[2025-06-03 02:31:30] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:30] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-03 02:31:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:31:30] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-03 02:31:30] [INFO ] Implicit Places using invariants and state equation in 183 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 252 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/74 places, 86/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 264 ms. Remains : 63/74 places, 86/96 transitions.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-14
Stuttering criterion allowed to conclude after 192 steps with 7 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-14 finished in 476 ms.
All properties solved by simple procedures.
Total runtime 35015 ms.

BK_STOP 1748917891102

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

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