Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r136-tall-171631132800507.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is DiscoveryGPU-PT-15a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132800507
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 02:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 02:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 02:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 02:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 53K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716383980212

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-15a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 13:19:41] [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]
[2024-05-22 13:19:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 13:19:41] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2024-05-22 13:19:41] [INFO ] Transformed 153 places.
[2024-05-22 13:19:41] [INFO ] Transformed 211 transitions.
[2024-05-22 13:19:41] [INFO ] Found NUPN structural information;
[2024-05-22 13:19:41] [INFO ] Parsed PT model containing 153 places and 211 transitions and 678 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 211/211 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 141 transition count 199
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 141 transition count 199
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 135 transition count 193
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 135 transition count 193
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 130 transition count 183
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 130 transition count 183
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 130 transition count 173
Applied a total of 56 rules in 44 ms. Remains 130 /153 variables (removed 23) and now considering 173/211 (removed 38) transitions.
// Phase 1: matrix 173 rows 130 cols
[2024-05-22 13:19:41] [INFO ] Computed 2 invariants in 14 ms
[2024-05-22 13:19:41] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-22 13:19:41] [INFO ] Invariant cache hit.
[2024-05-22 13:19:42] [INFO ] State equation strengthened by 114 read => feed constraints.
[2024-05-22 13:19:42] [INFO ] Implicit Places using invariants and state equation in 196 ms returned [129]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 423 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 129/153 places, 173/211 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 489 ms. Remains : 129/153 places, 173/211 transitions.
Support contains 20 out of 129 places after structural reductions.
[2024-05-22 13:19:42] [INFO ] Flatten gal took : 38 ms
[2024-05-22 13:19:42] [INFO ] Flatten gal took : 13 ms
[2024-05-22 13:19:42] [INFO ] Input system was already deterministic with 173 transitions.
RANDOM walk for 2279 steps (11 resets) in 193 ms. (11 steps per ms) remains 0/11 properties
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 17 stabilizing places and 16 stable transitions
Graph (complete) has 333 edges and 129 vertex of which 126 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 173/173 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 121 transition count 165
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 121 transition count 165
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 113 transition count 157
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 113 transition count 157
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 111 transition count 155
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 111 transition count 155
Applied a total of 36 rules in 15 ms. Remains 111 /129 variables (removed 18) and now considering 155/173 (removed 18) transitions.
// Phase 1: matrix 155 rows 111 cols
[2024-05-22 13:19:42] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 13:19:42] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-22 13:19:42] [INFO ] Invariant cache hit.
[2024-05-22 13:19:42] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-22 13:19:42] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2024-05-22 13:19:42] [INFO ] Invariant cache hit.
[2024-05-22 13:19:42] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 155/266 variables, 111/112 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 76/188 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/266 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 188 constraints, problems are : Problem set: 0 solved, 154 unsolved in 4008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 155/266 variables, 111/112 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 76/188 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 154/342 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 0/266 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 342 constraints, problems are : Problem set: 0 solved, 154 unsolved in 2958 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints]
After SMT, in 7030ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 7046ms
Starting structural reductions in LTL mode, iteration 1 : 111/129 places, 155/173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7246 ms. Remains : 111/129 places, 155/173 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLCardinality-01
Stuttering criterion allowed to conclude after 15109 steps with 419 reset in 67 ms.
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLCardinality-01 finished in 7549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 173/173 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 121 transition count 165
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 121 transition count 165
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 114 transition count 158
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 114 transition count 158
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 112 transition count 156
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 112 transition count 156
Applied a total of 34 rules in 11 ms. Remains 112 /129 variables (removed 17) and now considering 156/173 (removed 17) transitions.
// Phase 1: matrix 156 rows 112 cols
[2024-05-22 13:19:50] [INFO ] Computed 1 invariants in 6 ms
[2024-05-22 13:19:50] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 13:19:50] [INFO ] Invariant cache hit.
[2024-05-22 13:19:50] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-22 13:19:50] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2024-05-22 13:19:50] [INFO ] Invariant cache hit.
[2024-05-22 13:19:50] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 156/268 variables, 112/113 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 77/190 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 0/268 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 190 constraints, problems are : Problem set: 0 solved, 155 unsolved in 3833 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 156/268 variables, 112/113 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 77/190 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 155/345 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/268 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 345 constraints, problems are : Problem set: 0 solved, 155 unsolved in 2883 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints]
After SMT, in 6735ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 6738ms
Starting structural reductions in LTL mode, iteration 1 : 112/129 places, 156/173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6936 ms. Remains : 112/129 places, 156/173 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLCardinality-02 finished in 7045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F((p0&&F(p1))))))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 173/173 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 164
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 164
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 113 transition count 157
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 113 transition count 157
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 111 transition count 155
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 111 transition count 155
Applied a total of 36 rules in 6 ms. Remains 111 /129 variables (removed 18) and now considering 155/173 (removed 18) transitions.
// Phase 1: matrix 155 rows 111 cols
[2024-05-22 13:19:57] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 13:19:57] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 13:19:57] [INFO ] Invariant cache hit.
[2024-05-22 13:19:57] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-22 13:19:57] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2024-05-22 13:19:57] [INFO ] Invariant cache hit.
[2024-05-22 13:19:57] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 155/266 variables, 111/112 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 76/188 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/266 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 188 constraints, problems are : Problem set: 0 solved, 154 unsolved in 3915 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 155/266 variables, 111/112 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 76/188 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 154/342 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 0/266 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 342 constraints, problems are : Problem set: 0 solved, 154 unsolved in 2830 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints]
After SMT, in 6791ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 6795ms
Starting structural reductions in LTL mode, iteration 1 : 111/129 places, 155/173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6961 ms. Remains : 111/129 places, 155/173 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLCardinality-09
Stuttering criterion allowed to conclude after 192 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLCardinality-09 finished in 7140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 173/173 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 169
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 169
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 122 transition count 166
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 122 transition count 166
Applied a total of 14 rules in 3 ms. Remains 122 /129 variables (removed 7) and now considering 166/173 (removed 7) transitions.
// Phase 1: matrix 166 rows 122 cols
[2024-05-22 13:20:04] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 13:20:04] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 13:20:04] [INFO ] Invariant cache hit.
[2024-05-22 13:20:04] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-22 13:20:04] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-22 13:20:04] [INFO ] Invariant cache hit.
[2024-05-22 13:20:04] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 166/288 variables, 122/123 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 81/204 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 204 constraints, problems are : Problem set: 0 solved, 165 unsolved in 4440 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 122/122 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 166/288 variables, 122/123 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 81/204 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 165/369 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 0/288 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 369 constraints, problems are : Problem set: 0 solved, 165 unsolved in 3216 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 122/122 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 7686ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 7688ms
Starting structural reductions in LTL mode, iteration 1 : 122/129 places, 166/173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7860 ms. Remains : 122/129 places, 166/173 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 120 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLCardinality-12 finished in 8058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 173/173 transitions.
Graph (complete) has 333 edges and 129 vertex of which 126 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 145 edges and 124 vertex of which 106 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Graph (trivial) has 120 edges and 106 vertex of which 60 / 106 are part of one of the 30 SCC in 2 ms
Free SCC test removed 30 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 76 transition count 136
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 64 place count 61 transition count 106
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 77 place count 48 transition count 80
Iterating global reduction 2 with 13 rules applied. Total rules applied 90 place count 48 transition count 80
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 103 place count 35 transition count 54
Iterating global reduction 2 with 13 rules applied. Total rules applied 116 place count 35 transition count 54
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 129 place count 22 transition count 28
Iterating global reduction 2 with 13 rules applied. Total rules applied 142 place count 22 transition count 28
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 155 place count 9 transition count 15
Iterating global reduction 2 with 13 rules applied. Total rules applied 168 place count 9 transition count 15
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 172 place count 7 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 175 place count 5 transition count 10
Applied a total of 175 rules in 27 ms. Remains 5 /129 variables (removed 124) and now considering 10/173 (removed 163) transitions.
[2024-05-22 13:20:12] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 5 cols
[2024-05-22 13:20:12] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 13:20:12] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-22 13:20:12] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2024-05-22 13:20:12] [INFO ] Invariant cache hit.
[2024-05-22 13:20:12] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-22 13:20:12] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-22 13:20:12] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2024-05-22 13:20:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/12 variables, and 5 constraints, problems are : Problem set: 0 solved, 5 unsolved in 57 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/11 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/12 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 37 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 99ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 99ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/129 places, 10/173 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 5/129 places, 10/173 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLCardinality-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLCardinality-13 finished in 242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 173/173 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 122 transition count 166
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 122 transition count 166
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 116 transition count 160
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 116 transition count 160
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 114 transition count 158
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 114 transition count 158
Applied a total of 30 rules in 9 ms. Remains 114 /129 variables (removed 15) and now considering 158/173 (removed 15) transitions.
// Phase 1: matrix 158 rows 114 cols
[2024-05-22 13:20:12] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 13:20:12] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-22 13:20:12] [INFO ] Invariant cache hit.
[2024-05-22 13:20:12] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 13:20:12] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-05-22 13:20:12] [INFO ] Invariant cache hit.
[2024-05-22 13:20:12] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (OVERLAPS) 158/272 variables, 114/115 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 78/193 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 0/272 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 193 constraints, problems are : Problem set: 0 solved, 157 unsolved in 4006 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (OVERLAPS) 158/272 variables, 114/115 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 78/193 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 157/350 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 0/272 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 350 constraints, problems are : Problem set: 0 solved, 157 unsolved in 2925 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 0/0 constraints]
After SMT, in 6948ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 6950ms
Starting structural reductions in LTL mode, iteration 1 : 114/129 places, 158/173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7150 ms. Remains : 114/129 places, 158/173 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 394 ms.
Product exploration explored 100000 steps with 33333 reset in 236 ms.
Computed a total of 17 stabilizing places and 16 stable transitions
Graph (complete) has 312 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-15a-LTLCardinality-14 finished in 7936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 173/173 transitions.
Graph (complete) has 333 edges and 129 vertex of which 127 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 146 edges and 125 vertex of which 108 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Graph (trivial) has 117 edges and 108 vertex of which 60 / 108 are part of one of the 30 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 78 transition count 140
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 60 place count 65 transition count 110
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 73 place count 52 transition count 84
Iterating global reduction 2 with 13 rules applied. Total rules applied 86 place count 52 transition count 84
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 98 place count 40 transition count 60
Iterating global reduction 2 with 12 rules applied. Total rules applied 110 place count 40 transition count 60
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 121 place count 29 transition count 38
Iterating global reduction 2 with 11 rules applied. Total rules applied 132 place count 29 transition count 38
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 143 place count 18 transition count 27
Iterating global reduction 2 with 11 rules applied. Total rules applied 154 place count 18 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 156 place count 17 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 158 place count 16 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 161 place count 16 transition count 23
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 165 place count 12 transition count 19
Applied a total of 165 rules in 10 ms. Remains 12 /129 variables (removed 117) and now considering 19/173 (removed 154) transitions.
[2024-05-22 13:20:20] [INFO ] Flow matrix only has 14 transitions (discarded 5 similar events)
// Phase 1: matrix 14 rows 12 cols
[2024-05-22 13:20:20] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 13:20:20] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 13:20:20] [INFO ] Flow matrix only has 14 transitions (discarded 5 similar events)
[2024-05-22 13:20:20] [INFO ] Invariant cache hit.
[2024-05-22 13:20:20] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-22 13:20:20] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-22 13:20:20] [INFO ] Flow matrix only has 14 transitions (discarded 5 similar events)
[2024-05-22 13:20:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 5/25 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/26 variables, and 12 constraints, problems are : Problem set: 0 solved, 10 unsolved in 59 ms.
Refiners :[State Equation: 12/12 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 5/25 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/26 variables, and 22 constraints, problems are : Problem set: 0 solved, 10 unsolved in 57 ms.
Refiners :[State Equation: 12/12 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 120ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 120ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/129 places, 19/173 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 12/129 places, 19/173 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLCardinality-15
Product exploration explored 100000 steps with 1933 reset in 118 ms.
Product exploration explored 100000 steps with 1930 reset in 115 ms.
Computed a total of 12 stabilizing places and 13 stable transitions
Graph (complete) has 16 edges and 12 vertex of which 9 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Computed a total of 12 stabilizing places and 13 stable transitions
Detected a total of 12/12 stabilizing places and 13/19 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 300 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40020 steps (1077 resets) in 96 ms. (412 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (243 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
[2024-05-22 13:20:21] [INFO ] Flow matrix only has 14 transitions (discarded 5 similar events)
[2024-05-22 13:20:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/19 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/23 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/25 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/26 variables, and 12 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[State Equation: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/19 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/23 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 25/26 variables, and 13 constraints, problems are : Problem set: 1 solved, 0 unsolved in 26 ms.
Refiners :[State Equation: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 57ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 196 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-15a-LTLCardinality-15 finished in 1153 ms.
All properties solved by simple procedures.
Total runtime 40487 ms.

BK_STOP 1716384021848

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-15a"
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-5568"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-15a, 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 r136-tall-171631132800507"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-15a.tgz
mv DiscoveryGPU-PT-15a 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;