Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r083-tall-162048875200260.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DiscoveryGPU-PT-07b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875200260
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 54K May 5 16:51 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-07b-00
FORMULA_NAME DiscoveryGPU-PT-07b-01
FORMULA_NAME DiscoveryGPU-PT-07b-02
FORMULA_NAME DiscoveryGPU-PT-07b-03
FORMULA_NAME DiscoveryGPU-PT-07b-04
FORMULA_NAME DiscoveryGPU-PT-07b-05
FORMULA_NAME DiscoveryGPU-PT-07b-06
FORMULA_NAME DiscoveryGPU-PT-07b-07
FORMULA_NAME DiscoveryGPU-PT-07b-08
FORMULA_NAME DiscoveryGPU-PT-07b-09
FORMULA_NAME DiscoveryGPU-PT-07b-10
FORMULA_NAME DiscoveryGPU-PT-07b-11
FORMULA_NAME DiscoveryGPU-PT-07b-12
FORMULA_NAME DiscoveryGPU-PT-07b-13
FORMULA_NAME DiscoveryGPU-PT-07b-14
FORMULA_NAME DiscoveryGPU-PT-07b-15

=== Now, execution of the tool begins

BK_START 1620572671749

Running Version 0
[2021-05-09 15:04:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 15:04:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 15:04:40] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2021-05-09 15:04:40] [INFO ] Transformed 212 places.
[2021-05-09 15:04:40] [INFO ] Transformed 224 transitions.
[2021-05-09 15:04:40] [INFO ] Found NUPN structural information;
[2021-05-09 15:04:40] [INFO ] Parsed PT model containing 212 places and 224 transitions in 97 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 15:04:40] [INFO ] Initial state test concluded for 2 properties.
FORMULA DiscoveryGPU-PT-07b-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 212 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 212/212 places, 224/224 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 200 transition count 224
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 44 place count 168 transition count 192
Iterating global reduction 1 with 32 rules applied. Total rules applied 76 place count 168 transition count 192
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 164 transition count 188
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 164 transition count 188
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 87 place count 161 transition count 185
Iterating global reduction 1 with 3 rules applied. Total rules applied 90 place count 161 transition count 185
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 93 place count 158 transition count 182
Iterating global reduction 1 with 3 rules applied. Total rules applied 96 place count 158 transition count 182
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 157 transition count 180
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 157 transition count 180
Applied a total of 98 rules in 64 ms. Remains 157 /212 variables (removed 55) and now considering 180/224 (removed 44) transitions.
// Phase 1: matrix 180 rows 157 cols
[2021-05-09 15:04:41] [INFO ] Computed 2 place invariants in 9 ms
[2021-05-09 15:04:41] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 180 rows 157 cols
[2021-05-09 15:04:41] [INFO ] Computed 2 place invariants in 12 ms
[2021-05-09 15:04:41] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
// Phase 1: matrix 180 rows 157 cols
[2021-05-09 15:04:41] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-09 15:04:41] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Finished structural reductions, in 1 iterations. Remains : 157/212 places, 180/224 transitions.
[2021-05-09 15:04:41] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 15:04:41] [INFO ] Flatten gal took : 41 ms
FORMULA DiscoveryGPU-PT-07b-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 15:04:41] [INFO ] Flatten gal took : 16 ms
[2021-05-09 15:04:41] [INFO ] Input system was already deterministic with 180 transitions.
Incomplete random walk after 100000 steps, including 434 resets, run finished after 317 ms. (steps per millisecond=315 ) properties (out of 19) seen :17
Running SMT prover for 2 properties.
// Phase 1: matrix 180 rows 157 cols
[2021-05-09 15:04:41] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-09 15:04:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 15:04:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:04:42] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-09 15:04:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:04:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 15:04:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:04:42] [INFO ] [Nat]Absence check using state equation in 24 ms returned unsat
[2021-05-09 15:04:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 15:04:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:04:42] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-09 15:04:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:04:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 157/157 places, 180/180 transitions.
Graph (complete) has 304 edges and 157 vertex of which 155 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 154 transition count 152
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 127 transition count 152
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 55 place count 127 transition count 130
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 99 place count 105 transition count 130
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 106 place count 98 transition count 122
Iterating global reduction 2 with 7 rules applied. Total rules applied 113 place count 98 transition count 122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 113 place count 98 transition count 121
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 115 place count 97 transition count 121
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 118 place count 94 transition count 118
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 94 transition count 118
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 92 transition count 116
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 92 transition count 116
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 90 transition count 113
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 90 transition count 113
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 88 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 88 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 87 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 87 transition count 109
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 205 place count 52 transition count 74
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 211 place count 46 transition count 63
Iterating global reduction 2 with 6 rules applied. Total rules applied 217 place count 46 transition count 63
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 223 place count 40 transition count 55
Iterating global reduction 2 with 6 rules applied. Total rules applied 229 place count 40 transition count 55
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 234 place count 35 transition count 46
Iterating global reduction 2 with 5 rules applied. Total rules applied 239 place count 35 transition count 46
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 244 place count 30 transition count 40
Iterating global reduction 2 with 5 rules applied. Total rules applied 249 place count 30 transition count 40
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 254 place count 25 transition count 31
Iterating global reduction 2 with 5 rules applied. Total rules applied 259 place count 25 transition count 31
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 264 place count 20 transition count 25
Iterating global reduction 2 with 5 rules applied. Total rules applied 269 place count 20 transition count 25
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 271 place count 18 transition count 22
Iterating global reduction 2 with 2 rules applied. Total rules applied 273 place count 18 transition count 22
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 274 place count 17 transition count 21
Iterating global reduction 2 with 1 rules applied. Total rules applied 275 place count 17 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 276 place count 17 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 277 place count 16 transition count 19
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 283 place count 14 transition count 15
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 287 place count 10 transition count 15
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 295 place count 6 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 296 place count 6 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 297 place count 5 transition count 9
Applied a total of 297 rules in 52 ms. Remains 5 /157 variables (removed 152) and now considering 9/180 (removed 171) transitions.
[2021-05-09 15:04:42] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 15:04:42] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:04:42] [INFO ] Implicit Places using invariants in 11 ms returned []
[2021-05-09 15:04:42] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 15:04:42] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:04:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:04:42] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-09 15:04:42] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:04:42] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 15:04:42] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:04:42] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/157 places, 9/180 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-07b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-00 finished in 264 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)||(X(F(p1)) U G(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 157 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 157/157 places, 180/180 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 155 transition count 180
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 146 transition count 170
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 146 transition count 170
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 140 transition count 163
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 140 transition count 163
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 136 transition count 159
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 136 transition count 159
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 133 transition count 156
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 133 transition count 156
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 131 transition count 152
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 131 transition count 152
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 129 transition count 150
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 129 transition count 150
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 127 transition count 148
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 127 transition count 148
Applied a total of 58 rules in 21 ms. Remains 127 /157 variables (removed 30) and now considering 148/180 (removed 32) transitions.
// Phase 1: matrix 148 rows 127 cols
[2021-05-09 15:04:42] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:04:42] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 148 rows 127 cols
[2021-05-09 15:04:42] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:04:42] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 127 cols
[2021-05-09 15:04:42] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:04:42] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 127/157 places, 148/180 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-07b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s121 0) (EQ s54 1)), p2:(OR (EQ s70 0) (EQ s107 1)), p1:(OR (EQ s34 0) (EQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 444 reset in 272 ms.
Product exploration explored 100000 steps with 441 reset in 215 ms.
Graph (complete) has 255 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Knowledge obtained : [p0, p2, p1]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 439 reset in 142 ms.
Product exploration explored 100000 steps with 439 reset in 155 ms.
Applying partial POR strategy [true, true, true]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 127 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 127/127 places, 148/148 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 127 transition count 148
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 14 place count 127 transition count 215
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 37 place count 127 transition count 215
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 47 place count 127 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 126 transition count 214
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 126 transition count 214
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 70 place count 126 transition count 282
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 122 transition count 266
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 122 transition count 266
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 90 place count 110 transition count 234
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 102 place count 110 transition count 234
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 111 place count 101 transition count 213
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 120 place count 101 transition count 213
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 123 place count 98 transition count 207
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 98 transition count 207
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 131 place count 93 transition count 196
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 136 place count 93 transition count 196
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 143 place count 86 transition count 178
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 150 place count 86 transition count 178
Deduced a syphon composed of 45 places in 0 ms
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 174 place count 86 transition count 154
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 178 place count 82 transition count 146
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 82 transition count 146
Deduced a syphon composed of 41 places in 0 ms
Applied a total of 182 rules in 39 ms. Remains 82 /127 variables (removed 45) and now considering 146/148 (removed 2) transitions.
[2021-05-09 15:04:44] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-09 15:04:44] [INFO ] Flow matrix only has 136 transitions (discarded 10 similar events)
// Phase 1: matrix 136 rows 82 cols
[2021-05-09 15:04:44] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:04:44] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 82/127 places, 146/148 transitions.
Product exploration explored 100000 steps with 1672 reset in 341 ms.
Product exploration explored 100000 steps with 1688 reset in 204 ms.
[2021-05-09 15:04:44] [INFO ] Flatten gal took : 8 ms
[2021-05-09 15:04:44] [INFO ] Flatten gal took : 12 ms
[2021-05-09 15:04:44] [INFO ] Time to serialize gal into /tmp/LTL1154729844764969633.gal : 8 ms
[2021-05-09 15:04:44] [INFO ] Time to serialize properties into /tmp/LTL10811950574028715712.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1154729844764969633.gal, -t, CGAL, -LTL, /tmp/LTL10811950574028715712.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1154729844764969633.gal -t CGAL -LTL /tmp/LTL10811950574028715712.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("((p199==0)||(p85==1))"))||((X(F("((p50==0)||(p148==1))")))U(G("((p115==0)||(p181==1))"))))))
Formula 0 simplified : !G(F"((p199==0)||(p85==1))" | (XF"((p50==0)||(p148==1))" U G"((p115==0)||(p181==1))"))
Detected timeout of ITS tools.
[2021-05-09 15:04:59] [INFO ] Flatten gal took : 19 ms
[2021-05-09 15:04:59] [INFO ] Applying decomposition
[2021-05-09 15:04:59] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16473167622378932188.txt, -o, /tmp/graph16473167622378932188.bin, -w, /tmp/graph16473167622378932188.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16473167622378932188.bin, -l, -1, -v, -w, /tmp/graph16473167622378932188.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 15:04:59] [INFO ] Decomposing Gal with order
[2021-05-09 15:04:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:04:59] [INFO ] Removed a total of 55 redundant transitions.
[2021-05-09 15:05:00] [INFO ] Flatten gal took : 48 ms
[2021-05-09 15:05:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2021-05-09 15:05:00] [INFO ] Time to serialize gal into /tmp/LTL14438874472042735174.gal : 14 ms
[2021-05-09 15:05:00] [INFO ] Time to serialize properties into /tmp/LTL1096620754481850454.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14438874472042735174.gal, -t, CGAL, -LTL, /tmp/LTL1096620754481850454.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14438874472042735174.gal -t CGAL -LTL /tmp/LTL1096620754481850454.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((F("((u42.p199==0)||(i5.u18.p85==1))"))||((X(F("((i2.u12.p50==0)||(i13.u33.p148==1))")))U(G("((i7.i1.u25.p115==0)||(i1.u39.p181==1))"))))))
Formula 0 simplified : !G(F"((u42.p199==0)||(i5.u18.p85==1))" | (XF"((i2.u12.p50==0)||(i13.u33.p148==1))" U G"((i7.i1.u25.p115==0)||(i1.u39.p181==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6836693995820030657
[2021-05-09 15:05:15] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6836693995820030657
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6836693995820030657]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6836693995820030657] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6836693995820030657] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property DiscoveryGPU-PT-07b-01 finished in 42306 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((((p0&&(G(p2)||p1)) U (F(p3) U X(p0)))||G(p4)))], workingDir=/home/mcc/execution]
Support contains 7 out of 157 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 157/157 places, 180/180 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 155 transition count 180
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 146 transition count 171
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 146 transition count 171
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 142 transition count 166
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 142 transition count 166
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 138 transition count 162
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 138 transition count 162
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 134 transition count 157
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 134 transition count 157
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 132 transition count 154
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 132 transition count 154
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 130 transition count 152
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 130 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 129 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 129 transition count 151
Applied a total of 54 rules in 16 ms. Remains 129 /157 variables (removed 28) and now considering 151/180 (removed 29) transitions.
// Phase 1: matrix 151 rows 129 cols
[2021-05-09 15:05:25] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:05:25] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 151 rows 129 cols
[2021-05-09 15:05:25] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:05:25] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
// Phase 1: matrix 151 rows 129 cols
[2021-05-09 15:05:25] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:05:25] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/157 places, 151/180 transitions.
Stuttering acceptance computed with spot in 353 ms :[(AND (NOT p0) (NOT p4)), (AND (NOT p0) (NOT p4)), (AND (NOT p3) (NOT p4) (NOT p0)), (AND (NOT p3) (NOT p4) (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4) (NOT p2)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-07b-02 automaton TGBA [mat=[[{ cond=p4, acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p0) p4) (AND (NOT p3) (NOT p1) (NOT p2) p4)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p1) p2 p4), acceptance={} source=0 dest: 3}, { cond=(NOT p4), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p3) (NOT p0) (NOT p4)) (AND (NOT p3) (NOT p1) (NOT p2) (NOT p4))), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p3) p0 (NOT p1) p2 (NOT p4)), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p0) p4), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p4), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p4)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) (NOT p0) (NOT p4)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p4)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p3) (NOT p0) p4), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p4)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) p4), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p3) (NOT p0) p2 p4), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p3) (NOT p0) p2 (NOT p4)), acceptance={} source=3 dest: 10}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p3) (NOT p0) p2), acceptance={} source=6 dest: 10}], [{ cond=(NOT p3), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p3) (NOT p4)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p3) p4), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p4)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p3) (NOT p2) p4), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p3) p2 p4), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p3) p2 (NOT p4)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p3) p2), acceptance={} source=10 dest: 10}]], initial=0, aps=[p4:(OR (EQ s78 0) (EQ s14 1)), p3:(OR (EQ s125 0) (EQ s40 1)), p0:(OR (EQ s121 0) (EQ s32 1)), p1:(OR (EQ s121 0) (EQ s32 1)), p2:(EQ s110 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 210 ms.
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Graph (complete) has 257 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p4, p3, p0, p1, (NOT p2)]
Adopting property with smaller alphabet thanks to knowledge :p3
Stuttering acceptance computed with spot in 195 ms :[(AND p3 (NOT p4) (NOT p0)), (AND (NOT p0) (NOT p4)), (NOT p0), (AND (NOT p3) (NOT p4) (NOT p0)), (AND (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p3) (NOT p4))]
Support contains 6 out of 129 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 129/129 places, 151/151 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 129 cols
[2021-05-09 15:05:26] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:05:26] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 151 rows 129 cols
[2021-05-09 15:05:26] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:05:26] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
// Phase 1: matrix 151 rows 129 cols
[2021-05-09 15:05:26] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:05:26] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 151/151 transitions.
Stuttering acceptance computed with spot in 213 ms :[(AND p3 (NOT p4) (NOT p0)), (AND (NOT p0) (NOT p4)), (NOT p0), (AND (NOT p3) (NOT p4) (NOT p0)), (AND (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p3) (NOT p4))]
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Product exploration explored 100000 steps with 50000 reset in 197 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 200 ms :[(AND p3 (NOT p4) (NOT p0)), (AND (NOT p0) (NOT p4)), (NOT p0), (AND (NOT p3) (NOT p4) (NOT p0)), (AND (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p3) (NOT p4))]
Support contains 6 out of 129 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 129/129 places, 151/151 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 129 transition count 151
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 25 Pre rules applied. Total rules applied 15 place count 129 transition count 220
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 40 place count 129 transition count 220
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 49 place count 129 transition count 220
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -76
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 71 place count 129 transition count 296
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 126 transition count 284
Deduced a syphon composed of 71 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 126 transition count 284
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 86 place count 117 transition count 260
Deduced a syphon composed of 65 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 95 place count 117 transition count 260
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 104 place count 108 transition count 239
Deduced a syphon composed of 59 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 113 place count 108 transition count 239
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 116 place count 105 transition count 233
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 119 place count 105 transition count 233
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 125 place count 99 transition count 218
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 131 place count 99 transition count 218
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 143 place count 87 transition count 188
Deduced a syphon composed of 47 places in 5 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 155 place count 87 transition count 188
Deduced a syphon composed of 47 places in 1 ms
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 1 with 28 rules applied. Total rules applied 183 place count 87 transition count 160
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 187 place count 83 transition count 152
Deduced a syphon composed of 43 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 191 place count 83 transition count 152
Deduced a syphon composed of 43 places in 0 ms
Applied a total of 191 rules in 41 ms. Remains 83 /129 variables (removed 46) and now considering 152/151 (removed -1) transitions.
[2021-05-09 15:05:27] [INFO ] Redundant transitions in 4 ms returned []
[2021-05-09 15:05:27] [INFO ] Flow matrix only has 138 transitions (discarded 14 similar events)
// Phase 1: matrix 138 rows 83 cols
[2021-05-09 15:05:27] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 15:05:27] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 1 iterations. Remains : 83/129 places, 152/151 transitions.
Product exploration explored 100000 steps with 50000 reset in 177 ms.
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Starting structural reductions, iteration 0 : 129/129 places, 151/151 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 129 cols
[2021-05-09 15:05:28] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 15:05:28] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 151 rows 129 cols
[2021-05-09 15:05:28] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:05:28] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
// Phase 1: matrix 151 rows 129 cols
[2021-05-09 15:05:28] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 15:05:28] [INFO ] Dead Transitions using invariants and state equation in 186 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 151/151 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)

BK_STOP 1620572729402

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-07b"
export BK_EXAMINATION="LTLCardinality"
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-4028"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-07b, 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 r083-tall-162048875200260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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