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-171631131000379.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131000379
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716360640024

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
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:50:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 06:50:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 06:50:41] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-05-22 06:50:41] [INFO ] Transformed 73 places.
[2024-05-22 06:50:41] [INFO ] Transformed 99 transitions.
[2024-05-22 06:50:41] [INFO ] Found NUPN structural information;
[2024-05-22 06:50:41] [INFO ] Parsed PT model containing 73 places and 99 transitions and 318 arcs in 154 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 2 formulas.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 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 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 68 transition count 94
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 68 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 66 transition count 90
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 66 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 66 transition count 85
Applied a total of 19 rules in 30 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:50:41] [INFO ] Computed 2 invariants in 5 ms
[2024-05-22 06:50:41] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-22 06:50:41] [INFO ] Invariant cache hit.
[2024-05-22 06:50:41] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-22 06:50:41] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 334 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/73 places, 85/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 386 ms. Remains : 65/73 places, 85/99 transitions.
Support contains 26 out of 65 places after structural reductions.
[2024-05-22 06:50:42] [INFO ] Flatten gal took : 23 ms
[2024-05-22 06:50:42] [INFO ] Flatten gal took : 11 ms
[2024-05-22 06:50:42] [INFO ] Input system was already deterministic with 85 transitions.
Support contains 24 out of 65 places (down from 26) after GAL structural reductions.
RANDOM walk for 1281 steps (15 resets) in 113 ms. (11 steps per ms) remains 0/15 properties
Computed a total of 9 stabilizing places and 8 stable transitions
Graph (complete) has 161 edges and 65 vertex of which 61 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' '!(X(X((X(F(p0))||G(p1)))))'
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 85/85 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 62 transition count 82
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 59 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 59 transition count 79
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 57 transition count 77
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 57 transition count 77
Applied a total of 16 rules in 6 ms. Remains 57 /65 variables (removed 8) and now considering 77/85 (removed 8) transitions.
// Phase 1: matrix 77 rows 57 cols
[2024-05-22 06:50:42] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 06:50:42] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 06:50:42] [INFO ] Invariant cache hit.
[2024-05-22 06:50:42] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 06:50:42] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-22 06:50:42] [INFO ] Invariant cache hit.
[2024-05-22 06:50:42] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 77/134 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 37/95 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 95 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1379 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 57/57 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 77/134 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 37/95 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 76/171 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 171 constraints, problems are : Problem set: 0 solved, 76 unsolved in 946 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 57/57 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 2363ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 2376ms
Starting structural reductions in LTL mode, iteration 1 : 57/65 places, 77/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2494 ms. Remains : 57/65 places, 77/85 transitions.
Stuttering acceptance computed with spot in 310 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-00
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 4 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-00 finished in 2868 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))&&F(p1)))'
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 85/85 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 62 transition count 82
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 59 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 59 transition count 79
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 57 transition count 77
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 57 transition count 77
Applied a total of 16 rules in 8 ms. Remains 57 /65 variables (removed 8) and now considering 77/85 (removed 8) transitions.
// Phase 1: matrix 77 rows 57 cols
[2024-05-22 06:50:45] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 06:50:45] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 06:50:45] [INFO ] Invariant cache hit.
[2024-05-22 06:50:45] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 06:50:45] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-22 06:50:45] [INFO ] Invariant cache hit.
[2024-05-22 06:50:45] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 77/134 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 37/95 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 95 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1194 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 57/57 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 77/134 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 37/95 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 76/171 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 171 constraints, problems are : Problem set: 0 solved, 76 unsolved in 957 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 57/57 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 2185ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 2191ms
Starting structural reductions in LTL mode, iteration 1 : 57/65 places, 77/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2294 ms. Remains : 57/65 places, 77/85 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-01 finished in 2479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 85/85 transitions.
Graph (complete) has 161 edges and 65 vertex of which 61 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 61 transition count 77
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 57 transition count 77
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 57 transition count 76
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 11 place count 56 transition count 76
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 15 place count 52 transition count 72
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 52 transition count 72
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 2 with 26 rules applied. Total rules applied 45 place count 39 transition count 59
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 50 place count 34 transition count 49
Iterating global reduction 2 with 5 rules applied. Total rules applied 55 place count 34 transition count 49
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 60 place count 29 transition count 39
Iterating global reduction 2 with 5 rules applied. Total rules applied 65 place count 29 transition count 39
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 70 place count 24 transition count 34
Iterating global reduction 2 with 5 rules applied. Total rules applied 75 place count 24 transition count 34
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 80 place count 19 transition count 24
Iterating global reduction 2 with 5 rules applied. Total rules applied 85 place count 19 transition count 24
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 89 place count 15 transition count 20
Iterating global reduction 2 with 4 rules applied. Total rules applied 93 place count 15 transition count 20
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 94 place count 15 transition count 20
Applied a total of 94 rules in 33 ms. Remains 15 /65 variables (removed 50) and now considering 20/85 (removed 65) transitions.
[2024-05-22 06:50:47] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 15 cols
[2024-05-22 06:50:47] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 06:50:47] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 06:50:47] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-22 06:50:47] [INFO ] Invariant cache hit.
[2024-05-22 06:50:47] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 06:50:47] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-22 06:50:47] [INFO ] Redundant transitions in 1 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-22 06:50:47] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-22 06:50:47] [INFO ] Invariant cache hit.
[2024-05-22 06:50:47] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 17/32 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 1/33 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 0/33 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 30 constraints, problems are : Problem set: 0 solved, 19 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 17/32 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 19/48 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/33 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/33 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 49 constraints, problems are : Problem set: 0 solved, 19 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 357ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 357ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/65 places, 20/85 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 456 ms. Remains : 15/65 places, 20/85 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-02
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-02 finished in 519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 85/85 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 81
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 81
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 57 transition count 77
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 57 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 54 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 54 transition count 74
Applied a total of 22 rules in 9 ms. Remains 54 /65 variables (removed 11) and now considering 74/85 (removed 11) transitions.
// Phase 1: matrix 74 rows 54 cols
[2024-05-22 06:50:48] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 06:50:48] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 06:50:48] [INFO ] Invariant cache hit.
[2024-05-22 06:50:48] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 06:50:48] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-22 06:50:48] [INFO ] Invariant cache hit.
[2024-05-22 06:50:48] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 74/128 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 36/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 0/128 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 91 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1089 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 36/36 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/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 74/128 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 36/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 73/164 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 164 constraints, problems are : Problem set: 0 solved, 73 unsolved in 795 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 1899ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 1901ms
Starting structural reductions in LTL mode, iteration 1 : 54/65 places, 74/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2008 ms. Remains : 54/65 places, 74/85 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-04 finished in 2173 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 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 85/85 transitions.
Graph (complete) has 161 edges and 65 vertex of which 62 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 69 edges and 60 vertex of which 52 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Graph (trivial) has 55 edges and 52 vertex of which 26 / 52 are part of one of the 13 SCC in 5 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 10 rules applied. Total rules applied 11 place count 39 transition count 66
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 32 place count 32 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 31 transition count 52
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 38 place count 26 transition count 42
Iterating global reduction 3 with 5 rules applied. Total rules applied 43 place count 26 transition count 42
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 48 place count 21 transition count 32
Iterating global reduction 3 with 5 rules applied. Total rules applied 53 place count 21 transition count 32
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 57 place count 17 transition count 24
Iterating global reduction 3 with 4 rules applied. Total rules applied 61 place count 17 transition count 24
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 65 place count 13 transition count 20
Iterating global reduction 3 with 4 rules applied. Total rules applied 69 place count 13 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 12 transition count 19
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 3 with 2 rules applied. Total rules applied 73 place count 11 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 11 transition count 17
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 8 transition count 14
Applied a total of 78 rules in 25 ms. Remains 8 /65 variables (removed 57) and now considering 14/85 (removed 71) transitions.
[2024-05-22 06:50:50] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2024-05-22 06:50:50] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 06:50:50] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-22 06:50:50] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2024-05-22 06:50:50] [INFO ] Invariant cache hit.
[2024-05-22 06:50:50] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-22 06:50:50] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-22 06:50:50] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2024-05-22 06:50:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 4/18 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 8 constraints, problems are : Problem set: 0 solved, 8 unsolved in 48 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 4/18 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 16 constraints, problems are : Problem set: 0 solved, 8 unsolved in 57 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 108ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/65 places, 14/85 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 184 ms. Remains : 8/65 places, 14/85 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-06
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-06 finished in 278 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) U X(p1)))'
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 85/85 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 81
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 81
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 58 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 58 transition count 78
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 56 transition count 76
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 56 transition count 76
Applied a total of 18 rules in 11 ms. Remains 56 /65 variables (removed 9) and now considering 76/85 (removed 9) transitions.
// Phase 1: matrix 76 rows 56 cols
[2024-05-22 06:50:50] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 06:50:50] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 06:50:50] [INFO ] Invariant cache hit.
[2024-05-22 06:50:50] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 06:50:50] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2024-05-22 06:50:50] [INFO ] Invariant cache hit.
[2024-05-22 06:50:50] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 76/132 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 37/94 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 0/132 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 94 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1119 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 76/132 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 37/94 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 75/169 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 169 constraints, problems are : Problem set: 0 solved, 75 unsolved in 857 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
After SMT, in 1986ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 1988ms
Starting structural reductions in LTL mode, iteration 1 : 56/65 places, 76/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2102 ms. Remains : 56/65 places, 76/85 transitions.
Stuttering acceptance computed with spot in 421 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 297 ms.
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Computed a total of 9 stabilizing places and 8 stable transitions
Graph (complete) has 149 edges and 56 vertex of which 55 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 9 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 20 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-07 finished in 3013 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 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 85/85 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 81
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 81
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 57 transition count 77
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 57 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 54 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 54 transition count 74
Applied a total of 22 rules in 5 ms. Remains 54 /65 variables (removed 11) and now considering 74/85 (removed 11) transitions.
// Phase 1: matrix 74 rows 54 cols
[2024-05-22 06:50:53] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 06:50:53] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 06:50:53] [INFO ] Invariant cache hit.
[2024-05-22 06:50:53] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 06:50:53] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-22 06:50:53] [INFO ] Invariant cache hit.
[2024-05-22 06:50:53] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 74/128 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 36/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 0/128 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 91 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 36/36 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/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 74/128 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 36/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 73/164 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 164 constraints, problems are : Problem set: 0 solved, 73 unsolved in 811 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 1858ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 1859ms
Starting structural reductions in LTL mode, iteration 1 : 54/65 places, 74/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1948 ms. Remains : 54/65 places, 74/85 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-09 finished in 2049 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||X((X(F(p1))||F((p0&&F(p2))))))))'
Support contains 5 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 85/85 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 81
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 81
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 58 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 58 transition count 78
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 55 transition count 75
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 55 transition count 75
Applied a total of 20 rules in 6 ms. Remains 55 /65 variables (removed 10) and now considering 75/85 (removed 10) transitions.
// Phase 1: matrix 75 rows 55 cols
[2024-05-22 06:50:55] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 06:50:55] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 06:50:55] [INFO ] Invariant cache hit.
[2024-05-22 06:50:55] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 06:50:55] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-22 06:50:55] [INFO ] Invariant cache hit.
[2024-05-22 06:50:55] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 75/130 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 36/92 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 92 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1120 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 36/36 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/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 75/130 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 36/92 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 74/166 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 166 constraints, problems are : Problem set: 0 solved, 74 unsolved in 872 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 2014ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2015ms
Starting structural reductions in LTL mode, iteration 1 : 55/65 places, 75/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2107 ms. Remains : 55/65 places, 75/85 transitions.
Stuttering acceptance computed with spot in 368 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-11
Product exploration explored 100000 steps with 10201 reset in 120 ms.
Stack based approach found an accepted trace after 17 steps with 1 reset with depth 8 and stack size 8 in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-11 finished in 2617 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)&&X(F(p1))))'
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 85/85 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 81
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 81
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 57 transition count 77
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 57 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 54 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 54 transition count 74
Applied a total of 22 rules in 4 ms. Remains 54 /65 variables (removed 11) and now considering 74/85 (removed 11) transitions.
// Phase 1: matrix 74 rows 54 cols
[2024-05-22 06:50:58] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 06:50:58] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 06:50:58] [INFO ] Invariant cache hit.
[2024-05-22 06:50:58] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 06:50:58] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-22 06:50:58] [INFO ] Invariant cache hit.
[2024-05-22 06:50:58] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 74/128 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 36/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 0/128 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 91 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1068 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 36/36 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/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 74/128 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 36/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 73/164 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 164 constraints, problems are : Problem set: 0 solved, 73 unsolved in 827 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 1916ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 1917ms
Starting structural reductions in LTL mode, iteration 1 : 54/65 places, 74/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2004 ms. Remains : 54/65 places, 74/85 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-14
Product exploration explored 100000 steps with 5719 reset in 109 ms.
Stack based approach found an accepted trace after 38 steps with 2 reset with depth 20 and stack size 20 in 1 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-14 finished in 2238 ms.
All properties solved by simple procedures.
Total runtime 19513 ms.
ITS solved all properties within timeout

BK_STOP 1716360660785

--------------------
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 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-07a"
export BK_EXAMINATION="LTLCardinality"
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 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 r135-tall-171631131000379"
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 [ "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 ;