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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 19K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 02:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 02:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 02:06 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 25K 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-07a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716360671916

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-07a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 06:51:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 06:51:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 06:51:13] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2024-05-22 06:51:13] [INFO ] Transformed 73 places.
[2024-05-22 06:51:13] [INFO ] Transformed 99 transitions.
[2024-05-22 06:51:13] [INFO ] Found NUPN structural information;
[2024-05-22 06:51:13] [INFO ] Parsed PT model containing 73 places and 99 transitions and 318 arcs in 152 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 99/99 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 70 transition count 96
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 70 transition count 96
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 67 transition count 93
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 67 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 66 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 66 transition count 91
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 20 place count 66 transition count 85
Applied a total of 20 rules in 33 ms. Remains 66 /73 variables (removed 7) and now considering 85/99 (removed 14) transitions.
// Phase 1: matrix 85 rows 66 cols
[2024-05-22 06:51:13] [INFO ] Computed 2 invariants in 8 ms
[2024-05-22 06:51:13] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-22 06:51:13] [INFO ] Invariant cache hit.
[2024-05-22 06:51:13] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-22 06:51:13] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-05-22 06:51:13] [INFO ] Invariant cache hit.
[2024-05-22 06:51:13] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 85/151 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 53/121 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 84 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/151 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 121 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1664 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 85/151 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 53/121 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 84/205 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/151 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 205 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1122 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
After SMT, in 2828ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 2842ms
Starting structural reductions in LTL mode, iteration 1 : 66/73 places, 85/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3257 ms. Remains : 66/73 places, 85/99 transitions.
Support contains 24 out of 66 places after structural reductions.
[2024-05-22 06:51:16] [INFO ] Flatten gal took : 29 ms
[2024-05-22 06:51:16] [INFO ] Flatten gal took : 12 ms
[2024-05-22 06:51:16] [INFO ] Input system was already deterministic with 85 transitions.
Support contains 23 out of 66 places (down from 24) after GAL structural reductions.
RANDOM walk for 10957 steps (145 resets) in 261 ms. (41 steps per ms) remains 0/22 properties
Computed a total of 10 stabilizing places and 8 stable transitions
Graph (complete) has 189 edges and 66 vertex of which 62 are kept as prefixes of interest. Removing 4 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' '!(F((G(p1)&&p0)))'
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 85/85 transitions.
Graph (complete) has 189 edges and 66 vertex of which 63 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
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 63 transition count 78
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 59 transition count 78
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 55 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 55 transition count 74
Applied a total of 17 rules in 43 ms. Remains 55 /66 variables (removed 11) and now considering 74/85 (removed 11) transitions.
// Phase 1: matrix 74 rows 55 cols
[2024-05-22 06:51:17] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 06:51:17] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 06:51:17] [INFO ] Invariant cache hit.
[2024-05-22 06:51:17] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-22 06:51:17] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-22 06:51:17] [INFO ] Redundant transitions in 1 ms returned []
Running 73 sub problems to find dead transitions.
[2024-05-22 06:51:17] [INFO ] Invariant cache hit.
[2024-05-22 06:51:17] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 74/129 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 51/108 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 108 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1107 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 74/129 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 51/108 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 73/181 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 181 constraints, problems are : Problem set: 0 solved, 73 unsolved in 839 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 1973ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 1974ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/66 places, 74/85 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2122 ms. Remains : 55/66 places, 74/85 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-01
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-01 finished in 2405 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(G((p1&&(!p2 U (p3||G(!p2))))))||p0))))'
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 85/85 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 62 transition count 81
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 62 transition count 81
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 59 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 59 transition count 78
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 56 transition count 75
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 56 transition count 75
Applied a total of 20 rules in 6 ms. Remains 56 /66 variables (removed 10) and now considering 75/85 (removed 10) transitions.
// Phase 1: matrix 75 rows 56 cols
[2024-05-22 06:51:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 06:51:19] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 06:51:19] [INFO ] Invariant cache hit.
[2024-05-22 06:51:19] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 06:51:19] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-22 06:51:19] [INFO ] Invariant cache hit.
[2024-05-22 06:51:19] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 75/131 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 50/108 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 0/131 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 108 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1184 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 75/131 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 50/108 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 74/182 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 182 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1045 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 2246ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2247ms
Starting structural reductions in LTL mode, iteration 1 : 56/66 places, 75/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2355 ms. Remains : 56/66 places, 75/85 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND p2 (NOT p3)))]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 268 steps with 2 reset in 6 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-03 finished in 2533 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((X(X((G(!p0)||p1))) U X(p2))))'
Support contains 2 out of 66 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 85/85 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 80
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 80
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 58 transition count 77
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 58 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 55 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 55 transition count 74
Applied a total of 22 rules in 8 ms. Remains 55 /66 variables (removed 11) and now considering 74/85 (removed 11) transitions.
// Phase 1: matrix 74 rows 55 cols
[2024-05-22 06:51:22] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 06:51:22] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 06:51:22] [INFO ] Invariant cache hit.
[2024-05-22 06:51:22] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 06:51:22] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-22 06:51:22] [INFO ] Invariant cache hit.
[2024-05-22 06:51:22] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 74/129 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 50/107 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 107 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1120 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 74/129 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 50/107 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 73/180 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 180 constraints, problems are : Problem set: 0 solved, 73 unsolved in 856 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 1988ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 1989ms
Starting structural reductions in LTL mode, iteration 1 : 55/66 places, 74/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2101 ms. Remains : 55/66 places, 74/85 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-04
Product exploration explored 100000 steps with 2585 reset in 289 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 1 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-04 finished in 2503 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((X(F(p0))||(F(p2)&&p1))))'
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 85/85 transitions.
Graph (complete) has 189 edges and 66 vertex of which 63 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
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 63 transition count 78
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 59 transition count 78
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 55 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 55 transition count 74
Applied a total of 17 rules in 17 ms. Remains 55 /66 variables (removed 11) and now considering 74/85 (removed 11) transitions.
// Phase 1: matrix 74 rows 55 cols
[2024-05-22 06:51:24] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 06:51:24] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-22 06:51:24] [INFO ] Invariant cache hit.
[2024-05-22 06:51:24] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-22 06:51:24] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 111 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/66 places, 74/85 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 41 transition count 61
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 36 transition count 51
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 36 transition count 51
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 31 transition count 41
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 31 transition count 41
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 26 transition count 36
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 26 transition count 36
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 21 transition count 26
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 21 transition count 26
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 16 transition count 21
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 16 transition count 21
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 77 place count 16 transition count 21
Applied a total of 77 rules in 10 ms. Remains 16 /54 variables (removed 38) and now considering 21/74 (removed 53) transitions.
[2024-05-22 06:51:24] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
// Phase 1: matrix 19 rows 16 cols
[2024-05-22 06:51:24] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 06:51:24] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-22 06:51:24] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
[2024-05-22 06:51:24] [INFO ] Invariant cache hit.
[2024-05-22 06:51:24] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 06:51:24] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/66 places, 21/85 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 188 ms. Remains : 16/66 places, 21/85 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-05
Stuttering criterion allowed to conclude after 309 steps with 102 reset in 3 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-05 finished in 363 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 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 85/85 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 62 transition count 81
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 62 transition count 81
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 59 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 59 transition count 78
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 56 transition count 75
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 56 transition count 75
Applied a total of 20 rules in 6 ms. Remains 56 /66 variables (removed 10) and now considering 75/85 (removed 10) transitions.
// Phase 1: matrix 75 rows 56 cols
[2024-05-22 06:51:25] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 06:51:25] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 06:51:25] [INFO ] Invariant cache hit.
[2024-05-22 06:51:25] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 06:51:25] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 96 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/66 places, 75/85 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 55/66 places, 75/85 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-08
Entered a terminal (fully accepting) state of product in 44 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-08 finished in 212 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 U p1)||X((G(p2) U p1))))'
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 85/85 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 80
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 80
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 58 transition count 77
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 58 transition count 77
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 56 transition count 75
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 56 transition count 75
Applied a total of 20 rules in 13 ms. Remains 56 /66 variables (removed 10) and now considering 75/85 (removed 10) transitions.
// Phase 1: matrix 75 rows 56 cols
[2024-05-22 06:51:25] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 06:51:25] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 06:51:25] [INFO ] Invariant cache hit.
[2024-05-22 06:51:25] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 06:51:25] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-22 06:51:25] [INFO ] Invariant cache hit.
[2024-05-22 06:51:25] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 75/131 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 50/108 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 0/131 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 108 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1149 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 75/131 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 50/108 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 74/182 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 182 constraints, problems are : Problem set: 0 solved, 74 unsolved in 889 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 2046ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2047ms
Starting structural reductions in LTL mode, iteration 1 : 56/66 places, 75/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2160 ms. Remains : 56/66 places, 75/85 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p2), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-09 finished in 2436 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(p0))'
Support contains 1 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 85/85 transitions.
Graph (complete) has 189 edges and 66 vertex of which 62 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 69 edges and 59 vertex of which 49 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Graph (trivial) has 54 edges and 49 vertex of which 26 / 49 are part of one of the 13 SCC in 2 ms
Free SCC test removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 36 transition count 63
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 32 place count 29 transition count 50
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 37 place count 24 transition count 40
Iterating global reduction 2 with 5 rules applied. Total rules applied 42 place count 24 transition count 40
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 19 transition count 30
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 19 transition count 30
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 14 transition count 20
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 14 transition count 20
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 67 place count 9 transition count 15
Iterating global reduction 2 with 5 rules applied. Total rules applied 72 place count 9 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 7 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 5 transition count 10
Applied a total of 79 rules in 15 ms. Remains 5 /66 variables (removed 61) and now considering 10/85 (removed 75) transitions.
[2024-05-22 06:51:27] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2024-05-22 06:51:27] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 06:51:27] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-22 06:51:27] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2024-05-22 06:51:27] [INFO ] Invariant cache hit.
[2024-05-22 06:51:27] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2024-05-22 06:51:27] [INFO ] Redundant transitions in 1 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-22 06:51:27] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2024-05-22 06:51:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 5 constraints, problems are : Problem set: 0 solved, 5 unsolved in 37 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/12 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 35 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 74ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 74ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/66 places, 10/85 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 5/66 places, 10/85 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-12 finished in 176 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(G(p0))&&G((X(p1)&&F(p2))))))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 85/85 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 80
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 80
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 58 transition count 77
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 58 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 55 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 55 transition count 74
Applied a total of 22 rules in 3 ms. Remains 55 /66 variables (removed 11) and now considering 74/85 (removed 11) transitions.
// Phase 1: matrix 74 rows 55 cols
[2024-05-22 06:51:27] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 06:51:28] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 06:51:28] [INFO ] Invariant cache hit.
[2024-05-22 06:51:28] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 06:51:28] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-22 06:51:28] [INFO ] Invariant cache hit.
[2024-05-22 06:51:28] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 74/129 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 50/107 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 107 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1054 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 74/129 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 50/107 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 73/180 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 180 constraints, problems are : Problem set: 0 solved, 73 unsolved in 830 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 1893ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 1894ms
Starting structural reductions in LTL mode, iteration 1 : 55/66 places, 74/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1999 ms. Remains : 55/66 places, 74/85 transitions.
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-13
Product exploration explored 100000 steps with 1335 reset in 190 ms.
Stack based approach found an accepted trace after 368 steps with 4 reset with depth 46 and stack size 44 in 1 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-13 finished in 2488 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 U p1))&&X(G(p2)))))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 85/85 transitions.
Graph (complete) has 189 edges and 66 vertex of which 63 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 63 transition count 78
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 59 transition count 78
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 55 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 55 transition count 74
Applied a total of 17 rules in 8 ms. Remains 55 /66 variables (removed 11) and now considering 74/85 (removed 11) transitions.
// Phase 1: matrix 74 rows 55 cols
[2024-05-22 06:51:30] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 06:51:30] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 06:51:30] [INFO ] Invariant cache hit.
[2024-05-22 06:51:30] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-22 06:51:30] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 94 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/66 places, 74/85 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 42 transition count 62
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 38 transition count 54
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 38 transition count 54
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 34 transition count 46
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 34 transition count 46
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 30 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 30 transition count 42
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 26 transition count 34
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 26 transition count 34
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 22 transition count 30
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 22 transition count 30
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 65 place count 22 transition count 30
Applied a total of 65 rules in 7 ms. Remains 22 /54 variables (removed 32) and now considering 30/74 (removed 44) transitions.
[2024-05-22 06:51:30] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
// Phase 1: matrix 26 rows 22 cols
[2024-05-22 06:51:30] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 06:51:30] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-22 06:51:30] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2024-05-22 06:51:30] [INFO ] Invariant cache hit.
[2024-05-22 06:51:30] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-22 06:51:30] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/66 places, 30/85 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 22/66 places, 30/85 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-14 finished in 347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 85/85 transitions.
Graph (complete) has 189 edges and 66 vertex of which 62 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
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 62 transition count 77
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 58 transition count 77
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 14 place count 53 transition count 72
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 53 transition count 72
Applied a total of 19 rules in 8 ms. Remains 53 /66 variables (removed 13) and now considering 72/85 (removed 13) transitions.
// Phase 1: matrix 72 rows 53 cols
[2024-05-22 06:51:30] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 06:51:30] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 06:51:30] [INFO ] Invariant cache hit.
[2024-05-22 06:51:30] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-22 06:51:30] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 101 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/66 places, 72/85 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 39 transition count 59
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 33 transition count 47
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 33 transition count 47
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 27 transition count 35
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 27 transition count 35
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 22 transition count 30
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 22 transition count 30
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 17 transition count 20
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 17 transition count 20
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 12 transition count 15
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 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 81 place count 12 transition count 15
Applied a total of 81 rules in 10 ms. Remains 12 /52 variables (removed 40) and now considering 15/72 (removed 57) transitions.
[2024-05-22 06:51:30] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 12 cols
[2024-05-22 06:51:30] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 06:51:30] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-22 06:51:30] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2024-05-22 06:51:30] [INFO ] Invariant cache hit.
[2024-05-22 06:51:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 06:51:30] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/66 places, 15/85 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 12/66 places, 15/85 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-15 finished in 272 ms.
All properties solved by simple procedures.
Total runtime 17951 ms.
ITS solved all properties within timeout

BK_STOP 1716360691129

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

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-07a.tgz
mv DiscoveryGPU-PT-07a 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 ;