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.r488-tall-171631132600427.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 ltsminxred
Input is DiscoveryGPU-PT-10a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132600427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.6K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 02:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 02:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 02:18 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 36K 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-10a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717192693039

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:58:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 21:58:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:58:14] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-05-31 21:58:14] [INFO ] Transformed 103 places.
[2024-05-31 21:58:14] [INFO ] Transformed 141 transitions.
[2024-05-31 21:58:14] [INFO ] Found NUPN structural information;
[2024-05-31 21:58:14] [INFO ] Parsed PT model containing 103 places and 141 transitions and 453 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 141/141 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 97 transition count 135
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 97 transition count 135
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 92 transition count 130
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 92 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 89 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 89 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 35 place count 89 transition count 117
Applied a total of 35 rules in 32 ms. Remains 89 /103 variables (removed 14) and now considering 117/141 (removed 24) transitions.
// Phase 1: matrix 117 rows 89 cols
[2024-05-31 21:58:14] [INFO ] Computed 2 invariants in 9 ms
[2024-05-31 21:58:14] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-31 21:58:14] [INFO ] Invariant cache hit.
[2024-05-31 21:58:14] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:58:14] [INFO ] Implicit Places using invariants and state equation in 129 ms returned [88]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 351 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/103 places, 117/141 transitions.
Applied a total of 0 rules in 4 ms. Remains 88 /88 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 401 ms. Remains : 88/103 places, 117/141 transitions.
Support contains 23 out of 88 places after structural reductions.
[2024-05-31 21:58:15] [INFO ] Flatten gal took : 26 ms
[2024-05-31 21:58:15] [INFO ] Flatten gal took : 11 ms
[2024-05-31 21:58:15] [INFO ] Input system was already deterministic with 117 transitions.
RANDOM walk for 1337 steps (11 resets) in 113 ms. (11 steps per ms) remains 0/12 properties
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 12 stabilizing places and 11 stable transitions
Graph (complete) has 223 edges and 88 vertex of which 84 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||G(p2))))'
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 117/117 transitions.
Graph (complete) has 223 edges and 88 vertex of which 84 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 84 transition count 109
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 80 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 79 transition count 108
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 15 place count 75 transition count 104
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 75 transition count 104
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 51 place count 59 transition count 88
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 57 place count 53 transition count 76
Iterating global reduction 3 with 6 rules applied. Total rules applied 63 place count 53 transition count 76
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 69 place count 47 transition count 64
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 47 transition count 64
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 80 place count 42 transition count 59
Iterating global reduction 3 with 5 rules applied. Total rules applied 85 place count 42 transition count 59
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 90 place count 37 transition count 49
Iterating global reduction 3 with 5 rules applied. Total rules applied 95 place count 37 transition count 49
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 99 place count 33 transition count 45
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 33 transition count 45
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 106 place count 33 transition count 45
Applied a total of 106 rules in 32 ms. Remains 33 /88 variables (removed 55) and now considering 45/117 (removed 72) transitions.
[2024-05-31 21:58:15] [INFO ] Flow matrix only has 39 transitions (discarded 6 similar events)
// Phase 1: matrix 39 rows 33 cols
[2024-05-31 21:58:15] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 21:58:15] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-31 21:58:15] [INFO ] Flow matrix only has 39 transitions (discarded 6 similar events)
[2024-05-31 21:58:15] [INFO ] Invariant cache hit.
[2024-05-31 21:58:15] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-31 21:58:15] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-31 21:58:15] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-31 21:58:15] [INFO ] Flow matrix only has 39 transitions (discarded 6 similar events)
[2024-05-31 21:58:15] [INFO ] Invariant cache hit.
[2024-05-31 21:58:15] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 1/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 38/71 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 44 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/72 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/72 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 60 constraints, problems are : Problem set: 0 solved, 44 unsolved in 570 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 1/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 38/71 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 44/103 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 1/72 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 104 constraints, problems are : Problem set: 0 solved, 44 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1131ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1138ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/88 places, 45/117 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1269 ms. Remains : 33/88 places, 45/117 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-07
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 4 ms.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-07 finished in 1491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G((p1&&X(G(p0))))))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 117/117 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 82 transition count 111
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 82 transition count 111
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 79 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 79 transition count 108
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 77 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 77 transition count 106
Applied a total of 22 rules in 16 ms. Remains 77 /88 variables (removed 11) and now considering 106/117 (removed 11) transitions.
// Phase 1: matrix 106 rows 77 cols
[2024-05-31 21:58:16] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 21:58:16] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 21:58:16] [INFO ] Invariant cache hit.
[2024-05-31 21:58:17] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-31 21:58:17] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-31 21:58:17] [INFO ] Invariant cache hit.
[2024-05-31 21:58:17] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 106/183 variables, 77/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 52/130 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 0/183 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 130 constraints, problems are : Problem set: 0 solved, 105 unsolved in 1975 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 106/183 variables, 77/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 52/130 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 105/235 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 235 constraints, problems are : Problem set: 0 solved, 105 unsolved in 1462 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 3457ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 3458ms
Starting structural reductions in LTL mode, iteration 1 : 77/88 places, 106/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3604 ms. Remains : 77/88 places, 106/117 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 3267 steps with 929 reset in 24 ms.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-08 finished in 3820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(F(p1)))) U (!p0&&F(G(!p0)))))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 117/117 transitions.
Graph (complete) has 223 edges and 88 vertex of which 85 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 98 edges and 83 vertex of which 73 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 78 edges and 73 vertex of which 38 / 73 are part of one of the 19 SCC in 3 ms
Free SCC test removed 19 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 54 transition count 93
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 43 place count 44 transition count 74
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 50 place count 37 transition count 60
Iterating global reduction 2 with 7 rules applied. Total rules applied 57 place count 37 transition count 60
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 30 transition count 46
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 30 transition count 46
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 77 place count 24 transition count 34
Iterating global reduction 2 with 6 rules applied. Total rules applied 83 place count 24 transition count 34
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 89 place count 18 transition count 28
Iterating global reduction 2 with 6 rules applied. Total rules applied 95 place count 18 transition count 28
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 99 place count 16 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 15 transition count 26
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 103 place count 15 transition count 24
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 107 place count 11 transition count 20
Applied a total of 107 rules in 22 ms. Remains 11 /88 variables (removed 77) and now considering 20/117 (removed 97) transitions.
[2024-05-31 21:58:20] [INFO ] Flow matrix only has 15 transitions (discarded 5 similar events)
// Phase 1: matrix 15 rows 11 cols
[2024-05-31 21:58:20] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 21:58:20] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-31 21:58:20] [INFO ] Flow matrix only has 15 transitions (discarded 5 similar events)
[2024-05-31 21:58:20] [INFO ] Invariant cache hit.
[2024-05-31 21:58:20] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-31 21:58:20] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-31 21:58:20] [INFO ] Flow matrix only has 15 transitions (discarded 5 similar events)
[2024-05-31 21:58:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 12/19 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 6/25 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/26 variables, and 11 constraints, problems are : Problem set: 0 solved, 10 unsolved in 69 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 12/19 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 6/25 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/26 variables, and 21 constraints, problems are : Problem set: 0 solved, 10 unsolved in 63 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 137ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 137ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/88 places, 20/117 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 199 ms. Remains : 11/88 places, 20/117 transitions.
Stuttering acceptance computed with spot in 205 ms :[p0, (AND (NOT p0) (NOT p1)), p0, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-11 finished in 424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p1))||p0)))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 117/117 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 83 transition count 112
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 83 transition count 112
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 80 transition count 109
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 80 transition count 109
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 78 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 78 transition count 107
Applied a total of 20 rules in 13 ms. Remains 78 /88 variables (removed 10) and now considering 107/117 (removed 10) transitions.
// Phase 1: matrix 107 rows 78 cols
[2024-05-31 21:58:21] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 21:58:21] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 21:58:21] [INFO ] Invariant cache hit.
[2024-05-31 21:58:21] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-31 21:58:21] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-05-31 21:58:21] [INFO ] Invariant cache hit.
[2024-05-31 21:58:21] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 107/185 variables, 78/79 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 52/131 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 0/185 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 131 constraints, problems are : Problem set: 0 solved, 106 unsolved in 1909 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 107/185 variables, 78/79 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 52/131 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 106/237 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/185 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 237 constraints, problems are : Problem set: 0 solved, 106 unsolved in 1469 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 3396ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 3398ms
Starting structural reductions in LTL mode, iteration 1 : 78/88 places, 107/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3539 ms. Remains : 78/88 places, 107/117 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-12
Product exploration explored 100000 steps with 2122 reset in 240 ms.
Stack based approach found an accepted trace after 198 steps with 4 reset with depth 64 and stack size 60 in 1 ms.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-12 finished in 3963 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)&&F(p1))))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 117/117 transitions.
Graph (complete) has 223 edges and 88 vertex of which 84 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 1 places and 0 transitions.
Graph (complete) has 97 edges and 82 vertex of which 73 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Graph (trivial) has 76 edges and 73 vertex of which 36 / 73 are part of one of the 18 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 55 transition count 93
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 42 place count 45 transition count 75
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 48 place count 39 transition count 63
Iterating global reduction 2 with 6 rules applied. Total rules applied 54 place count 39 transition count 63
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 33 transition count 51
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 33 transition count 51
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 72 place count 27 transition count 39
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 27 transition count 39
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 84 place count 21 transition count 33
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 21 transition count 33
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 96 place count 18 transition count 30
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 97 place count 18 transition count 29
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 18 transition count 29
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 14 transition count 25
Applied a total of 102 rules in 12 ms. Remains 14 /88 variables (removed 74) and now considering 25/117 (removed 92) transitions.
[2024-05-31 21:58:25] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
// Phase 1: matrix 20 rows 14 cols
[2024-05-31 21:58:25] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 21:58:25] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-31 21:58:25] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
[2024-05-31 21:58:25] [INFO ] Invariant cache hit.
[2024-05-31 21:58:25] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-31 21:58:25] [INFO ] Redundant transitions in 1 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-31 21:58:25] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
[2024-05-31 21:58:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 16/26 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 7/33 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 0/33 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/34 variables, and 14 constraints, problems are : Problem set: 0 solved, 14 unsolved in 86 ms.
Refiners :[State Equation: 14/14 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 16/26 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 7/33 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/33 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/34 variables, and 28 constraints, problems are : Problem set: 0 solved, 14 unsolved in 80 ms.
Refiners :[State Equation: 14/14 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 169ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 169ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/88 places, 25/117 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 234 ms. Remains : 14/88 places, 25/117 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-15 finished in 379 ms.
All properties solved by simple procedures.
Total runtime 11338 ms.
ITS solved all properties within timeout

BK_STOP 1717192705534

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-10a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DiscoveryGPU-PT-10a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631132600427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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