Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r240-smll-165303241300076.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SmallOperatingSystem-PT-MT0064DC0032, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-smll-165303241300076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 8.8K Apr 30 10:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 30 10:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 10:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 10:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 09:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 09:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 09:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 09:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 9 09:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 13 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 8.2K May 10 09:34 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 SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-00
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-01
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-02
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-03
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-04
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-05
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-06
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-07
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-08
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-09
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-10
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-11
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-12
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-13
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-14
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653040332099

Running Version 202205111006
[2022-05-20 09:52:13] [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]
[2022-05-20 09:52:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 09:52:14] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2022-05-20 09:52:14] [INFO ] Transformed 9 places.
[2022-05-20 09:52:14] [INFO ] Transformed 8 transitions.
[2022-05-20 09:52:14] [INFO ] Parsed PT model containing 9 places and 8 transitions in 244 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 16 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 09:52:14] [INFO ] Computed 4 place invariants in 6 ms
[2022-05-20 09:52:14] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 09:52:14] [INFO ] Computed 4 place invariants in 6 ms
[2022-05-20 09:52:14] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 09:52:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 09:52:14] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2022-05-20 09:52:15] [INFO ] Flatten gal took : 22 ms
[2022-05-20 09:52:15] [INFO ] Flatten gal took : 5 ms
[2022-05-20 09:52:15] [INFO ] Input system was already deterministic with 8 transitions.
Finished random walk after 1079 steps, including 0 resets, run visited all 12 properties in 31 ms. (steps per millisecond=34 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)&&p0)))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 15 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2022-05-20 09:52:15] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 09:52:15] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2022-05-20 09:52:15] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 09:52:15] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2022-05-20 09:52:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2022-05-20 09:52:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 09:52:15] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 7/8 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s6 1)), p1:(OR (LT s0 1) (LT s2 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 382 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-00 finished in 935 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)&&F(p1))) U (G(p2)||p0)))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 09:52:16] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 09:52:16] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 09:52:16] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-20 09:52:16] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2022-05-20 09:52:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 09:52:16] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-20 09:52:16] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 306 ms :[(AND (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2), acceptance={} source=2 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s5 1)), p2:(OR (GEQ s7 1) (AND (GEQ s4 1) (GEQ s5 1))), p1:(AND (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 4420 reset in 165 ms.
Stack based approach found an accepted trace after 23 steps with 1 reset with depth 7 and stack size 7 in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-01 finished in 631 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U !F(G(F((X(p0)&&F(p1)))))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2022-05-20 09:52:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 09:52:17] [INFO ] Implicit Places using invariants in 31 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 7
Applied a total of 1 rules in 2 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 09:52:17] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-20 09:52:17] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 09:52:17] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 09:52:17] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/9 places, 7/8 transitions.
Finished structural reductions, in 2 iterations. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND p1 p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s5 1)), p0:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 192 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-02 finished in 384 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 09:52:17] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 09:52:17] [INFO ] Implicit Places using invariants in 36 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 6/9 places, 7/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 6 /6 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 6/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-03 finished in 216 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U p1)||G(X(X(p2)))||F(p1)))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Applied a total of 2 rules in 4 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 09:52:17] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 09:52:17] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 09:52:17] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 09:52:17] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2022-05-20 09:52:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 09:52:17] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 09:52:17] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (AND (GEQ s4 1) (GEQ s5 1)) (AND (GEQ s3 1) (GEQ s5 1))), p1:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 40 reset in 124 ms.
Stack based approach found an accepted trace after 16 steps with 1 reset with depth 4 and stack size 4 in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-04 finished in 394 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U !p0)&&(F(p0) U !p1))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 0 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 09:52:18] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 09:52:18] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 09:52:18] [INFO ] Computed 3 place invariants in 11 ms
[2022-05-20 09:52:18] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 09:52:18] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 09:52:18] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8/9 places, 8/8 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR p0 p1), (OR p0 p1), true, (NOT p0), p1]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s7 1), p1:(AND (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-05 finished in 390 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)&&X(p1)) U X(!p1)))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 09:52:18] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 09:52:18] [INFO ] Implicit Places using invariants in 29 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 8/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 184 ms :[p1, p1, p1, true, (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s7 1), p1:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Product exploration explored 100000 steps with 50000 reset in 116 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1)))
Knowledge based reduction with 7 factoid took 205 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-06 finished in 653 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(X((!p0 U p0))))&&F((p0 U X(p1))))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2022-05-20 09:52:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 09:52:19] [INFO ] Implicit Places using invariants in 44 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s5 1)), p1:(LT s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7786 reset in 129 ms.
Stack based approach found an accepted trace after 12 steps with 1 reset with depth 5 and stack size 5 in 1 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-09 finished in 455 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(p1 U !p0)||X(X(!p0))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2022-05-20 09:52:19] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 09:52:19] [INFO ] Implicit Places using invariants in 32 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 266 ms :[false, false, false, false, (NOT p0), (NOT p0), false]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 6}], [{ cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LT s6 1), p1:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10 reset in 170 ms.
Stack based approach found an accepted trace after 21 steps with 1 reset with depth 12 and stack size 12 in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-10 finished in 499 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((G(X(G(X(p0))))||X(p1)))))'
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 0 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2022-05-20 09:52:20] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 09:52:20] [INFO ] Implicit Places using invariants in 28 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/9 places, 7/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (LT s0 1) (LT s2 1) (LT s5 1) (LT s0 1) (LT s1 1) (LT s2 1)), p1:(LT s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-11 finished in 262 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 09:52:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 09:52:20] [INFO ] Implicit Places using invariants in 63 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 6/9 places, 7/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 6/9 places, 7/8 transitions.
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-12 automaton TGBA Formula[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:(LT s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-12 finished in 290 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(p0) U !X((X(p1)||p2))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 0 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 09:52:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 09:52:20] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 09:52:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 09:52:20] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 8 cols
[2022-05-20 09:52:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 09:52:20] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8/9 places, 8/8 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 306 ms :[(OR p2 p1), (OR p2 p1), (OR p2 p1), true, p1, p0, p1]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}], [{ cond=p0, acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) p2 p1), acceptance={0} source=6 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s2 1), p2:(AND (GEQ s3 1) (GEQ s5 1)), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-13 finished in 465 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0)||p1))||(p2 U p3)))'
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 09:52:21] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 09:52:21] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 09:52:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 09:52:21] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2022-05-20 09:52:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 09:52:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 09:52:21] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 256 ms :[true, (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p3)]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p0:(LT s8 1), p3:(GEQ s4 1), p2:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1)), p1:(AND (GEQ s4 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 24998 reset in 118 ms.
Product exploration explored 100000 steps with 25026 reset in 125 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) p2 (NOT p1)), (X (NOT (AND p1 (NOT p3) p2))), (X (AND (NOT p0) (NOT p3) p2)), (X (AND (NOT p3) p2)), (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p3) p2)), (X (NOT p0)), (X (NOT (AND (NOT p1) p0 (NOT p3) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), true, (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p3) p2))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0) (NOT p3) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 28 factoid took 1850 ms. Reduced automaton from 6 states, 18 edges and 4 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 359 ms :[true, (NOT p3), (NOT p3), (NOT p3)]
Finished random walk after 33 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p0 (NOT p3) p2 (NOT p1)), (X (NOT (AND p1 (NOT p3) p2))), (X (AND (NOT p0) (NOT p3) p2)), (X (AND (NOT p3) p2)), (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p3) p2)), (X (NOT p0)), (X (NOT (AND (NOT p1) p0 (NOT p3) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), true, (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p3) p2))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0) (NOT p3) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X p1)), (X (X (NOT p1))), (F (AND (NOT p2) (NOT p3))), (F (NOT p0)), (F (NOT (AND p2 (NOT p3))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 28 factoid took 1795 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p3), (NOT p3), (NOT p3)]
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 09:52:26] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 09:52:26] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-20 09:52:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 09:52:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-20 09:52:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 09:52:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-20 09:52:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 09:52:26] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-20 09:52:26] [INFO ] Computed and/alt/rep : 7/10/7 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-20 09:52:26] [INFO ] Added : 6 causal constraints over 2 iterations in 21 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 5 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 09:52:26] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 09:52:26] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 09:52:26] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 09:52:26] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 09:52:26] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 09:52:26] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p3) p0), (X (NOT p0)), true, (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 352 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 120 ms :[(NOT p3), (NOT p3), true, (NOT p3)]
Finished random walk after 33 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND p2 (NOT p3) p0), (X (NOT p0)), true, (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND p2 (NOT p3)))), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 4 factoid took 292 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[(NOT p3), (NOT p3), true, (NOT p3)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p3), (NOT p3), true, (NOT p3)]
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 09:52:27] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 09:52:27] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-20 09:52:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 09:52:27] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-20 09:52:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 09:52:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-20 09:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 09:52:27] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-20 09:52:27] [INFO ] Computed and/alt/rep : 7/10/7 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-20 09:52:27] [INFO ] Added : 6 causal constraints over 2 iterations in 14 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 120 ms :[(NOT p3), (NOT p3), true, (NOT p3)]
Product exploration explored 100000 steps with 25046 reset in 322 ms.
Product exploration explored 100000 steps with 25039 reset in 110 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 134 ms :[(NOT p3), (NOT p3), true, (NOT p3)]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 8 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 4 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
[2022-05-20 09:52:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2022-05-20 09:52:28] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 09:52:28] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 7/8 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 7/8 transitions.
Product exploration explored 100000 steps with 24963 reset in 224 ms.
Product exploration explored 100000 steps with 24984 reset in 187 ms.
Built C files in :
/tmp/ltsmin13870104492937581775
[2022-05-20 09:52:29] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13870104492937581775
Running compilation step : cd /tmp/ltsmin13870104492937581775;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 264 ms.
Running link step : cd /tmp/ltsmin13870104492937581775;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin13870104492937581775;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12190218033907214295.hoa' '--buchi-type=spotba'
LTSmin run took 92 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-14 finished in 8301 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(G(F(p1))||(X(!p1)&&p2))))))'
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 09:52:29] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 09:52:29] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 09:52:29] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 09:52:29] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-20 09:52:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2022-05-20 09:52:29] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 09:52:29] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 8/8 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2 p0), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s3 1), p1:(OR (LT s0 1) (LT s1 1) (LT s2 1)), p2:(OR (LT s4 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 90 reset in 135 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 15 in 0 ms.
FORMULA SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property SmallOperatingSystem-PT-MT0064DC0032-LTLFireability-15 finished in 327 ms.
All properties solved by simple procedures.
Total runtime 15955 ms.

BK_STOP 1653040350001

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="SmallOperatingSystem-PT-MT0064DC0032"
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 SmallOperatingSystem-PT-MT0064DC0032, 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 r240-smll-165303241300076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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