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.r135-tall-171631131200476.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 greatspnxred
Input is DiscoveryGPU-PT-13a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131200476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.3K 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 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 02:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 12 02:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 02:42 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 46K 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-13a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-13a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716370184082

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-13a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 09:29:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 09:29:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 09:29:45] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2024-05-22 09:29:45] [INFO ] Transformed 133 places.
[2024-05-22 09:29:45] [INFO ] Transformed 183 transitions.
[2024-05-22 09:29:45] [INFO ] Found NUPN structural information;
[2024-05-22 09:29:45] [INFO ] Parsed PT model containing 133 places and 183 transitions and 588 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 183/183 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 122 transition count 172
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 122 transition count 172
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 112 transition count 162
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 112 transition count 162
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 105 transition count 148
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 105 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 105 transition count 142
Applied a total of 62 rules in 39 ms. Remains 105 /133 variables (removed 28) and now considering 142/183 (removed 41) transitions.
// Phase 1: matrix 142 rows 105 cols
[2024-05-22 09:29:45] [INFO ] Computed 2 invariants in 6 ms
[2024-05-22 09:29:45] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-22 09:29:45] [INFO ] Invariant cache hit.
[2024-05-22 09:29:45] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-22 09:29:45] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2024-05-22 09:29:45] [INFO ] Invariant cache hit.
[2024-05-22 09:29:45] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 142/247 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 94/201 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 0/247 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 201 constraints, problems are : Problem set: 0 solved, 141 unsolved in 3575 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 142/247 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 94/201 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 141/342 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 0/247 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 342 constraints, problems are : Problem set: 0 solved, 141 unsolved in 2672 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints]
After SMT, in 6305ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 6318ms
Starting structural reductions in LTL mode, iteration 1 : 105/133 places, 142/183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6745 ms. Remains : 105/133 places, 142/183 transitions.
Support contains 24 out of 105 places after structural reductions.
[2024-05-22 09:29:52] [INFO ] Flatten gal took : 30 ms
[2024-05-22 09:29:52] [INFO ] Flatten gal took : 13 ms
[2024-05-22 09:29:52] [INFO ] Input system was already deterministic with 142 transitions.
RANDOM walk for 40000 steps (279 resets) in 775 ms. (51 steps per ms) remains 1/20 properties
BEST_FIRST walk for 40004 steps (21 resets) in 333 ms. (119 steps per ms) remains 1/1 properties
[2024-05-22 09:29:52] [INFO ] Invariant cache hit.
[2024-05-22 09:29:52] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/38 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/82 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/82 variables, 15/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/82 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 29/111 variables, 15/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/111 variables, 13/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/111 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 24/135 variables, 12/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/135 variables, 12/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/135 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 36/171 variables, 12/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/171 variables, 12/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/171 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 36/207 variables, 12/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/207 variables, 12/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/207 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 24/231 variables, 12/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/231 variables, 12/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/231 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 10/241 variables, 5/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/241 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 4/245 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/245 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/245 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 2/247 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/247 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 0/247 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 201 constraints, problems are : Problem set: 0 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 94/94 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/38 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 44/82 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/82 variables, 15/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/82 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Int declared 111/247 variables, and 83 constraints, problems are : Problem set: 1 solved, 0 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/105 constraints, ReadFeed: 31/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 209ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16 stabilizing places and 14 stable transitions
Graph (complete) has 323 edges and 105 vertex of which 103 are kept as prefixes of interest. Removing 2 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&&X(p1)))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 142/142 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 100 transition count 137
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 100 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 98 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 98 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 97 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 97 transition count 134
Applied a total of 16 rules in 12 ms. Remains 97 /105 variables (removed 8) and now considering 134/142 (removed 8) transitions.
// Phase 1: matrix 134 rows 97 cols
[2024-05-22 09:29:53] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 09:29:53] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 09:29:53] [INFO ] Invariant cache hit.
[2024-05-22 09:29:53] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-22 09:29:53] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2024-05-22 09:29:53] [INFO ] Invariant cache hit.
[2024-05-22 09:29:53] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/231 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 92/191 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 0/231 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 191 constraints, problems are : Problem set: 0 solved, 133 unsolved in 2938 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/231 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 92/191 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 133/324 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/231 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 324 constraints, problems are : Problem set: 0 solved, 133 unsolved in 2239 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
After SMT, in 5200ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 5201ms
Starting structural reductions in LTL mode, iteration 1 : 97/105 places, 134/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5368 ms. Remains : 97/105 places, 134/142 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-00
Stuttering criterion allowed to conclude after 158 steps with 0 reset in 4 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-00 finished in 5681 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((p0&&F(p1)&&(p2||G(p1)))))'
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 142/142 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 101 transition count 138
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 138
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 99 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 99 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 98 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 98 transition count 135
Applied a total of 14 rules in 13 ms. Remains 98 /105 variables (removed 7) and now considering 135/142 (removed 7) transitions.
// Phase 1: matrix 135 rows 98 cols
[2024-05-22 09:29:59] [INFO ] Computed 2 invariants in 7 ms
[2024-05-22 09:29:59] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-22 09:29:59] [INFO ] Invariant cache hit.
[2024-05-22 09:29:59] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-22 09:29:59] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2024-05-22 09:29:59] [INFO ] Invariant cache hit.
[2024-05-22 09:29:59] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 135/233 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 92/192 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 0/233 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 192 constraints, problems are : Problem set: 0 solved, 134 unsolved in 3054 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 135/233 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 92/192 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 134/326 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 0/233 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 326 constraints, problems are : Problem set: 0 solved, 134 unsolved in 2277 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
After SMT, in 5373ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 5375ms
Starting structural reductions in LTL mode, iteration 1 : 98/105 places, 135/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5538 ms. Remains : 98/105 places, 135/142 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-01
Entered a terminal (fully accepting) state of product in 74 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-01 finished in 5770 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)||G((!p1 U X(p1))))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 142/142 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 100 transition count 137
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 100 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 98 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 98 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 97 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 97 transition count 134
Applied a total of 16 rules in 10 ms. Remains 97 /105 variables (removed 8) and now considering 134/142 (removed 8) transitions.
// Phase 1: matrix 134 rows 97 cols
[2024-05-22 09:30:04] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 09:30:04] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 09:30:04] [INFO ] Invariant cache hit.
[2024-05-22 09:30:04] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-22 09:30:05] [INFO ] Implicit Places using invariants and state equation in 107 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 153 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 96/105 places, 134/142 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 166 ms. Remains : 96/105 places, 134/142 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-02
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-02 finished in 435 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(X(X(F(p0))))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 142/142 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 101 transition count 138
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 138
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 99 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 99 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 98 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 98 transition count 135
Applied a total of 14 rules in 11 ms. Remains 98 /105 variables (removed 7) and now considering 135/142 (removed 7) transitions.
// Phase 1: matrix 135 rows 98 cols
[2024-05-22 09:30:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 09:30:05] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 09:30:05] [INFO ] Invariant cache hit.
[2024-05-22 09:30:05] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-22 09:30:05] [INFO ] Implicit Places using invariants and state equation in 111 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 152 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 97/105 places, 135/142 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 167 ms. Remains : 97/105 places, 135/142 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-03
Stuttering criterion allowed to conclude after 594 steps with 5 reset in 8 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-03 finished in 378 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(F((G(p2)||p1)))||p0)))'
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 142/142 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 101 transition count 138
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 138
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 100 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 100 transition count 137
Applied a total of 10 rules in 4 ms. Remains 100 /105 variables (removed 5) and now considering 137/142 (removed 5) transitions.
// Phase 1: matrix 137 rows 100 cols
[2024-05-22 09:30:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 09:30:05] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 09:30:05] [INFO ] Invariant cache hit.
[2024-05-22 09:30:05] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-05-22 09:30:05] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-22 09:30:05] [INFO ] Invariant cache hit.
[2024-05-22 09:30:05] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 137/237 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 93/195 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 195 constraints, problems are : Problem set: 0 solved, 136 unsolved in 3190 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 137/237 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 93/195 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 136/331 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 331 constraints, problems are : Problem set: 0 solved, 136 unsolved in 2309 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 5515ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 5517ms
Starting structural reductions in LTL mode, iteration 1 : 100/105 places, 137/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5655 ms. Remains : 100/105 places, 137/142 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-04
Product exploration explored 100000 steps with 730 reset in 226 ms.
Product exploration explored 100000 steps with 728 reset in 214 ms.
Computed a total of 16 stabilizing places and 14 stable transitions
Graph (complete) has 313 edges and 100 vertex of which 98 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 14 stable transitions
Detected a total of 16/100 stabilizing places and 14/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 148 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 20582 steps (143 resets) in 115 ms. (177 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 10 factoid took 300 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 3 out of 100 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 137/137 transitions.
Graph (complete) has 313 edges and 100 vertex of which 99 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 99 transition count 134
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 97 transition count 134
Applied a total of 5 rules in 22 ms. Remains 97 /100 variables (removed 3) and now considering 134/137 (removed 3) transitions.
// Phase 1: matrix 134 rows 97 cols
[2024-05-22 09:30:12] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 09:30:12] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 09:30:12] [INFO ] Invariant cache hit.
[2024-05-22 09:30:12] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-05-22 09:30:12] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-22 09:30:12] [INFO ] Redundant transitions in 3 ms returned []
Running 133 sub problems to find dead transitions.
[2024-05-22 09:30:12] [INFO ] Invariant cache hit.
[2024-05-22 09:30:12] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/231 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 93/192 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 0/231 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 192 constraints, problems are : Problem set: 0 solved, 133 unsolved in 2937 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/231 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 93/192 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 133/325 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/231 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 325 constraints, problems are : Problem set: 0 solved, 133 unsolved in 2227 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
After SMT, in 5181ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 5183ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/100 places, 134/137 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5345 ms. Remains : 97/100 places, 134/137 transitions.
Computed a total of 16 stabilizing places and 14 stable transitions
Graph (complete) has 309 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 16 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 98 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 10898 steps (83 resets) in 66 ms. (162 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 9 factoid took 230 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 798 reset in 167 ms.
Stack based approach found an accepted trace after 7677 steps with 61 reset with depth 107 and stack size 105 in 17 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-04 finished in 13304 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)||G(F(p1))||G(p2)))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 142/142 transitions.
Graph (complete) has 323 edges and 105 vertex of which 103 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
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 103 transition count 138
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 101 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 9 place count 97 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 13 place count 97 transition count 134
Applied a total of 13 rules in 28 ms. Remains 97 /105 variables (removed 8) and now considering 134/142 (removed 8) transitions.
// Phase 1: matrix 134 rows 97 cols
[2024-05-22 09:30:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 09:30:19] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 09:30:19] [INFO ] Invariant cache hit.
[2024-05-22 09:30:19] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-05-22 09:30:19] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 158 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/105 places, 134/142 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 71 transition count 109
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 61 place count 60 transition count 87
Iterating global reduction 0 with 11 rules applied. Total rules applied 72 place count 60 transition count 87
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 83 place count 49 transition count 65
Iterating global reduction 0 with 11 rules applied. Total rules applied 94 place count 49 transition count 65
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 105 place count 38 transition count 54
Iterating global reduction 0 with 11 rules applied. Total rules applied 116 place count 38 transition count 54
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 126 place count 28 transition count 34
Iterating global reduction 0 with 10 rules applied. Total rules applied 136 place count 28 transition count 34
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 146 place count 18 transition count 24
Iterating global reduction 0 with 10 rules applied. Total rules applied 156 place count 18 transition count 24
Applied a total of 156 rules in 13 ms. Remains 18 /96 variables (removed 78) and now considering 24/134 (removed 110) transitions.
[2024-05-22 09:30:19] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 18 cols
[2024-05-22 09:30:19] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 09:30:19] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-22 09:30:19] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2024-05-22 09:30:19] [INFO ] Invariant cache hit.
[2024-05-22 09:30:19] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-22 09:30:19] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/105 places, 24/142 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 247 ms. Remains : 18/105 places, 24/142 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-07
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-07 finished in 441 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(F(p0)) U (p1||G(!p0)))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 142/142 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 100 transition count 137
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 100 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 98 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 98 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 97 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 97 transition count 134
Applied a total of 16 rules in 8 ms. Remains 97 /105 variables (removed 8) and now considering 134/142 (removed 8) transitions.
// Phase 1: matrix 134 rows 97 cols
[2024-05-22 09:30:19] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 09:30:19] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 09:30:19] [INFO ] Invariant cache hit.
[2024-05-22 09:30:19] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-22 09:30:19] [INFO ] Implicit Places using invariants and state equation in 103 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 149 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 96/105 places, 134/142 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 158 ms. Remains : 96/105 places, 134/142 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-09
Stuttering criterion allowed to conclude after 115 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-09 finished in 291 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)))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 142/142 transitions.
Graph (complete) has 323 edges and 105 vertex of which 103 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 103 transition count 138
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 101 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 9 place count 97 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 13 place count 97 transition count 134
Applied a total of 13 rules in 16 ms. Remains 97 /105 variables (removed 8) and now considering 134/142 (removed 8) transitions.
// Phase 1: matrix 134 rows 97 cols
[2024-05-22 09:30:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 09:30:19] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 09:30:19] [INFO ] Invariant cache hit.
[2024-05-22 09:30:19] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-05-22 09:30:19] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-22 09:30:19] [INFO ] Redundant transitions in 4 ms returned []
Running 133 sub problems to find dead transitions.
[2024-05-22 09:30:19] [INFO ] Invariant cache hit.
[2024-05-22 09:30:19] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/231 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 93/192 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 0/231 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 192 constraints, problems are : Problem set: 0 solved, 133 unsolved in 2892 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/231 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 93/192 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 133/325 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/231 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 325 constraints, problems are : Problem set: 0 solved, 133 unsolved in 2251 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
After SMT, in 5161ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 5163ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/105 places, 134/142 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5324 ms. Remains : 97/105 places, 134/142 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-13
Stuttering criterion allowed to conclude after 137 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-13 finished in 5382 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)))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 142/142 transitions.
Graph (complete) has 323 edges and 105 vertex of which 103 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
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 103 transition count 138
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 101 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 9 place count 97 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 13 place count 97 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 96 transition count 133
Applied a total of 15 rules in 30 ms. Remains 96 /105 variables (removed 9) and now considering 133/142 (removed 9) transitions.
// Phase 1: matrix 133 rows 96 cols
[2024-05-22 09:30:25] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 09:30:25] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 09:30:25] [INFO ] Invariant cache hit.
[2024-05-22 09:30:25] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-22 09:30:25] [INFO ] Implicit Places using invariants and state equation in 100 ms returned [95]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 152 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/105 places, 133/142 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 71 transition count 109
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 58 place count 61 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 61 transition count 89
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 78 place count 51 transition count 69
Iterating global reduction 0 with 10 rules applied. Total rules applied 88 place count 51 transition count 69
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 98 place count 41 transition count 59
Iterating global reduction 0 with 10 rules applied. Total rules applied 108 place count 41 transition count 59
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 118 place count 31 transition count 39
Iterating global reduction 0 with 10 rules applied. Total rules applied 128 place count 31 transition count 39
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 137 place count 22 transition count 30
Iterating global reduction 0 with 9 rules applied. Total rules applied 146 place count 22 transition count 30
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 148 place count 22 transition count 30
Applied a total of 148 rules in 13 ms. Remains 22 /95 variables (removed 73) and now considering 30/133 (removed 103) transitions.
[2024-05-22 09:30:25] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
// Phase 1: matrix 26 rows 22 cols
[2024-05-22 09:30:25] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 09:30:25] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-22 09:30:25] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2024-05-22 09:30:25] [INFO ] Invariant cache hit.
[2024-05-22 09:30:25] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 09:30:25] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/105 places, 30/142 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 249 ms. Remains : 22/105 places, 30/142 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13a-LTLFireability-14
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13a-LTLFireability-14 finished in 301 ms.
All properties solved by simple procedures.
Total runtime 40136 ms.
ITS solved all properties within timeout

BK_STOP 1716370225424

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-13a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DiscoveryGPU-PT-13a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631131200476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-13a.tgz
mv DiscoveryGPU-PT-13a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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