Execution Chart

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

Trace from the execution

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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748931663784

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-11a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-03 06:21:06] [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 06:21:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 06:21:06] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2025-06-03 06:21:06] [INFO ] Transformed 113 places.
[2025-06-03 06:21:06] [INFO ] Transformed 155 transitions.
[2025-06-03 06:21:06] [INFO ] Found NUPN structural information;
[2025-06-03 06:21:06] [INFO ] Parsed PT model containing 113 places and 155 transitions and 498 arcs in 412 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 155/155 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 105 transition count 147
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 105 transition count 147
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 99 transition count 141
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 99 transition count 141
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 96 transition count 135
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 96 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 96 transition count 127
Applied a total of 42 rules in 77 ms. Remains 96 /113 variables (removed 17) and now considering 127/155 (removed 28) transitions.
// Phase 1: matrix 127 rows 96 cols
[2025-06-03 06:21:07] [INFO ] Computed 2 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:21:07] [INFO ] Implicit Places using invariants in 472 ms returned []
[2025-06-03 06:21:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:21:07] [INFO ] State equation strengthened by 82 read => feed constraints.
[2025-06-03 06:21:08] [INFO ] Implicit Places using invariants and state equation in 395 ms returned [95]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 949 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 95/113 places, 127/155 transitions.
Applied a total of 0 rules in 7 ms. Remains 95 /95 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1064 ms. Remains : 95/113 places, 127/155 transitions.
Support contains 26 out of 95 places after structural reductions.
[2025-06-03 06:21:08] [INFO ] Flatten gal took : 64 ms
[2025-06-03 06:21:08] [INFO ] Flatten gal took : 23 ms
[2025-06-03 06:21:08] [INFO ] Input system was already deterministic with 127 transitions.
Support contains 25 out of 95 places (down from 26) after GAL structural reductions.
RANDOM walk for 1113 steps (6 resets) in 165 ms. (6 steps per ms) remains 0/15 properties
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 243 edges and 95 vertex of which 92 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 127/127 transitions.
Graph (complete) has 243 edges and 95 vertex of which 92 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 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 117
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 85 transition count 117
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 19 place count 81 transition count 113
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 81 transition count 113
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 67 place count 59 transition count 91
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 77 place count 49 transition count 71
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 49 transition count 71
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 97 place count 39 transition count 51
Iterating global reduction 2 with 10 rules applied. Total rules applied 107 place count 39 transition count 51
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 116 place count 30 transition count 42
Iterating global reduction 2 with 9 rules applied. Total rules applied 125 place count 30 transition count 42
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 134 place count 21 transition count 24
Iterating global reduction 2 with 9 rules applied. Total rules applied 143 place count 21 transition count 24
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 151 place count 13 transition count 16
Iterating global reduction 2 with 8 rules applied. Total rules applied 159 place count 13 transition count 16
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 13 transition count 16
Applied a total of 160 rules in 45 ms. Remains 13 /95 variables (removed 82) and now considering 16/127 (removed 111) transitions.
[2025-06-03 06:21:09] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 13 cols
[2025-06-03 06:21:09] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:21:09] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-03 06:21:09] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2025-06-03 06:21:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:21:09] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-03 06:21:09] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:21:09] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2025-06-03 06:21:09] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2025-06-03 06:21:09] [INFO ] Invariant cache hit.
[2025-06-03 06:21:09] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 13/26 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 1/27 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/27 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 25 constraints, problems are : Problem set: 0 solved, 15 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 13/26 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 15/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/27 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/27 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 40 constraints, problems are : Problem set: 0 solved, 15 unsolved in 508 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1101ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 1114ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/95 places, 16/127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1261 ms. Remains : 13/95 places, 16/127 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-00
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-00 finished in 1606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X((X(X(p1)) U ((!p1&&X(X(p1)))||X(X(G(p1)))))))))))'
Support contains 4 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 127/127 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 89 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 89 transition count 121
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 86 transition count 118
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 86 transition count 118
Applied a total of 18 rules in 11 ms. Remains 86 /95 variables (removed 9) and now considering 118/127 (removed 9) transitions.
// Phase 1: matrix 118 rows 86 cols
[2025-06-03 06:21:10] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:21:10] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-03 06:21:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:21:10] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 06:21:10] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2025-06-03 06:21:10] [INFO ] Invariant cache hit.
[2025-06-03 06:21:10] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 118/204 variables, 86/87 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 57/144 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 0/204 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 144 constraints, problems are : Problem set: 0 solved, 117 unsolved in 5004 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 118/204 variables, 86/87 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 57/144 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 117/261 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 261 constraints, problems are : Problem set: 0 solved, 117 unsolved in 6483 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11555ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 11562ms
Starting structural reductions in LTL mode, iteration 1 : 86/95 places, 118/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11826 ms. Remains : 86/95 places, 118/127 transitions.
Stuttering acceptance computed with spot in 358 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-06
Product exploration explored 100000 steps with 12499 reset in 816 ms.
Product exploration explored 100000 steps with 12503 reset in 320 ms.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 231 edges and 86 vertex of which 84 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 783 steps (3 resets) in 18 ms. (41 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 329 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 118/118 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2025-06-03 06:21:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:21:25] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-03 06:21:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:21:25] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 06:21:25] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2025-06-03 06:21:25] [INFO ] Invariant cache hit.
[2025-06-03 06:21:25] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 118/204 variables, 86/87 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 57/144 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 0/204 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 144 constraints, problems are : Problem set: 0 solved, 117 unsolved in 6310 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 118/204 variables, 86/87 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 57/144 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 117/261 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 261 constraints, problems are : Problem set: 0 solved, 117 unsolved in 6316 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12655ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 12657ms
Finished structural reductions in LTL mode , in 1 iterations and 13040 ms. Remains : 86/86 places, 118/118 transitions.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 231 edges and 86 vertex of which 84 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 1175 steps (6 resets) in 16 ms. (69 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 218 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 323 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 12480 reset in 305 ms.
Product exploration explored 100000 steps with 12464 reset in 397 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 118/118 transitions.
Graph (complete) has 231 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 117
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 22 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 23 place count 85 transition count 137
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 78 transition count 123
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 78 transition count 123
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 51 place count 64 transition count 95
Deduced a syphon composed of 15 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 65 place count 64 transition count 95
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 72 place count 57 transition count 88
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 79 place count 57 transition count 88
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 86 place count 50 transition count 74
Deduced a syphon composed of 15 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 93 place count 50 transition count 74
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 107 place count 36 transition count 53
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 121 place count 36 transition count 53
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 121 rules in 37 ms. Remains 36 /86 variables (removed 50) and now considering 53/118 (removed 65) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:21:41] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2025-06-03 06:21:41] [INFO ] Flow matrix only has 48 transitions (discarded 5 similar events)
// Phase 1: matrix 48 rows 36 cols
[2025-06-03 06:21:41] [INFO ] Computed 1 invariants in 1 ms
[2025-06-03 06:21:41] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
At refinement iteration 3 (OVERLAPS) 47/83 variables, 36/37 constraints. Problems are: Problem set: 14 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 22/59 constraints. Problems are: Problem set: 14 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/59 constraints. Problems are: Problem set: 14 solved, 38 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/84 variables, 1/60 constraints. Problems are: Problem set: 14 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/60 constraints. Problems are: Problem set: 14 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/84 variables, 0/60 constraints. Problems are: Problem set: 14 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 60 constraints, problems are : Problem set: 14 solved, 38 unsolved in 1801 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 36/36 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 38 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 1/1 constraints. Problems are: Problem set: 14 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 14 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 47/75 variables, 28/29 constraints. Problems are: Problem set: 14 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 22/51 constraints. Problems are: Problem set: 14 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 38/89 constraints. Problems are: Problem set: 14 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/89 constraints. Problems are: Problem set: 14 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 8/83 variables, 8/97 constraints. Problems are: Problem set: 14 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/97 constraints. Problems are: Problem set: 14 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 1/84 variables, 1/98 constraints. Problems are: Problem set: 14 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 0/98 constraints. Problems are: Problem set: 14 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/84 variables, 0/98 constraints. Problems are: Problem set: 14 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 98 constraints, problems are : Problem set: 14 solved, 38 unsolved in 1990 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 36/36 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 38/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3805ms problems are : Problem set: 14 solved, 38 unsolved
Search for dead transitions found 14 dead transitions in 3806ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 36/86 places, 39/118 transitions.
Graph (complete) has 81 edges and 36 vertex of which 28 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 28 /36 variables (removed 8) and now considering 39/39 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/86 places, 39/118 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3860 ms. Remains : 28/86 places, 39/118 transitions.
Built C files in :
/tmp/ltsmin7154417008895197420
[2025-06-03 06:21:45] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7154417008895197420
Running compilation step : cd /tmp/ltsmin7154417008895197420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 825 ms.
Running link step : cd /tmp/ltsmin7154417008895197420;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin7154417008895197420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7875612776911796794.hoa' '--buchi-type=spotba'
LTSmin run took 1280 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-06 finished in 36982 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(G((p1 U X(X(p2)))))))))'
Support contains 5 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 127/127 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 92 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 92 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 90 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 90 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 89 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 89 transition count 121
Applied a total of 12 rules in 6 ms. Remains 89 /95 variables (removed 6) and now considering 121/127 (removed 6) transitions.
// Phase 1: matrix 121 rows 89 cols
[2025-06-03 06:21:47] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:21:47] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-03 06:21:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:21:47] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-03 06:21:47] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2025-06-03 06:21:47] [INFO ] Invariant cache hit.
[2025-06-03 06:21:47] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 121/210 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 58/148 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 148 constraints, problems are : Problem set: 0 solved, 120 unsolved in 6229 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 121/210 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 58/148 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 120/268 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 268 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5726 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12008ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 12010ms
Starting structural reductions in LTL mode, iteration 1 : 89/95 places, 121/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12308 ms. Remains : 89/95 places, 121/127 transitions.
Stuttering acceptance computed with spot in 467 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 362 ms.
Product exploration explored 100000 steps with 50000 reset in 393 ms.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 235 edges and 89 vertex of which 87 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 10 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-09 finished in 13580 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((G(F(p0))||(F(p0)&&X(p1))))))'
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 127/127 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 88 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 88 transition count 120
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 84 transition count 116
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 84 transition count 116
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 82 transition count 114
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 82 transition count 114
Applied a total of 26 rules in 8 ms. Remains 82 /95 variables (removed 13) and now considering 114/127 (removed 13) transitions.
// Phase 1: matrix 114 rows 82 cols
[2025-06-03 06:22:01] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:22:01] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-03 06:22:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:22:01] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-03 06:22:01] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2025-06-03 06:22:01] [INFO ] Invariant cache hit.
[2025-06-03 06:22:01] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/196 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 139 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4000 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/196 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 113/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 252 constraints, problems are : Problem set: 0 solved, 113 unsolved in 6183 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10206ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 10208ms
Starting structural reductions in LTL mode, iteration 1 : 82/95 places, 114/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10539 ms. Remains : 82/95 places, 114/127 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-10
Product exploration explored 100000 steps with 33333 reset in 323 ms.
Product exploration explored 100000 steps with 33333 reset in 348 ms.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 226 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 14 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-10 finished in 11414 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 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 127/127 transitions.
Graph (complete) has 243 edges and 95 vertex of which 92 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 107 edges and 90 vertex of which 78 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 86 edges and 78 vertex of which 44 / 78 are part of one of the 22 SCC in 5 ms
Free SCC test removed 22 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 56 transition count 101
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 46 place count 46 transition count 79
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 55 place count 37 transition count 61
Iterating global reduction 2 with 9 rules applied. Total rules applied 64 place count 37 transition count 61
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 29 transition count 45
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 29 transition count 45
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 88 place count 21 transition count 29
Iterating global reduction 2 with 8 rules applied. Total rules applied 96 place count 21 transition count 29
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 104 place count 13 transition count 21
Iterating global reduction 2 with 8 rules applied. Total rules applied 112 place count 13 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 116 place count 11 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 11 transition count 17
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 8 transition count 14
Applied a total of 121 rules in 32 ms. Remains 8 /95 variables (removed 87) and now considering 14/127 (removed 113) transitions.
[2025-06-03 06:22:12] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2025-06-03 06:22:12] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:22:12] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-03 06:22:12] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
[2025-06-03 06:22:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:22:12] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:22:12] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2025-06-03 06:22:12] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
[2025-06-03 06:22:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4/17 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 8 constraints, problems are : Problem set: 0 solved, 7 unsolved in 140 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 4/17 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 15 constraints, problems are : Problem set: 0 solved, 7 unsolved in 152 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 298ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 298ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/95 places, 14/127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 403 ms. Remains : 8/95 places, 14/127 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-11 finished in 511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p1) U p2))))'
Support contains 6 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 127/127 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 88 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 88 transition count 120
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 84 transition count 116
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 84 transition count 116
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 82 transition count 114
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 82 transition count 114
Applied a total of 26 rules in 8 ms. Remains 82 /95 variables (removed 13) and now considering 114/127 (removed 13) transitions.
// Phase 1: matrix 114 rows 82 cols
[2025-06-03 06:22:13] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:22:13] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-03 06:22:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:22:13] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-03 06:22:13] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2025-06-03 06:22:13] [INFO ] Invariant cache hit.
[2025-06-03 06:22:13] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/196 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 139 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4343 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/196 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 113/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 252 constraints, problems are : Problem set: 0 solved, 113 unsolved in 6892 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11250ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 11252ms
Starting structural reductions in LTL mode, iteration 1 : 82/95 places, 114/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11512 ms. Remains : 82/95 places, 114/127 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 495 ms.
Product exploration explored 100000 steps with 50000 reset in 399 ms.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 226 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 26 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-13 finished in 12754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 127/127 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 88 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 88 transition count 120
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 84 transition count 116
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 84 transition count 116
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 82 transition count 114
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 82 transition count 114
Applied a total of 26 rules in 6 ms. Remains 82 /95 variables (removed 13) and now considering 114/127 (removed 13) transitions.
[2025-06-03 06:22:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:22:25] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-03 06:22:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:22:26] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-03 06:22:26] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2025-06-03 06:22:26] [INFO ] Invariant cache hit.
[2025-06-03 06:22:26] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/196 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 139 constraints, problems are : Problem set: 0 solved, 113 unsolved in 5783 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/196 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 113/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 252 constraints, problems are : Problem set: 0 solved, 113 unsolved in 6396 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12194ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 12194ms
Starting structural reductions in LTL mode, iteration 1 : 82/95 places, 114/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12417 ms. Remains : 82/95 places, 114/127 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 7 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-14 finished in 12564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))&&F(p1))))'
Support contains 4 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 127/127 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 88 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 88 transition count 120
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 84 transition count 116
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 84 transition count 116
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 82 transition count 114
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 82 transition count 114
Applied a total of 26 rules in 7 ms. Remains 82 /95 variables (removed 13) and now considering 114/127 (removed 13) transitions.
[2025-06-03 06:22:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:22:38] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-03 06:22:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:22:38] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-03 06:22:38] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2025-06-03 06:22:38] [INFO ] Invariant cache hit.
[2025-06-03 06:22:38] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/196 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 139 constraints, problems are : Problem set: 0 solved, 113 unsolved in 5369 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/196 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 113/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 252 constraints, problems are : Problem set: 0 solved, 113 unsolved in 6630 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12020ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 12021ms
Starting structural reductions in LTL mode, iteration 1 : 82/95 places, 114/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12282 ms. Remains : 82/95 places, 114/127 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 11 steps with 2 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-15 finished in 12502 ms.
All properties solved by simple procedures.
Total runtime 104743 ms.

BK_STOP 1748931770997

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

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-11a.tgz
mv DiscoveryGPU-PT-11a execution
cd execution
if [ "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 ;