Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r136-tall-171631132700460.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DiscoveryGPU-PT-12a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132700460
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K 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 26K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 12 02:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 02:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 02:00 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 43K 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-12a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716379515221

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-12a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 12:05:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 12:05:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 12:05:16] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-05-22 12:05:16] [INFO ] Transformed 123 places.
[2024-05-22 12:05:16] [INFO ] Transformed 169 transitions.
[2024-05-22 12:05:16] [INFO ] Found NUPN structural information;
[2024-05-22 12:05:16] [INFO ] Parsed PT model containing 123 places and 169 transitions and 543 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 169/169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 112 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 112 transition count 158
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 103 transition count 149
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 103 transition count 149
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 96 transition count 135
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 96 transition count 135
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 59 place count 96 transition count 130
Applied a total of 59 rules in 37 ms. Remains 96 /123 variables (removed 27) and now considering 130/169 (removed 39) transitions.
// Phase 1: matrix 130 rows 96 cols
[2024-05-22 12:05:16] [INFO ] Computed 2 invariants in 9 ms
[2024-05-22 12:05:16] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-22 12:05:16] [INFO ] Invariant cache hit.
[2024-05-22 12:05:16] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-22 12:05:17] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2024-05-22 12:05:17] [INFO ] Invariant cache hit.
[2024-05-22 12:05:17] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 130/226 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 87/185 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 129 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/226 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 185 constraints, problems are : Problem set: 0 solved, 129 unsolved in 3301 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 130/226 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 87/185 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 129/314 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/226 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 314 constraints, problems are : Problem set: 0 solved, 129 unsolved in 2386 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 5744ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 5757ms
Starting structural reductions in LTL mode, iteration 1 : 96/123 places, 130/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6153 ms. Remains : 96/123 places, 130/169 transitions.
Support contains 17 out of 96 places after structural reductions.
[2024-05-22 12:05:22] [INFO ] Flatten gal took : 29 ms
[2024-05-22 12:05:22] [INFO ] Flatten gal took : 13 ms
[2024-05-22 12:05:23] [INFO ] Input system was already deterministic with 130 transitions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 3621 steps (25 resets) in 194 ms. (18 steps per ms) remains 0/17 properties
FORMULA DiscoveryGPU-PT-12a-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 15 stabilizing places and 13 stable transitions
Graph (complete) has 297 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U (p1||G(F(p2))))))'
Support contains 5 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 130/130 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 94 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 94 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 93 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 93 transition count 127
Applied a total of 6 rules in 8 ms. Remains 93 /96 variables (removed 3) and now considering 127/130 (removed 3) transitions.
// Phase 1: matrix 127 rows 93 cols
[2024-05-22 12:05:23] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:05:23] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 12:05:23] [INFO ] Invariant cache hit.
[2024-05-22 12:05:23] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-22 12:05:23] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-22 12:05:23] [INFO ] Invariant cache hit.
[2024-05-22 12:05:23] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 127/220 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 86/181 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 0/220 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 181 constraints, problems are : Problem set: 0 solved, 126 unsolved in 2821 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 127/220 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 86/181 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 126/307 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 307 constraints, problems are : Problem set: 0 solved, 126 unsolved in 2064 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
After SMT, in 4915ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 4918ms
Starting structural reductions in LTL mode, iteration 1 : 93/96 places, 127/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5094 ms. Remains : 93/96 places, 127/130 transitions.
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-01
Stuttering criterion allowed to conclude after 280 steps with 2 reset in 6 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-01 finished in 5489 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 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 130/130 transitions.
Graph (complete) has 297 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 95 transition count 126
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 92 transition count 126
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 11 place count 88 transition count 122
Iterating global reduction 0 with 4 rules applied. Total rules applied 15 place count 88 transition count 122
Applied a total of 15 rules in 23 ms. Remains 88 /96 variables (removed 8) and now considering 122/130 (removed 8) transitions.
// Phase 1: matrix 122 rows 88 cols
[2024-05-22 12:05:28] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:05:28] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 12:05:28] [INFO ] Invariant cache hit.
[2024-05-22 12:05:28] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 12:05:29] [INFO ] Implicit Places using invariants and state equation in 143 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 194 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/96 places, 122/130 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 46 place count 64 transition count 99
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 54 transition count 79
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 54 transition count 79
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 76 place count 44 transition count 59
Iterating global reduction 0 with 10 rules applied. Total rules applied 86 place count 44 transition count 59
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 96 place count 34 transition count 49
Iterating global reduction 0 with 10 rules applied. Total rules applied 106 place count 34 transition count 49
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 116 place count 24 transition count 29
Iterating global reduction 0 with 10 rules applied. Total rules applied 126 place count 24 transition count 29
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 136 place count 14 transition count 19
Iterating global reduction 0 with 10 rules applied. Total rules applied 146 place count 14 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 14 transition count 19
Applied a total of 147 rules in 14 ms. Remains 14 /87 variables (removed 73) and now considering 19/122 (removed 103) transitions.
[2024-05-22 12:05:29] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 14 cols
[2024-05-22 12:05:29] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 12:05:29] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-22 12:05:29] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
[2024-05-22 12:05:29] [INFO ] Invariant cache hit.
[2024-05-22 12:05:29] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 12:05:29] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/96 places, 19/130 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 298 ms. Remains : 14/96 places, 19/130 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-02
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-02 finished in 340 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0 U (p1||G(p0))))))'
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 130/130 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 93 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 93 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 91 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 91 transition count 125
Applied a total of 10 rules in 6 ms. Remains 91 /96 variables (removed 5) and now considering 125/130 (removed 5) transitions.
// Phase 1: matrix 125 rows 91 cols
[2024-05-22 12:05:29] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:05:29] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 12:05:29] [INFO ] Invariant cache hit.
[2024-05-22 12:05:29] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 12:05:29] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 142 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/96 places, 125/130 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 150 ms. Remains : 90/96 places, 125/130 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 310 ms.
Product exploration explored 100000 steps with 50000 reset in 182 ms.
Computed a total of 14 stabilizing places and 13 stable transitions
Graph (complete) has 247 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (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 15 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-12a-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-03 finished in 745 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))))'
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 130/130 transitions.
Graph (complete) has 297 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 95 transition count 126
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 92 transition count 126
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 11 place count 88 transition count 122
Iterating global reduction 0 with 4 rules applied. Total rules applied 15 place count 88 transition count 122
Applied a total of 15 rules in 9 ms. Remains 88 /96 variables (removed 8) and now considering 122/130 (removed 8) transitions.
// Phase 1: matrix 122 rows 88 cols
[2024-05-22 12:05:29] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 12:05:29] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 12:05:30] [INFO ] Invariant cache hit.
[2024-05-22 12:05:30] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 12:05:30] [INFO ] Implicit Places using invariants and state equation in 106 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 166 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/96 places, 122/130 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 46 place count 64 transition count 99
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 53 transition count 77
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 53 transition count 77
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 42 transition count 55
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 42 transition count 55
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 100 place count 32 transition count 45
Iterating global reduction 0 with 10 rules applied. Total rules applied 110 place count 32 transition count 45
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 120 place count 22 transition count 25
Iterating global reduction 0 with 10 rules applied. Total rules applied 130 place count 22 transition count 25
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 139 place count 13 transition count 16
Iterating global reduction 0 with 9 rules applied. Total rules applied 148 place count 13 transition count 16
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 13 transition count 16
Applied a total of 149 rules in 8 ms. Remains 13 /87 variables (removed 74) and now considering 16/122 (removed 106) transitions.
[2024-05-22 12:05:30] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 13 cols
[2024-05-22 12:05:30] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 12:05:30] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 12:05:30] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2024-05-22 12:05:30] [INFO ] Invariant cache hit.
[2024-05-22 12:05:30] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-22 12:05:30] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/96 places, 16/130 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 255 ms. Remains : 13/96 places, 16/130 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-06
Product exploration explored 100000 steps with 1300 reset in 213 ms.
Product exploration explored 100000 steps with 1296 reset in 155 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Detected a total of 13/13 stabilizing places and 13/16 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 575 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40011 steps (584 resets) in 91 ms. (434 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40002 steps (127 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
[2024-05-22 12:05:31] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2024-05-22 12:05:31] [INFO ] Invariant cache hit.
[2024-05-22 12:05:31] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/20 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/24 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/24 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/24 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/26 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/26 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/26 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/27 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/27 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/27 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 25 constraints, problems are : Problem set: 0 solved, 1 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 8/27 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/13 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 132ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 213 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-12a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-06 finished in 1744 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(p0) U (p0||X(G(p1))))))'
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 130/130 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 126
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 90 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 90 transition count 124
Applied a total of 12 rules in 6 ms. Remains 90 /96 variables (removed 6) and now considering 124/130 (removed 6) transitions.
// Phase 1: matrix 124 rows 90 cols
[2024-05-22 12:05:31] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:05:31] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 12:05:31] [INFO ] Invariant cache hit.
[2024-05-22 12:05:31] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 12:05:31] [INFO ] Implicit Places using invariants and state equation in 103 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 149 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 124/130 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 157 ms. Remains : 89/96 places, 124/130 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-07 finished in 304 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)&&X(F(p1)))))'
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 130/130 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 93 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 93 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 91 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 91 transition count 125
Applied a total of 10 rules in 4 ms. Remains 91 /96 variables (removed 5) and now considering 125/130 (removed 5) transitions.
// Phase 1: matrix 125 rows 91 cols
[2024-05-22 12:05:31] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:05:32] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 12:05:32] [INFO ] Invariant cache hit.
[2024-05-22 12:05:32] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 12:05:32] [INFO ] Implicit Places using invariants and state equation in 96 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 144 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/96 places, 125/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 150 ms. Remains : 90/96 places, 125/130 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 69 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-09 finished in 327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(F(p0)))))))'
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 130/130 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 126
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 90 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 90 transition count 124
Applied a total of 12 rules in 2 ms. Remains 90 /96 variables (removed 6) and now considering 124/130 (removed 6) transitions.
// Phase 1: matrix 124 rows 90 cols
[2024-05-22 12:05:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:05:32] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 12:05:32] [INFO ] Invariant cache hit.
[2024-05-22 12:05:32] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 12:05:32] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 138 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 124/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 89/96 places, 124/130 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-10
Product exploration explored 100000 steps with 16666 reset in 145 ms.
Product exploration explored 100000 steps with 16666 reset in 198 ms.
Computed a total of 14 stabilizing places and 13 stable transitions
Graph (complete) has 246 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 14 stabilizing places and 13 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 446 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4411 steps (32 resets) in 30 ms. (142 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 124/124 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
// Phase 1: matrix 124 rows 89 cols
[2024-05-22 12:05:34] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 12:05:34] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 12:05:34] [INFO ] Invariant cache hit.
[2024-05-22 12:05:34] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-22 12:05:34] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-22 12:05:34] [INFO ] Invariant cache hit.
[2024-05-22 12:05:34] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 124/213 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 61/151 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/213 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 151 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2574 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 124/213 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 61/151 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 123/274 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 274 constraints, problems are : Problem set: 0 solved, 123 unsolved in 1930 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
After SMT, in 4520ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 4521ms
Finished structural reductions in LTL mode , in 1 iterations and 4646 ms. Remains : 89/89 places, 124/124 transitions.
Computed a total of 14 stabilizing places and 13 stable transitions
Graph (complete) has 246 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 13 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 3011 steps (21 resets) in 10 ms. (273 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 190 ms.
Product exploration explored 100000 steps with 16666 reset in 126 ms.
Applying partial POR strategy [true, false, false, false, false, false]
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 124/124 transitions.
Graph (complete) has 246 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 88 transition count 123
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 123
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 0 with 23 rules applied. Total rules applied 25 place count 88 transition count 146
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 36 place count 77 transition count 124
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 11 rules applied. Total rules applied 47 place count 77 transition count 124
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 68 place count 56 transition count 82
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 21 rules applied. Total rules applied 89 place count 56 transition count 82
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 98 place count 47 transition count 73
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 107 place count 47 transition count 73
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 116 place count 38 transition count 55
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 125 place count 38 transition count 55
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 143 place count 20 transition count 28
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 161 place count 20 transition count 28
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 161 rules in 17 ms. Remains 20 /89 variables (removed 69) and now considering 28/124 (removed 96) transitions.
[2024-05-22 12:05:40] [INFO ] Redundant transitions in 0 ms returned []
Running 27 sub problems to find dead transitions.
[2024-05-22 12:05:40] [INFO ] Flow matrix only has 26 transitions (discarded 2 similar events)
// Phase 1: matrix 26 rows 20 cols
[2024-05-22 12:05:40] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 12:05:40] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD18 is UNSAT
At refinement iteration 3 (OVERLAPS) 25/45 variables, 20/21 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 14/35 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/35 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 1/46 variables, 1/36 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/36 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/46 variables, 0/36 constraints. Problems are: Problem set: 7 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 36 constraints, problems are : Problem set: 7 solved, 20 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 24/40 variables, 16/17 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 13/30 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 20/50 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/50 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 3/43 variables, 3/53 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/53 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 2/45 variables, 2/55 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/45 variables, 0/55 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 1/46 variables, 1/56 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/46 variables, 0/56 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 0/46 variables, 0/56 constraints. Problems are: Problem set: 7 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 56 constraints, problems are : Problem set: 7 solved, 20 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 20/27 constraints, Known Traps: 0/0 constraints]
After SMT, in 498ms problems are : Problem set: 7 solved, 20 unsolved
Search for dead transitions found 7 dead transitions in 500ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 20/89 places, 21/124 transitions.
Graph (complete) has 45 edges and 20 vertex of which 16 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 16 /20 variables (removed 4) and now considering 21/21 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/89 places, 21/124 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 524 ms. Remains : 16/89 places, 21/124 transitions.
Built C files in :
/tmp/ltsmin15079642658741518978
[2024-05-22 12:05:41] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15079642658741518978
Running compilation step : cd /tmp/ltsmin15079642658741518978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 336 ms.
Running link step : cd /tmp/ltsmin15079642658741518978;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15079642658741518978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13369732520904509243.hoa' '--buchi-type=spotba'
LTSmin run took 2120 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-10 finished in 11276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))||p0)))'
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 130/130 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 126
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 90 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 90 transition count 124
Applied a total of 12 rules in 5 ms. Remains 90 /96 variables (removed 6) and now considering 124/130 (removed 6) transitions.
// Phase 1: matrix 124 rows 90 cols
[2024-05-22 12:05:43] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:05:43] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 12:05:43] [INFO ] Invariant cache hit.
[2024-05-22 12:05:43] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 12:05:43] [INFO ] Implicit Places using invariants and state equation in 96 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 146 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 124/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 153 ms. Remains : 89/96 places, 124/130 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Computed a total of 14 stabilizing places and 13 stable transitions
Graph (complete) has 246 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-12a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-11 finished in 553 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 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 130/130 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 126
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 90 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 90 transition count 124
Applied a total of 12 rules in 6 ms. Remains 90 /96 variables (removed 6) and now considering 124/130 (removed 6) transitions.
[2024-05-22 12:05:44] [INFO ] Invariant cache hit.
[2024-05-22 12:05:44] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 12:05:44] [INFO ] Invariant cache hit.
[2024-05-22 12:05:44] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 12:05:44] [INFO ] Implicit Places using invariants and state equation in 96 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 159 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 124/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 166 ms. Remains : 89/96 places, 124/130 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-14 finished in 288 ms.
All properties solved by simple procedures.
Total runtime 28063 ms.

BK_STOP 1716379544464

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-12a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631132700460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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