Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089416200701.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 RefineWMG-PT-100101, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416200701
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 218K 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 RefineWMG-PT-100101-00
FORMULA_NAME RefineWMG-PT-100101-01
FORMULA_NAME RefineWMG-PT-100101-02
FORMULA_NAME RefineWMG-PT-100101-03
FORMULA_NAME RefineWMG-PT-100101-04
FORMULA_NAME RefineWMG-PT-100101-05
FORMULA_NAME RefineWMG-PT-100101-06
FORMULA_NAME RefineWMG-PT-100101-07
FORMULA_NAME RefineWMG-PT-100101-08
FORMULA_NAME RefineWMG-PT-100101-09
FORMULA_NAME RefineWMG-PT-100101-10
FORMULA_NAME RefineWMG-PT-100101-11
FORMULA_NAME RefineWMG-PT-100101-12
FORMULA_NAME RefineWMG-PT-100101-13
FORMULA_NAME RefineWMG-PT-100101-14
FORMULA_NAME RefineWMG-PT-100101-15

=== Now, execution of the tool begins

BK_START 1621265309887

Running Version 0
[2021-05-17 15:28:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-17 15:28:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 15:28:32] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2021-05-17 15:28:32] [INFO ] Transformed 504 places.
[2021-05-17 15:28:32] [INFO ] Transformed 403 transitions.
[2021-05-17 15:28:32] [INFO ] Parsed PT model containing 504 places and 403 transitions in 134 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 15:28:32] [INFO ] Initial state test concluded for 3 properties.
FORMULA RefineWMG-PT-100101-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 115 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:32] [INFO ] Computed 202 place invariants in 20 ms
[2021-05-17 15:28:33] [INFO ] Dead Transitions using invariants and state equation in 665 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:33] [INFO ] Computed 202 place invariants in 8 ms
[2021-05-17 15:28:33] [INFO ] Implicit Places using invariants in 228 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:33] [INFO ] Computed 202 place invariants in 4 ms
[2021-05-17 15:28:34] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:34] [INFO ] Computed 202 place invariants in 4 ms
[2021-05-17 15:28:34] [INFO ] Dead Transitions using invariants and state equation in 285 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
[2021-05-17 15:28:34] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 15:28:34] [INFO ] Flatten gal took : 110 ms
FORMULA RefineWMG-PT-100101-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 15:28:34] [INFO ] Flatten gal took : 35 ms
[2021-05-17 15:28:34] [INFO ] Input system was already deterministic with 403 transitions.
Incomplete random walk after 100057 steps, including 2 resets, run finished after 557 ms. (steps per millisecond=179 ) properties (out of 20) seen :12
Running SMT prover for 8 properties.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:35] [INFO ] Computed 202 place invariants in 3 ms
[2021-05-17 15:28:35] [INFO ] [Real]Absence check using 202 positive place invariants in 193 ms returned sat
[2021-05-17 15:28:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:28:35] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2021-05-17 15:28:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:28:36] [INFO ] [Nat]Absence check using 202 positive place invariants in 43 ms returned sat
[2021-05-17 15:28:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:28:36] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2021-05-17 15:28:36] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 52 ms.
[2021-05-17 15:28:37] [INFO ] Added : 154 causal constraints over 31 iterations in 1234 ms. Result :sat
[2021-05-17 15:28:37] [INFO ] [Real]Absence check using 202 positive place invariants in 39 ms returned sat
[2021-05-17 15:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:28:37] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2021-05-17 15:28:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:28:38] [INFO ] [Nat]Absence check using 202 positive place invariants in 36 ms returned sat
[2021-05-17 15:28:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:28:38] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2021-05-17 15:28:38] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 35 ms.
[2021-05-17 15:28:39] [INFO ] Added : 139 causal constraints over 28 iterations in 674 ms. Result :sat
[2021-05-17 15:28:39] [INFO ] [Real]Absence check using 202 positive place invariants in 32 ms returned sat
[2021-05-17 15:28:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:28:39] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2021-05-17 15:28:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:28:39] [INFO ] [Nat]Absence check using 202 positive place invariants in 26 ms returned sat
[2021-05-17 15:28:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:28:39] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2021-05-17 15:28:39] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 23 ms.
[2021-05-17 15:28:40] [INFO ] Added : 176 causal constraints over 36 iterations in 678 ms. Result :sat
[2021-05-17 15:28:40] [INFO ] [Real]Absence check using 202 positive place invariants in 28 ms returned sat
[2021-05-17 15:28:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:28:40] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2021-05-17 15:28:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:28:40] [INFO ] [Nat]Absence check using 202 positive place invariants in 34 ms returned sat
[2021-05-17 15:28:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:28:40] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2021-05-17 15:28:40] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 20 ms.
[2021-05-17 15:28:40] [INFO ] Added : 42 causal constraints over 9 iterations in 211 ms. Result :sat
[2021-05-17 15:28:41] [INFO ] [Real]Absence check using 202 positive place invariants in 30 ms returned sat
[2021-05-17 15:28:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:28:41] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2021-05-17 15:28:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:28:41] [INFO ] [Nat]Absence check using 202 positive place invariants in 31 ms returned sat
[2021-05-17 15:28:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:28:41] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2021-05-17 15:28:41] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 28 ms.
[2021-05-17 15:28:42] [INFO ] Added : 87 causal constraints over 18 iterations in 660 ms. Result :sat
[2021-05-17 15:28:42] [INFO ] [Real]Absence check using 202 positive place invariants in 44 ms returned sat
[2021-05-17 15:28:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:28:42] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2021-05-17 15:28:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:28:42] [INFO ] [Nat]Absence check using 202 positive place invariants in 62 ms returned sat
[2021-05-17 15:28:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:28:42] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2021-05-17 15:28:42] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 44 ms.
[2021-05-17 15:28:43] [INFO ] Added : 73 causal constraints over 15 iterations in 445 ms. Result :sat
[2021-05-17 15:28:43] [INFO ] [Real]Absence check using 202 positive place invariants in 37 ms returned sat
[2021-05-17 15:28:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:28:43] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2021-05-17 15:28:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:28:43] [INFO ] [Nat]Absence check using 202 positive place invariants in 34 ms returned sat
[2021-05-17 15:28:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:28:44] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2021-05-17 15:28:44] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 19 ms.
[2021-05-17 15:28:45] [INFO ] Added : 202 causal constraints over 41 iterations in 1392 ms. Result :sat
[2021-05-17 15:28:45] [INFO ] [Real]Absence check using 202 positive place invariants in 38 ms returned sat
[2021-05-17 15:28:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 15:28:45] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2021-05-17 15:28:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 15:28:46] [INFO ] [Nat]Absence check using 202 positive place invariants in 37 ms returned sat
[2021-05-17 15:28:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 15:28:46] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2021-05-17 15:28:46] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-17 15:28:47] [INFO ] Added : 177 causal constraints over 36 iterations in 847 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 297 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 44 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 396 place count 108 transition count 107
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 96 rules applied. Total rules applied 492 place count 108 transition count 11
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 588 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 588 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 590 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 592 place count 10 transition count 9
Applied a total of 592 rules in 113 ms. Remains 10 /504 variables (removed 494) and now considering 9/403 (removed 394) transitions.
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 15:28:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 15:28:47] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 15:28:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 15:28:47] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 15:28:47] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 15:28:47] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2021-05-17 15:28:47] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 15:28:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 15:28:47] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/504 places, 9/403 transitions.
Stuttering acceptance computed with spot in 300 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-100101-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-03 finished in 655 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X((p0||G(F(p1))))||G(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 14 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:47] [INFO ] Computed 202 place invariants in 11 ms
[2021-05-17 15:28:48] [INFO ] Dead Transitions using invariants and state equation in 373 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:48] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:28:48] [INFO ] Implicit Places using invariants in 211 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:48] [INFO ] Computed 202 place invariants in 3 ms
[2021-05-17 15:28:48] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:48] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:28:49] [INFO ] Dead Transitions using invariants and state equation in 215 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-100101-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LT s113 1), p2:(OR (LT s171 1) (LT s172 1) (LT s174 1)), p1:(LT s493 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 3821 reset in 1785 ms.
Stack based approach found an accepted trace after 12637 steps with 14 reset with depth 12610 and stack size 12555 in 227 ms.
FORMULA RefineWMG-PT-100101-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-05 finished in 3384 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 7 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:51] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:28:51] [INFO ] Dead Transitions using invariants and state equation in 310 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:51] [INFO ] Computed 202 place invariants in 16 ms
[2021-05-17 15:28:51] [INFO ] Implicit Places using invariants in 343 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:51] [INFO ] Computed 202 place invariants in 3 ms
[2021-05-17 15:28:52] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:52] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:28:52] [INFO ] Dead Transitions using invariants and state equation in 255 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s373 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-100101-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-06 finished in 1495 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((((p0||X(p1)) U p2) U X((p1 U G(p3)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 14 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:52] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:28:52] [INFO ] Dead Transitions using invariants and state equation in 226 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:52] [INFO ] Computed 202 place invariants in 8 ms
[2021-05-17 15:28:53] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:53] [INFO ] Computed 202 place invariants in 3 ms
[2021-05-17 15:28:53] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:53] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:28:53] [INFO ] Dead Transitions using invariants and state equation in 273 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 318 ms :[(NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (NOT p1), (NOT p2), (AND p1 (NOT p2) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : RefineWMG-PT-100101-07 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND p3 (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3) p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p3 p1), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p3), acceptance={} source=7 dest: 6}, { cond=p3, acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(GEQ s320 1), p2:(AND (GEQ s401 1) (GEQ s402 1) (GEQ s404 1)), p0:(GEQ s85 1), p1:(GEQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33254 reset in 1227 ms.
Stack based approach found an accepted trace after 901 steps with 308 reset with depth 3 and stack size 3 in 9 ms.
FORMULA RefineWMG-PT-100101-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-07 finished in 2574 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X(p0)||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 5 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:55] [INFO ] Computed 202 place invariants in 3 ms
[2021-05-17 15:28:55] [INFO ] Dead Transitions using invariants and state equation in 267 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:55] [INFO ] Computed 202 place invariants in 3 ms
[2021-05-17 15:28:55] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:55] [INFO ] Computed 202 place invariants in 4 ms
[2021-05-17 15:28:56] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:56] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:28:56] [INFO ] Dead Transitions using invariants and state equation in 207 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : RefineWMG-PT-100101-08 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(LT s58 1), p0:(GEQ s438 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 190 steps with 0 reset in 3 ms.
FORMULA RefineWMG-PT-100101-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-08 finished in 1306 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 5 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:56] [INFO ] Computed 202 place invariants in 3 ms
[2021-05-17 15:28:56] [INFO ] Dead Transitions using invariants and state equation in 357 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:56] [INFO ] Computed 202 place invariants in 3 ms
[2021-05-17 15:28:57] [INFO ] Implicit Places using invariants in 239 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:57] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:28:57] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:57] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:28:57] [INFO ] Dead Transitions using invariants and state equation in 236 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s326 1) (GEQ s327 1) (GEQ s329 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null][false]]
Product exploration explored 100000 steps with 13 reset in 1893 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 1 ms.
FORMULA RefineWMG-PT-100101-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-09 finished in 3269 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 5 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:28:59] [INFO ] Computed 202 place invariants in 3 ms
[2021-05-17 15:29:00] [INFO ] Dead Transitions using invariants and state equation in 242 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:29:00] [INFO ] Computed 202 place invariants in 3 ms
[2021-05-17 15:29:00] [INFO ] Implicit Places using invariants in 170 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:29:00] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:29:00] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:29:00] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:29:00] [INFO ] Dead Transitions using invariants and state equation in 263 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-100101-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GEQ s268 1), p1:(OR (AND (GEQ s81 1) (GEQ s82 1) (GEQ s84 1)) (AND (GEQ s131 1) (GEQ s132 1) (GEQ s134 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2279 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA RefineWMG-PT-100101-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-10 finished in 3513 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 10 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:29:03] [INFO ] Computed 202 place invariants in 14 ms
[2021-05-17 15:29:03] [INFO ] Dead Transitions using invariants and state equation in 302 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:29:03] [INFO ] Computed 202 place invariants in 5 ms
[2021-05-17 15:29:03] [INFO ] Implicit Places using invariants in 200 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:29:03] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:29:04] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:29:04] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:29:04] [INFO ] Dead Transitions using invariants and state equation in 226 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s145 1) (GEQ s72 1) (AND (OR (LT s452 1) (GEQ s448 1)) (OR (GEQ s72 1) (GEQ s448 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1100 ms.
Product exploration explored 100000 steps with 50000 reset in 978 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 888 ms.
Product exploration explored 100000 steps with 50000 reset in 1215 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 504 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 293 edges and 504 vertex of which 194 / 504 are part of one of the 97 SCC in 1 ms
Free SCC test removed 97 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 310 transition count 210
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 196 place count 310 transition count 210
Deduced a syphon composed of 99 places in 1 ms
Applied a total of 196 rules in 123 ms. Remains 310 /504 variables (removed 194) and now considering 210/403 (removed 193) transitions.
// Phase 1: matrix 210 rows 310 cols
[2021-05-17 15:29:09] [INFO ] Computed 105 place invariants in 1 ms
[2021-05-17 15:29:09] [INFO ] Dead Transitions using invariants and state equation in 163 ms returned []
[2021-05-17 15:29:09] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 210 rows 310 cols
[2021-05-17 15:29:09] [INFO ] Computed 105 place invariants in 2 ms
[2021-05-17 15:29:09] [INFO ] Dead Transitions using invariants and state equation in 146 ms returned []
Finished structural reductions, in 1 iterations. Remains : 310/504 places, 210/403 transitions.
Product exploration explored 100000 steps with 50000 reset in 2451 ms.
Product exploration explored 100000 steps with 50000 reset in 2063 ms.
[2021-05-17 15:29:14] [INFO ] Flatten gal took : 26 ms
[2021-05-17 15:29:14] [INFO ] Flatten gal took : 24 ms
[2021-05-17 15:29:14] [INFO ] Time to serialize gal into /tmp/LTL17517047437658422693.gal : 27 ms
[2021-05-17 15:29:14] [INFO ] Time to serialize properties into /tmp/LTL110205609314148247.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/LTL17517047437658422693.gal, -t, CGAL, -LTL, /tmp/LTL110205609314148247.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/LTL17517047437658422693.gal -t CGAL -LTL /tmp/LTL110205609314148247.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(((p142>=1)||(p69>=1))||(((p449<1)||(p445>=1))&&((p69>=1)||(p445>=1))))"))))
Formula 0 simplified : !XF"(((p142>=1)||(p69>=1))||(((p449<1)||(p445>=1))&&((p69>=1)||(p445>=1))))"
Detected timeout of ITS tools.
[2021-05-17 15:29:29] [INFO ] Flatten gal took : 23 ms
[2021-05-17 15:29:29] [INFO ] Applying decomposition
[2021-05-17 15:29:29] [INFO ] Flatten gal took : 17 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/graph3675068696109999405.txt, -o, /tmp/graph3675068696109999405.bin, -w, /tmp/graph3675068696109999405.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/graph3675068696109999405.bin, -l, -1, -v, -w, /tmp/graph3675068696109999405.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:29:29] [INFO ] Decomposing Gal with order
[2021-05-17 15:29:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:29:30] [INFO ] Flatten gal took : 125 ms
[2021-05-17 15:29:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2021-05-17 15:29:30] [INFO ] Time to serialize gal into /tmp/LTL14949780241829531385.gal : 14 ms
[2021-05-17 15:29:30] [INFO ] Time to serialize properties into /tmp/LTL17901723097640082526.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/LTL14949780241829531385.gal, -t, CGAL, -LTL, /tmp/LTL17901723097640082526.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/LTL14949780241829531385.gal -t CGAL -LTL /tmp/LTL17901723097640082526.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(((i10.u70.p142>=1)||(i5.u35.p69>=1))||(((i32.u219.p449<1)||(i31.u216.p445>=1))&&((i5.u35.p69>=1)||(i31.u216.p445>=1))))"))))
Formula 0 simplified : !XF"(((i10.u70.p142>=1)||(i5.u35.p69>=1))||(((i32.u219.p449<1)||(i31.u216.p445>=1))&&((i5.u35.p69>=1)||(i31.u216.p445>=1))))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13330850476348450599
[2021-05-17 15:29:45] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13330850476348450599
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/ltsmin13330850476348450599]
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/ltsmin13330850476348450599] 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/ltsmin13330850476348450599] 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 RefineWMG-PT-100101-11 finished in 42850 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 29 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:29:46] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:29:46] [INFO ] Dead Transitions using invariants and state equation in 534 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:29:46] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:29:46] [INFO ] Implicit Places using invariants in 187 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:29:46] [INFO ] Computed 202 place invariants in 13 ms
[2021-05-17 15:29:47] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:29:47] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:29:47] [INFO ] Dead Transitions using invariants and state equation in 343 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LT s87 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1972 ms.
Stack based approach found an accepted trace after 238 steps with 0 reset with depth 239 and stack size 239 in 3 ms.
FORMULA RefineWMG-PT-100101-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-12 finished in 3630 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U G(p1))||G(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 20 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:29:49] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:29:50] [INFO ] Dead Transitions using invariants and state equation in 326 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:29:50] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:29:50] [INFO ] Implicit Places using invariants in 182 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:29:50] [INFO ] Computed 202 place invariants in 2 ms
[2021-05-17 15:29:50] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2021-05-17 15:29:50] [INFO ] Computed 202 place invariants in 1 ms
[2021-05-17 15:29:51] [INFO ] Dead Transitions using invariants and state equation in 341 ms returned []
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 339 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-100101-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s378 1), p2:(GEQ s297 1), p1:(GEQ s138 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1988 ms.
Product exploration explored 100000 steps with 0 reset in 1856 ms.
Knowledge obtained : [(NOT p0), p2, (NOT p1)]
Stuttering acceptance computed with spot in 337 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 2294 ms.
Product exploration explored 100000 steps with 0 reset in 2051 ms.
Applying partial POR strategy [false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 3 out of 504 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 294 edges and 504 vertex of which 194 / 504 are part of one of the 97 SCC in 1 ms
Free SCC test removed 97 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 310 transition count 210
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 197 place count 310 transition count 210
Deduced a syphon composed of 100 places in 0 ms
Applied a total of 197 rules in 23 ms. Remains 310 /504 variables (removed 194) and now considering 210/403 (removed 193) transitions.
// Phase 1: matrix 210 rows 310 cols
[2021-05-17 15:30:00] [INFO ] Computed 105 place invariants in 2 ms
[2021-05-17 15:30:00] [INFO ] Dead Transitions using invariants and state equation in 165 ms returned []
[2021-05-17 15:30:00] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 210 rows 310 cols
[2021-05-17 15:30:00] [INFO ] Computed 105 place invariants in 1 ms
[2021-05-17 15:30:00] [INFO ] Dead Transitions using invariants and state equation in 132 ms returned []
Finished structural reductions, in 1 iterations. Remains : 310/504 places, 210/403 transitions.
Entered a terminal (fully accepting) state of product in 18456 steps with 0 reset in 52 ms.
FORMULA RefineWMG-PT-100101-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-14 finished in 11124 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 299 edges and 504 vertex of which 200 / 504 are part of one of the 100 SCC in 1 ms
Free SCC test removed 100 places
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 304 transition count 204
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 397 place count 106 transition count 105
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 1 with 97 rules applied. Total rules applied 494 place count 106 transition count 8
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 2 with 97 rules applied. Total rules applied 591 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 591 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 593 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 595 place count 7 transition count 6
Applied a total of 595 rules in 18 ms. Remains 7 /504 variables (removed 497) and now considering 6/403 (removed 397) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 15:30:01] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 15:30:01] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 15:30:01] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 15:30:01] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 15:30:01] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 15:30:01] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-17 15:30:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 15:30:01] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 15:30:01] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/504 places, 6/403 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-15 finished in 146 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15855801179999214534
[2021-05-17 15:30:01] [INFO ] Computing symmetric may disable matrix : 403 transitions.
[2021-05-17 15:30:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 15:30:01] [INFO ] Computing symmetric may enable matrix : 403 transitions.
[2021-05-17 15:30:01] [INFO ] Applying decomposition
[2021-05-17 15:30:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 15:30:01] [INFO ] Flatten gal took : 17 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/graph11018246053467119578.txt, -o, /tmp/graph11018246053467119578.bin, -w, /tmp/graph11018246053467119578.weights], workingDir=null]
[2021-05-17 15:30:01] [INFO ] Computing Do-Not-Accords matrix : 403 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11018246053467119578.bin, -l, -1, -v, -w, /tmp/graph11018246053467119578.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:30:01] [INFO ] Decomposing Gal with order
[2021-05-17 15:30:01] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 15:30:01] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15855801179999214534
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/ltsmin15855801179999214534]
[2021-05-17 15:30:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:30:01] [INFO ] Flatten gal took : 45 ms
[2021-05-17 15:30:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-17 15:30:01] [INFO ] Time to serialize gal into /tmp/LTLFireability368544632560332588.gal : 14 ms
[2021-05-17 15:30:01] [INFO ] Time to serialize properties into /tmp/LTLFireability6042148582524629368.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/LTLFireability368544632560332588.gal, -t, CGAL, -LTL, /tmp/LTLFireability6042148582524629368.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/LTLFireability368544632560332588.gal -t CGAL -LTL /tmp/LTLFireability6042148582524629368.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(((i10.u71.p142>=1)||(((i32.u221.p449<1)||(i32.u219.p445>=1))&&((i5.u35.p69>=1)||(i32.u219.p445>=1))))||(i5.u35.p69>=1))"))))
Formula 0 simplified : !XF"(((i10.u71.p142>=1)||(((i32.u221.p449<1)||(i32.u219.p445>=1))&&((i5.u35.p69>=1)||(i32.u219.p445>=1))))||(i5.u35.p69>=1))"
Compilation finished in 2300 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15855801179999214534]
Link finished in 76 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15855801179999214534]
LTSmin run took 654 ms.
FORMULA RefineWMG-PT-100101-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621265404481

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="RefineWMG-PT-100101"
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-4028"
echo " Executing tool itstools"
echo " Input is RefineWMG-PT-100101, 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 r178-tajo-162089416200701"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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