Execution Chart

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

Trace from the execution

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

--------------------
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-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748922510920

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
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
LTLCardinality PT
Running Version 202505121319
[2025-06-03 03:48:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 03:48:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 03:48:33] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2025-06-03 03:48:33] [INFO ] Transformed 93 places.
[2025-06-03 03:48:33] [INFO ] Transformed 127 transitions.
[2025-06-03 03:48:33] [INFO ] Found NUPN structural information;
[2025-06-03 03:48:33] [INFO ] Parsed PT model containing 93 places and 127 transitions and 408 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 127/127 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 88 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 88 transition count 122
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 84 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 84 transition count 118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 82 transition count 114
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 82 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 29 place count 82 transition count 107
Applied a total of 29 rules in 66 ms. Remains 82 /93 variables (removed 11) and now considering 107/127 (removed 20) transitions.
// Phase 1: matrix 107 rows 82 cols
[2025-06-03 03:48:34] [INFO ] Computed 2 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:48:34] [INFO ] Implicit Places using invariants in 409 ms returned []
[2025-06-03 03:48:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:48:35] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-03 03:48:35] [INFO ] Implicit Places using invariants and state equation in 379 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 894 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/93 places, 107/127 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1006 ms. Remains : 81/93 places, 107/127 transitions.
Support contains 28 out of 81 places after structural reductions.
[2025-06-03 03:48:35] [INFO ] Flatten gal took : 59 ms
[2025-06-03 03:48:35] [INFO ] Flatten gal took : 28 ms
[2025-06-03 03:48:35] [INFO ] Input system was already deterministic with 107 transitions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 5993 steps (62 resets) in 487 ms. (12 steps per ms) remains 0/19 properties
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 11 stabilizing places and 10 stable transitions
Graph (complete) has 203 edges and 81 vertex of which 77 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' '!(G(F(p0)))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 107/107 transitions.
Graph (complete) has 203 edges and 81 vertex of which 77 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 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 1 places and 0 transitions.
Graph (complete) has 88 edges and 75 vertex of which 63 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Graph (trivial) has 67 edges and 63 vertex of which 34 / 63 are part of one of the 17 SCC in 3 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 11 rules applied. Total rules applied 12 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 37 place count 38 transition count 65
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 45 place count 30 transition count 49
Iterating global reduction 2 with 8 rules applied. Total rules applied 53 place count 30 transition count 49
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 60 place count 23 transition count 35
Iterating global reduction 2 with 7 rules applied. Total rules applied 67 place count 23 transition count 35
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 74 place count 16 transition count 21
Iterating global reduction 2 with 7 rules applied. Total rules applied 81 place count 16 transition count 21
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 88 place count 9 transition count 14
Iterating global reduction 2 with 7 rules applied. Total rules applied 95 place count 9 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 8 transition count 13
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 99 place count 8 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 6 transition count 9
Applied a total of 101 rules in 54 ms. Remains 6 /81 variables (removed 75) and now considering 9/107 (removed 98) transitions.
[2025-06-03 03:48:36] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 6 cols
[2025-06-03 03:48:36] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:48:36] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-03 03:48:36] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
[2025-06-03 03:48:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:48:36] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:48:36] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-03 03:48:36] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
[2025-06-03 03:48:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 6 unsolved in 250 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/13 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 169 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 447ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 456ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/81 places, 9/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 586 ms. Remains : 6/81 places, 9/107 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-04 finished in 941 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(p0) U p1) U G(p2))||X(X((p3||G(p4))))))'
Support contains 8 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 107/107 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 78 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 78 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 77 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 77 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 76 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 76 transition count 102
Applied a total of 10 rules in 11 ms. Remains 76 /81 variables (removed 5) and now considering 102/107 (removed 5) transitions.
// Phase 1: matrix 102 rows 76 cols
[2025-06-03 03:48:37] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:48:37] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-03 03:48:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:48:37] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-06-03 03:48:37] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2025-06-03 03:48:37] [INFO ] Invariant cache hit.
[2025-06-03 03:48:37] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 102/178 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 49/126 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 101 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/178 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 126 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4414 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 102/178 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 49/126 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 101/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/178 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 227 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4971 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9441ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 9445ms
Starting structural reductions in LTL mode, iteration 1 : 76/81 places, 102/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9784 ms. Remains : 76/81 places, 102/107 transitions.
Stuttering acceptance computed with spot in 1528 ms :[(AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p4) (NOT p3)), (OR (AND (NOT p0) p1 (NOT p3) (NOT p4)) (AND (NOT p1) p2 (NOT p3) (NOT p4))), (AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p2) (NOT p4) (NOT p3)), (AND (NOT p2) p1 (NOT p0) (NOT p4) (NOT p3)), (AND (NOT p4) (NOT p3)), true, (NOT p4), (OR (AND (NOT p0) p2 (NOT p3) (NOT p4)) (AND (NOT p0) p1 (NOT p3) (NOT p4))), (AND p2 (NOT p1) p0 (NOT p3) (NOT p4)), (AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p4) (NOT p2) (NOT p3)), (AND (NOT p4) (NOT p2) p1 (NOT p0) (NOT p3)), (NOT p0), (OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) p1 (NOT p4))), (NOT p1), (AND p0 (NOT p1) p2 (NOT p4)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p4)), (AND (NOT p4) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p4) (NOT p0) (NOT p2) p1)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 75 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-05 finished in 11367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 107/107 transitions.
Graph (complete) has 203 edges and 81 vertex of which 78 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 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 1 places and 0 transitions.
Graph (complete) has 89 edges and 76 vertex of which 67 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Graph (trivial) has 74 edges and 67 vertex of which 36 / 67 are part of one of the 18 SCC in 1 ms
Free SCC test removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 49 transition count 84
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 42 place count 39 transition count 66
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 48 place count 33 transition count 54
Iterating global reduction 2 with 6 rules applied. Total rules applied 54 place count 33 transition count 54
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 27 transition count 42
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 27 transition count 42
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 72 place count 21 transition count 30
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 21 transition count 30
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 84 place count 15 transition count 24
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 15 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 96 place count 12 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 12 transition count 20
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 100 place count 9 transition count 17
Applied a total of 100 rules in 20 ms. Remains 9 /81 variables (removed 72) and now considering 17/107 (removed 90) transitions.
[2025-06-03 03:48:48] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
// Phase 1: matrix 12 rows 9 cols
[2025-06-03 03:48:48] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:48:48] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-03 03:48:48] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
[2025-06-03 03:48:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:48:48] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:48:48] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2025-06-03 03:48:48] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
[2025-06-03 03:48:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 5/20 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/21 variables, and 9 constraints, problems are : Problem set: 0 solved, 9 unsolved in 201 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 5/20 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/21 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 190 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 397ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 398ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/81 places, 17/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 484 ms. Remains : 9/81 places, 17/107 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-07
Stuttering criterion allowed to conclude after 83 steps with 3 reset in 2 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-07 finished in 619 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&&(!p1 U (p2||G(!p1)))) U (G((p0&&(!p1 U (p2||G(!p1)))))||((!p1 U (p2||G(!p1)))&&p3))))))'
Support contains 7 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 107/107 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 75 transition count 101
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 75 transition count 101
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 71 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 71 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 68 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 68 transition count 94
Applied a total of 26 rules in 18 ms. Remains 68 /81 variables (removed 13) and now considering 94/107 (removed 13) transitions.
// Phase 1: matrix 94 rows 68 cols
[2025-06-03 03:48:49] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:48:49] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-03 03:48:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:48:49] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-03 03:48:49] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2025-06-03 03:48:49] [INFO ] Invariant cache hit.
[2025-06-03 03:48:49] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 94/162 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 46/115 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 93 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/162 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 115 constraints, problems are : Problem set: 0 solved, 93 unsolved in 4173 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 46/46 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/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 94/162 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 46/115 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 93/208 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 208 constraints, problems are : Problem set: 0 solved, 93 unsolved in 4819 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9034ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 9036ms
Starting structural reductions in LTL mode, iteration 1 : 68/81 places, 94/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9299 ms. Remains : 68/81 places, 94/107 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-08
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 4 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-08 finished in 9569 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||F((X((X(F(!p2))||G(!p3)))&&p1))))))'
Support contains 6 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 107/107 transitions.
Graph (complete) has 203 edges and 81 vertex of which 78 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 78 transition count 98
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 72 transition count 98
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 69 transition count 95
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 69 transition count 95
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 55 place count 51 transition count 77
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 62 place count 44 transition count 63
Iterating global reduction 2 with 7 rules applied. Total rules applied 69 place count 44 transition count 63
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 76 place count 37 transition count 49
Iterating global reduction 2 with 7 rules applied. Total rules applied 83 place count 37 transition count 49
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 90 place count 30 transition count 42
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 30 transition count 42
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 103 place count 24 transition count 30
Iterating global reduction 2 with 6 rules applied. Total rules applied 109 place count 24 transition count 30
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 113 place count 20 transition count 26
Iterating global reduction 2 with 4 rules applied. Total rules applied 117 place count 20 transition count 26
Applied a total of 117 rules in 35 ms. Remains 20 /81 variables (removed 61) and now considering 26/107 (removed 81) transitions.
[2025-06-03 03:48:59] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 20 cols
[2025-06-03 03:48:59] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:48:59] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-03 03:48:59] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
[2025-06-03 03:48:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:48:59] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-03 03:48:59] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:48:59] [INFO ] Redundant transitions in 1 ms returned []
Running 25 sub problems to find dead transitions.
[2025-06-03 03:48:59] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
[2025-06-03 03:48:59] [INFO ] Invariant cache hit.
[2025-06-03 03:48:59] [INFO ] State equation strengthened by 17 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 22/42 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 16/37 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 1/43 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 38 constraints, problems are : Problem set: 0 solved, 25 unsolved in 808 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 22/42 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 16/37 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 25/62 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 1/43 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 0/43 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 63 constraints, problems are : Problem set: 0 solved, 25 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1774ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 1775ms
Starting structural reductions in SI_LTL mode, iteration 1 : 20/81 places, 26/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1949 ms. Remains : 20/81 places, 26/107 transitions.
Stuttering acceptance computed with spot in 346 ms :[(OR (AND (NOT p0) p2 p3) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 p3) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 p3), (AND (NOT p0) p2 p3), (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 p3))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-09
Stuttering criterion allowed to conclude after 12 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-09 finished in 2346 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||F(p1)) U (G((p0||F(p1)))||(!p1&&(p0||F(p1))))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 107/107 transitions.
Graph (complete) has 203 edges and 81 vertex of which 77 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 1 places and 0 transitions.
Graph (complete) has 88 edges and 75 vertex of which 65 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Graph (trivial) has 69 edges and 65 vertex of which 34 / 65 are part of one of the 17 SCC in 1 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 11 rules applied. Total rules applied 12 place count 48 transition count 84
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 38 place count 40 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 39 transition count 66
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 45 place count 33 transition count 54
Iterating global reduction 3 with 6 rules applied. Total rules applied 51 place count 33 transition count 54
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 57 place count 27 transition count 42
Iterating global reduction 3 with 6 rules applied. Total rules applied 63 place count 27 transition count 42
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 69 place count 21 transition count 30
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 21 transition count 30
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 81 place count 15 transition count 24
Iterating global reduction 3 with 6 rules applied. Total rules applied 87 place count 15 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 93 place count 12 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 12 transition count 20
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 97 place count 9 transition count 17
Applied a total of 97 rules in 17 ms. Remains 9 /81 variables (removed 72) and now considering 17/107 (removed 90) transitions.
[2025-06-03 03:49:01] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
// Phase 1: matrix 13 rows 9 cols
[2025-06-03 03:49:01] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:01] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-03 03:49:01] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2025-06-03 03:49:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:01] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:49:01] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2025-06-03 03:49:01] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2025-06-03 03:49:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 4/21 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/22 variables, and 9 constraints, problems are : Problem set: 0 solved, 11 unsolved in 255 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 4/21 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/22 variables, and 20 constraints, problems are : Problem set: 0 solved, 11 unsolved in 243 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 501ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 501ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/81 places, 17/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 585 ms. Remains : 9/81 places, 17/107 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-11
Product exploration explored 100000 steps with 15223 reset in 594 ms.
Product exploration explored 100000 steps with 15168 reset in 224 ms.
Computed a total of 5 stabilizing places and 8 stable transitions
Graph (complete) has 12 edges and 9 vertex of which 7 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40020 steps (1730 resets) in 224 ms. (177 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (360 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
[2025-06-03 03:49:03] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2025-06-03 03:49:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 15/22 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 34 ms.
Refiners :[State Equation: 6/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (G (OR p1 p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 22 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-11 finished in 2024 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)))'
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 107/107 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 75 transition count 101
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 75 transition count 101
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 71 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 71 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 68 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 68 transition count 94
Applied a total of 26 rules in 11 ms. Remains 68 /81 variables (removed 13) and now considering 94/107 (removed 13) transitions.
// Phase 1: matrix 94 rows 68 cols
[2025-06-03 03:49:03] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:03] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-03 03:49:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:03] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-03 03:49:03] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2025-06-03 03:49:03] [INFO ] Invariant cache hit.
[2025-06-03 03:49:03] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 94/162 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 46/115 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 93 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/162 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 115 constraints, problems are : Problem set: 0 solved, 93 unsolved in 4402 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 46/46 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/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 94/162 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 46/115 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 93/208 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 208 constraints, problems are : Problem set: 0 solved, 93 unsolved in 4402 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8823ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 8825ms
Starting structural reductions in LTL mode, iteration 1 : 68/81 places, 94/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9096 ms. Remains : 68/81 places, 94/107 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 291 ms.
Product exploration explored 100000 steps with 50000 reset in 280 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-12 finished in 9799 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)))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 107/107 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 75 transition count 101
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 75 transition count 101
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 98
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 98
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 69 transition count 95
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 69 transition count 95
Applied a total of 24 rules in 4 ms. Remains 69 /81 variables (removed 12) and now considering 95/107 (removed 12) transitions.
// Phase 1: matrix 95 rows 69 cols
[2025-06-03 03:49:13] [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:13] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-03 03:49:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:13] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-03 03:49:13] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2025-06-03 03:49:13] [INFO ] Invariant cache hit.
[2025-06-03 03:49:13] [INFO ] State equation strengthened by 46 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, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 95/164 variables, 69/70 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 46/116 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 0/164 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 116 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3986 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 46/46 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/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 95/164 variables, 69/70 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 46/116 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 94/210 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/164 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 210 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3996 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7995ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 7996ms
Starting structural reductions in LTL mode, iteration 1 : 69/81 places, 95/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8178 ms. Remains : 69/81 places, 95/107 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 306 ms.
Product exploration explored 100000 steps with 50000 reset in 326 ms.
Computed a total of 11 stabilizing places and 10 stable transitions
Graph (complete) has 187 edges and 69 vertex of which 68 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-14 finished in 8951 ms.
All properties solved by simple procedures.
Total runtime 48648 ms.

BK_STOP 1748922562165

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-09a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r058-smll-174854064600659"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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