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-171631132600412.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-09a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132600412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K 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.1K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 01:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 01:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 01:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 01:53 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 32K 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-09a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716376356137

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 11:12:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 11:12:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:12:37] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2024-05-22 11:12:37] [INFO ] Transformed 93 places.
[2024-05-22 11:12:37] [INFO ] Transformed 127 transitions.
[2024-05-22 11:12:37] [INFO ] Found NUPN structural information;
[2024-05-22 11:12:37] [INFO ] Parsed PT model containing 93 places and 127 transitions and 408 arcs in 166 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-09a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 127/127 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 85 transition count 119
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 85 transition count 119
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 80 transition count 114
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 80 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 35 place count 80 transition count 105
Applied a total of 35 rules in 78 ms. Remains 80 /93 variables (removed 13) and now considering 105/127 (removed 22) transitions.
// Phase 1: matrix 105 rows 80 cols
[2024-05-22 11:12:37] [INFO ] Computed 2 invariants in 6 ms
[2024-05-22 11:12:38] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-22 11:12:38] [INFO ] Invariant cache hit.
[2024-05-22 11:12:38] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-22 11:12:38] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2024-05-22 11:12:38] [INFO ] Invariant cache hit.
[2024-05-22 11:12:38] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 105/185 variables, 80/82 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 67/149 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 0/185 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 149 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3526 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 105/185 variables, 80/82 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 67/149 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 104/253 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/185 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 253 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2138 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
After SMT, in 5767ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 5779ms
Starting structural reductions in LTL mode, iteration 1 : 80/93 places, 105/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6424 ms. Remains : 80/93 places, 105/127 transitions.
Support contains 24 out of 80 places after structural reductions.
[2024-05-22 11:12:44] [INFO ] Flatten gal took : 33 ms
[2024-05-22 11:12:44] [INFO ] Flatten gal took : 23 ms
[2024-05-22 11:12:44] [INFO ] Input system was already deterministic with 105 transitions.
RANDOM walk for 40000 steps (411 resets) in 801 ms. (49 steps per ms) remains 1/23 properties
BEST_FIRST walk for 40003 steps (44 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
[2024-05-22 11:12:44] [INFO ] Invariant cache hit.
[2024-05-22 11:12:44] [INFO ] State equation strengthened by 67 read => feed constraints.
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Real declared 3/185 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/80 constraints, ReadFeed: 0/67 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 48ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 10 stable transitions
Graph (complete) has 238 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 105/105 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 72 transition count 97
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 72 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 69 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 69 transition count 94
Applied a total of 22 rules in 24 ms. Remains 69 /80 variables (removed 11) and now considering 94/105 (removed 11) transitions.
// Phase 1: matrix 94 rows 69 cols
[2024-05-22 11:12:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:12:45] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 11:12:45] [INFO ] Invariant cache hit.
[2024-05-22 11:12:45] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 11:12:45] [INFO ] Implicit Places using invariants and state equation in 149 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 201 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/80 places, 94/105 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 226 ms. Remains : 68/80 places, 94/105 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-00
Entered a terminal (fully accepting) state of product in 360 steps with 3 reset in 6 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-00 finished in 465 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 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 105/105 transitions.
Graph (complete) has 238 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 79 transition count 100
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 75 transition count 100
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 17 place count 67 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 25 place count 67 transition count 92
Applied a total of 25 rules in 21 ms. Remains 67 /80 variables (removed 13) and now considering 92/105 (removed 13) transitions.
// Phase 1: matrix 92 rows 67 cols
[2024-05-22 11:12:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:12:45] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-22 11:12:45] [INFO ] Invariant cache hit.
[2024-05-22 11:12:45] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 11:12:46] [INFO ] Implicit Places using invariants and state equation in 225 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 320 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/80 places, 92/105 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 49 transition count 75
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 41 transition count 59
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 41 transition count 59
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 33 transition count 43
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 33 transition count 43
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 73 place count 26 transition count 36
Iterating global reduction 0 with 7 rules applied. Total rules applied 80 place count 26 transition count 36
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 87 place count 19 transition count 22
Iterating global reduction 0 with 7 rules applied. Total rules applied 94 place count 19 transition count 22
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 101 place count 12 transition count 15
Iterating global reduction 0 with 7 rules applied. Total rules applied 108 place count 12 transition count 15
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 109 place count 12 transition count 15
Applied a total of 109 rules in 20 ms. Remains 12 /66 variables (removed 54) and now considering 15/92 (removed 77) transitions.
[2024-05-22 11:12:46] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 12 cols
[2024-05-22 11:12:46] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 11:12:46] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 11:12:46] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2024-05-22 11:12:46] [INFO ] Invariant cache hit.
[2024-05-22 11:12:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 11:12:46] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/80 places, 15/105 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 423 ms. Remains : 12/80 places, 15/105 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-01
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-01 finished in 477 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' '!(((!p0||X(X(p1))) U G(!p2)))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 105/105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 98
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 98
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 71 transition count 96
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 71 transition count 96
Applied a total of 18 rules in 6 ms. Remains 71 /80 variables (removed 9) and now considering 96/105 (removed 9) transitions.
// Phase 1: matrix 96 rows 71 cols
[2024-05-22 11:12:46] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 11:12:46] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-22 11:12:46] [INFO ] Invariant cache hit.
[2024-05-22 11:12:46] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-22 11:12:46] [INFO ] Implicit Places using invariants and state equation in 121 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 175 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/80 places, 96/105 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 182 ms. Remains : 70/80 places, 96/105 transitions.
Stuttering acceptance computed with spot in 240 ms :[p2, (NOT p1), (AND (NOT p1) p2), (NOT p1), true, (AND p2 (NOT p1)), p2]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 653 steps with 7 reset in 5 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-03 finished in 446 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)))||(X(X(p0))&&F(p2))))'
Support contains 5 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 105/105 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 75 transition count 100
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 75 transition count 100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 73 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 73 transition count 98
Applied a total of 14 rules in 5 ms. Remains 73 /80 variables (removed 7) and now considering 98/105 (removed 7) transitions.
// Phase 1: matrix 98 rows 73 cols
[2024-05-22 11:12:46] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 11:12:46] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 11:12:46] [INFO ] Invariant cache hit.
[2024-05-22 11:12:46] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-22 11:12:46] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-22 11:12:46] [INFO ] Invariant cache hit.
[2024-05-22 11:12:46] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/171 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 65/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/171 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 140 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2058 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/171 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 65/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 97/237 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 0/171 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 237 constraints, problems are : Problem set: 0 solved, 97 unsolved in 1563 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
After SMT, in 3660ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 3661ms
Starting structural reductions in LTL mode, iteration 1 : 73/80 places, 98/105 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3812 ms. Remains : 73/80 places, 98/105 transitions.
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-04 finished in 4138 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(F(p0))||G(p1)))))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 105/105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 98
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 98
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 71 transition count 96
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 71 transition count 96
Applied a total of 18 rules in 4 ms. Remains 71 /80 variables (removed 9) and now considering 96/105 (removed 9) transitions.
// Phase 1: matrix 96 rows 71 cols
[2024-05-22 11:12:50] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:12:50] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 11:12:50] [INFO ] Invariant cache hit.
[2024-05-22 11:12:50] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-22 11:12:50] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 106 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/80 places, 96/105 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111 ms. Remains : 70/80 places, 96/105 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-09
Product exploration explored 100000 steps with 1177 reset in 218 ms.
Product exploration explored 100000 steps with 1175 reset in 244 ms.
Computed a total of 11 stabilizing places and 10 stable transitions
Graph (complete) has 189 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 11 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40001 steps (401 resets) in 183 ms. (217 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (44 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
// Phase 1: matrix 96 rows 70 cols
[2024-05-22 11:12:51] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 11:12:51] [INFO ] State equation strengthened by 47 read => feed constraints.
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
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/6 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 23/29 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 32/61 variables, 11/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/61 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/61 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 29/90 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/90 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/90 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 44/134 variables, 18/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/134 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/134 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 32/166 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/166 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/166 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/166 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 118 constraints, problems are : Problem set: 0 solved, 1 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 47/47 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) 3/6 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 23/29 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/29 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 32/61 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/61 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/61 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 29/90 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/90 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/90 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 134/166 variables, and 78 constraints, problems are : Problem set: 1 solved, 0 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/70 constraints, ReadFeed: 22/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 312ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 10 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-09a-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-09 finished in 1573 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 U (G(p0)||(p0&&G(!p1)))))))'
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 105/105 transitions.
Graph (complete) has 238 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 79 transition count 102
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 77 transition count 102
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 12 place count 70 transition count 95
Iterating global reduction 0 with 7 rules applied. Total rules applied 19 place count 70 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 21 place count 69 transition count 94
Applied a total of 21 rules in 14 ms. Remains 69 /80 variables (removed 11) and now considering 94/105 (removed 11) transitions.
// Phase 1: matrix 94 rows 69 cols
[2024-05-22 11:12:52] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 11:12:52] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 11:12:52] [INFO ] Invariant cache hit.
[2024-05-22 11:12:52] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 11:12:52] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-22 11:12:52] [INFO ] Redundant transitions in 1 ms returned []
Running 93 sub problems to find dead transitions.
[2024-05-22 11:12:52] [INFO ] Invariant cache hit.
[2024-05-22 11:12:52] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 94/163 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 64/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 0/163 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 135 constraints, problems are : Problem set: 0 solved, 93 unsolved in 1982 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 94/163 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 64/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 93/228 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 228 constraints, problems are : Problem set: 0 solved, 93 unsolved in 1479 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints]
After SMT, in 3494ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 3499ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/80 places, 94/105 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3660 ms. Remains : 69/80 places, 94/105 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-10
Product exploration explored 100000 steps with 1129 reset in 253 ms.
Stack based approach found an accepted trace after 227 steps with 2 reset with depth 58 and stack size 56 in 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-10 finished in 4199 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 U (p1||G(!p0)))||(p2&&G(p3))))))'
Support contains 5 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 105/105 transitions.
Graph (complete) has 238 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 79 transition count 101
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 76 transition count 101
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 14 place count 69 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 21 place count 69 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 23 place count 68 transition count 93
Applied a total of 23 rules in 7 ms. Remains 68 /80 variables (removed 12) and now considering 93/105 (removed 12) transitions.
// Phase 1: matrix 93 rows 68 cols
[2024-05-22 11:12:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:12:56] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-22 11:12:56] [INFO ] Invariant cache hit.
[2024-05-22 11:12:56] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 11:12:56] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-05-22 11:12:56] [INFO ] Redundant transitions in 1 ms returned []
Running 92 sub problems to find dead transitions.
[2024-05-22 11:12:56] [INFO ] Invariant cache hit.
[2024-05-22 11:12:56] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 93/161 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 64/134 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/161 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 134 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1651 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 93/161 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 64/134 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 92/226 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/161 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 226 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1208 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints]
After SMT, in 2897ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 2898ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/80 places, 93/105 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3092 ms. Remains : 68/80 places, 93/105 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-11
Product exploration explored 100000 steps with 1961 reset in 165 ms.
Stack based approach found an accepted trace after 2237 steps with 46 reset with depth 52 and stack size 49 in 15 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-11 finished in 3451 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||G(p1))) U G(p2))))'
Support contains 5 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 105/105 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 74 transition count 99
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 74 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 73 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 73 transition count 98
Applied a total of 14 rules in 5 ms. Remains 73 /80 variables (removed 7) and now considering 98/105 (removed 7) transitions.
// Phase 1: matrix 98 rows 73 cols
[2024-05-22 11:12:59] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 11:13:00] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-22 11:13:00] [INFO ] Invariant cache hit.
[2024-05-22 11:13:00] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-22 11:13:00] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-22 11:13:00] [INFO ] Invariant cache hit.
[2024-05-22 11:13:00] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/171 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 0/171 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 141 constraints, problems are : Problem set: 0 solved, 97 unsolved in 1674 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/171 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 66/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 97/238 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 0/171 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 238 constraints, problems are : Problem set: 0 solved, 97 unsolved in 1251 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
After SMT, in 2935ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 2936ms
Starting structural reductions in LTL mode, iteration 1 : 73/80 places, 98/105 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3220 ms. Remains : 73/80 places, 98/105 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-12
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-12 finished in 3344 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((X(F(p0))||(p1&&X(G((p1||G(p2)))))))))'
Support contains 3 out of 80 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 105/105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 98
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 98
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 70 transition count 95
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 70 transition count 95
Applied a total of 20 rules in 6 ms. Remains 70 /80 variables (removed 10) and now considering 95/105 (removed 10) transitions.
// Phase 1: matrix 95 rows 70 cols
[2024-05-22 11:13:03] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 11:13:03] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-22 11:13:03] [INFO ] Invariant cache hit.
[2024-05-22 11:13:03] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 11:13:03] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-05-22 11:13:03] [INFO ] Invariant cache hit.
[2024-05-22 11:13:03] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 95/165 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 64/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 0/165 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 136 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1719 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 95/165 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 64/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 94/230 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/165 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 230 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1221 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
After SMT, in 2989ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 2990ms
Starting structural reductions in LTL mode, iteration 1 : 70/80 places, 95/105 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3126 ms. Remains : 70/80 places, 95/105 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-13
Stuttering criterion allowed to conclude after 200 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-13 finished in 3240 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)||X(F(p1)))))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 105/105 transitions.
Graph (complete) has 238 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 90 edges and 76 vertex of which 63 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Graph (trivial) has 68 edges and 63 vertex of which 34 / 63 are part of one of the 17 SCC in 2 ms
Free SCC test removed 17 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 46 transition count 82
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 38 place count 38 transition count 65
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 45 place count 31 transition count 51
Iterating global reduction 2 with 7 rules applied. Total rules applied 52 place count 31 transition count 51
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 58 place count 25 transition count 39
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 25 transition count 39
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 70 place count 19 transition count 27
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 19 transition count 27
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 82 place count 13 transition count 21
Iterating global reduction 2 with 6 rules applied. Total rules applied 88 place count 13 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 11 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 11 transition count 17
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 97 place count 8 transition count 14
Applied a total of 97 rules in 19 ms. Remains 8 /80 variables (removed 72) and now considering 14/105 (removed 91) transitions.
[2024-05-22 11:13:06] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2024-05-22 11:13:06] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 11:13:06] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-22 11:13:06] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2024-05-22 11:13:06] [INFO ] Invariant cache hit.
[2024-05-22 11:13:06] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-22 11:13:06] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-22 11:13:06] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2024-05-22 11:13:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4/18 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 8 constraints, problems are : Problem set: 0 solved, 7 unsolved in 80 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 4/18 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 15 constraints, problems are : Problem set: 0 solved, 7 unsolved in 79 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 165ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 165ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/80 places, 14/105 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 264 ms. Remains : 8/80 places, 14/105 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-14
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-14 finished in 350 ms.
All properties solved by simple procedures.
Total runtime 29637 ms.

BK_STOP 1716376386983

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-09a, 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 r136-tall-171631132600412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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