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.r258-tall-165303545700436.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 SwimmingPool-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545700436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 6.8K Apr 29 12:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 12:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 29 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 29 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 09:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 09:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 09:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 3.9K 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 SwimmingPool-PT-10-LTLFireability-00
FORMULA_NAME SwimmingPool-PT-10-LTLFireability-01
FORMULA_NAME SwimmingPool-PT-10-LTLFireability-02
FORMULA_NAME SwimmingPool-PT-10-LTLFireability-03
FORMULA_NAME SwimmingPool-PT-10-LTLFireability-04
FORMULA_NAME SwimmingPool-PT-10-LTLFireability-05
FORMULA_NAME SwimmingPool-PT-10-LTLFireability-06
FORMULA_NAME SwimmingPool-PT-10-LTLFireability-07
FORMULA_NAME SwimmingPool-PT-10-LTLFireability-08
FORMULA_NAME SwimmingPool-PT-10-LTLFireability-09
FORMULA_NAME SwimmingPool-PT-10-LTLFireability-10
FORMULA_NAME SwimmingPool-PT-10-LTLFireability-11
FORMULA_NAME SwimmingPool-PT-10-LTLFireability-12
FORMULA_NAME SwimmingPool-PT-10-LTLFireability-13
FORMULA_NAME SwimmingPool-PT-10-LTLFireability-14
FORMULA_NAME SwimmingPool-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653135311749

Running Version 202205111006
[2022-05-21 12:15:12] [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-21 12:15:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 12:15:13] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2022-05-21 12:15:13] [INFO ] Transformed 9 places.
[2022-05-21 12:15:13] [INFO ] Transformed 7 transitions.
[2022-05-21 12:15:13] [INFO ] Parsed PT model containing 9 places and 7 transitions in 131 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA SwimmingPool-PT-10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:13] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-21 12:15:13] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:13] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 12:15:13] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:15:13] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Support contains 8 out of 9 places after structural reductions.
[2022-05-21 12:15:13] [INFO ] Flatten gal took : 14 ms
[2022-05-21 12:15:13] [INFO ] Flatten gal took : 3 ms
[2022-05-21 12:15:13] [INFO ] Input system was already deterministic with 7 transitions.
Incomplete random walk after 10080 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=296 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:15:13] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
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' '!(G((X(p0)&&(X(p1)||p2))))'
Support contains 5 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:14] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:15:14] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:14] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:15:14] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:14] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:14] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 278 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SwimmingPool-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (GEQ s1 1) (GEQ s8 1)), p0:(OR (LT s1 1) (LT s8 1) (LT s5 1)), p1:(AND (GEQ s0 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SwimmingPool-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-10-LTLFireability-00 finished in 416 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||p1)))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:14] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:15:14] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:14] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:14] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:14] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:14] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s5 1), p0:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 0 ms.
FORMULA SwimmingPool-PT-10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-10-LTLFireability-01 finished in 193 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U (F(!(G(p1)&&p2))||(p1 U X(p0)))))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:14] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:14] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:14] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:15:14] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:14] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 12:15:14] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2 (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (GEQ s0 1) (GEQ s7 1)), p2:(GEQ s5 1), p0:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 166 ms.
Product exploration explored 100000 steps with 33333 reset in 100 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 p1) (NOT p2) (NOT p0)), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p1 p2))))
Knowledge based reduction with 2 factoid took 49 ms. Reduced automaton from 4 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA SwimmingPool-PT-10-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-10-LTLFireability-02 finished in 562 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||p1))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:15] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:15] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:15] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:15] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:15] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:15:15] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s8 1)), p0:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24947 reset in 74 ms.
Product exploration explored 100000 steps with 24980 reset in 170 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 p1) (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 202 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=101 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:16] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:15:16] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 12:15:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 12:15:16] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-21 12:15:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 12:15:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 12:15:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 12:15:16] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-21 12:15:16] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-21 12:15:16] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:16] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-21 12:15:16] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:16] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:15:16] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:16] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:16] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 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 (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 202 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=202 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:16] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:15:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-21 12:15:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 12:15:16] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-21 12:15:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 12:15:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 12:15:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 12:15:17] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-21 12:15:17] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 12:15:17] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25027 reset in 59 ms.
Product exploration explored 100000 steps with 25071 reset in 80 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 4 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2022-05-21 12:15:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:17] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 12:15:17] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/9 places, 7/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 28514 reset in 120 ms.
Product exploration explored 100000 steps with 28552 reset in 105 ms.
Built C files in :
/tmp/ltsmin12513599875831391676
[2022-05-21 12:15:17] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12513599875831391676
Running compilation step : cd /tmp/ltsmin12513599875831391676;'/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 150 ms.
Running link step : cd /tmp/ltsmin12513599875831391676;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12513599875831391676;'/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/stateBased3774876962420134536.hoa' '--buchi-type=spotba'
LTSmin run took 1771 ms.
FORMULA SwimmingPool-PT-10-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-10-LTLFireability-03 finished in 4522 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G((p0 U !p1))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:19] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:19] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:19] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:15:19] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:19] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:19] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 227 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (NOT p0), true, (AND p1 (NOT p0)), p1, p1]
Running random walk in product with property : SwimmingPool-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(OR (NOT p1) p0), acceptance={} source=6 dest: 6}, { cond=(AND p1 p0), acceptance={} source=6 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=7 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s8 1)), p0:(GEQ s2 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, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-10-LTLFireability-04 finished in 327 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(p0 U p1)&&X(F(!p1)))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:20] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:15:20] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:20] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, p1, p1, p1, p1]
Running random walk in product with property : SwimmingPool-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s0 1) (GEQ s7 1)), p0:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 SwimmingPool-PT-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-10-LTLFireability-05 finished in 237 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(F(X(F((F(p0) U p0)))))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:20] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:20] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:20] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 42 ms.
Product exploration explored 100000 steps with 50000 reset in 49 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 : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA SwimmingPool-PT-10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-10-LTLFireability-06 finished in 405 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!(G(p0) U p1))) U X(p1)))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:20] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:15:20] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:15:20] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), p1, (AND p1 p0), p1]
Running random walk in product with property : SwimmingPool-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s5 1), p0:(AND (GEQ s1 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 420 reset in 91 ms.
Stack based approach found an accepted trace after 129 steps with 2 reset with depth 60 and stack size 60 in 0 ms.
FORMULA SwimmingPool-PT-10-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-10-LTLFireability-07 finished in 325 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!((X(p0) U F(p0)) U (F(X(p0))||X(p1)))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:21] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:21] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:15:21] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:15:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:21] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR p1 p0), p0, (OR p1 p0)]
Running random walk in product with property : SwimmingPool-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=true, acceptance={0, 1} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={1} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 1}, { cond=(OR p0 p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s5 1), p1:(GEQ s4 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 75 ms.
Stack based approach found an accepted trace after 107 steps with 0 reset with depth 108 and stack size 108 in 0 ms.
FORMULA SwimmingPool-PT-10-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-10-LTLFireability-08 finished in 270 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p0)||X(p0)) U G(p0)))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 5 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 12:15:21] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:15:21] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 12:15:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:21] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2022-05-21 12:15:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 12:15:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:21] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s5 1))], nbAcceptance=1, 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 62 ms.
Stack based approach found an accepted trace after 5874 steps with 0 reset with depth 5875 and stack size 5483 in 10 ms.
FORMULA SwimmingPool-PT-10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-10-LTLFireability-09 finished in 196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(F(p0))) U (G((p1 U (p2 U p0)))||p2)))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 12:15:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:21] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 12:15:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:21] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-21 12:15:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 12:15:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:21] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SwimmingPool-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s2 1), p0:(GEQ s3 1), p1:(AND (GEQ s0 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 10013 reset in 63 ms.
Product exploration explored 100000 steps with 9965 reset in 70 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 p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
Knowledge based reduction with 12 factoid took 587 ms. Reduced automaton from 6 states, 17 edges and 3 AP to 6 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 304 steps, including 0 resets, run visited all 9 properties in 3 ms. (steps per millisecond=101 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (F (AND p1 (NOT p0) (NOT p2))), (F p2), (F (AND p1 (NOT p0))), (F p0), (F (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) p2))]
Knowledge based reduction with 12 factoid took 712 ms. Reduced automaton from 6 states, 17 edges and 3 AP to 6 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 12:15:23] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 12:15:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 12:15:23] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-21 12:15:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 12:15:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 12:15:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 12:15:24] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-21 12:15:24] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 12:15:24] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 12:15:24] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:15:24] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 12:15:24] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:24] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2022-05-21 12:15:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 12:15:24] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:24] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 5/5 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 (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT p0)), (X (AND p1 (NOT p0) (NOT p2))), (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))), true, (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))))]
Knowledge based reduction with 12 factoid took 622 ms. Reduced automaton from 6 states, 17 edges and 3 AP to 6 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 406 steps, including 0 resets, run visited all 9 properties in 2 ms. (steps per millisecond=203 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT p0)), (X (AND p1 (NOT p0) (NOT p2))), (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))), true, (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (F (AND (NOT p0) p1 (NOT p2))), (F p2), (F (AND (NOT p0) p1)), (F p0), (F (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 12 factoid took 988 ms. Reduced automaton from 6 states, 17 edges and 3 AP to 6 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 12:15:26] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:15:26] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 12:15:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 12:15:26] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-21 12:15:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 12:15:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 12:15:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 12:15:26] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-21 12:15:26] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 12:15:26] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 9964 reset in 68 ms.
Product exploration explored 100000 steps with 10094 reset in 67 ms.
Built C files in :
/tmp/ltsmin4285824067263060233
[2022-05-21 12:15:26] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-21 12:15:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 12:15:26] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-21 12:15:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 12:15:26] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-21 12:15:26] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 12:15:26] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4285824067263060233
Running compilation step : cd /tmp/ltsmin4285824067263060233;'/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 75 ms.
Running link step : cd /tmp/ltsmin4285824067263060233;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin4285824067263060233;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17140155376369248844.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 3 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 12:15:41] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:15:41] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 12:15:41] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:15:41] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-21 12:15:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 12:15:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:15:41] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 5/5 transitions.
Built C files in :
/tmp/ltsmin15169863229326785957
[2022-05-21 12:15:41] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-21 12:15:41] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 12:15:41] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-21 12:15:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 12:15:41] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-21 12:15:41] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 12:15:41] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15169863229326785957
Running compilation step : cd /tmp/ltsmin15169863229326785957;'/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 73 ms.
Running link step : cd /tmp/ltsmin15169863229326785957;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15169863229326785957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11346187651395927043.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 12:15:57] [INFO ] Flatten gal took : 1 ms
[2022-05-21 12:15:57] [INFO ] Flatten gal took : 1 ms
[2022-05-21 12:15:57] [INFO ] Time to serialize gal into /tmp/LTL2523339940469036504.gal : 1 ms
[2022-05-21 12:15:57] [INFO ] Time to serialize properties into /tmp/LTL1598056665622299696.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2523339940469036504.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1598056665622299696.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2523339...266
Read 1 LTL properties
Checking formula 0 : !(((X(G(F("(Dressed>=1)"))))U((G(("((WaitBag>=1)&&(Bags>=1))")U(("(Dress>=1)")U("(Dressed>=1)"))))||("(Dress>=1)"))))
Formula 0 simplified : !(XGF"(Dressed>=1)" U ("(Dress>=1)" | G("((WaitBag>=1)&&(Bags>=1))" U ("(Dress>=1)" U "(Dressed>=1)"))))
Detected timeout of ITS tools.
[2022-05-21 12:16:12] [INFO ] Flatten gal took : 1 ms
[2022-05-21 12:16:12] [INFO ] Applying decomposition
[2022-05-21 12:16:12] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2125754226673326043.txt' '-o' '/tmp/graph2125754226673326043.bin' '-w' '/tmp/graph2125754226673326043.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2125754226673326043.bin' '-l' '-1' '-v' '-w' '/tmp/graph2125754226673326043.weights' '-q' '0' '-e' '0.001'
[2022-05-21 12:16:12] [INFO ] Decomposing Gal with order
[2022-05-21 12:16:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 12:16:12] [INFO ] Flatten gal took : 23 ms
[2022-05-21 12:16:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-21 12:16:12] [INFO ] Time to serialize gal into /tmp/LTL11977134577535331343.gal : 0 ms
[2022-05-21 12:16:12] [INFO ] Time to serialize properties into /tmp/LTL7885312746719073953.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11977134577535331343.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7885312746719073953.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1197713...246
Read 1 LTL properties
Checking formula 0 : !(((X(G(F("(u0.Dressed>=1)"))))U((G(("((u0.WaitBag>=1)&&(u1.Bags>=1))")U(("(u1.Dress>=1)")U("(u0.Dressed>=1)"))))||("(u1.Dress>=1)")))...156
Formula 0 simplified : !(XGF"(u0.Dressed>=1)" U ("(u1.Dress>=1)" | G("((u0.WaitBag>=1)&&(u1.Bags>=1))" U ("(u1.Dress>=1)" U "(u0.Dressed>=1)"))))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8652606207755834734
[2022-05-21 12:16:27] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8652606207755834734
Running compilation step : cd /tmp/ltsmin8652606207755834734;'/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 68 ms.
Running link step : cd /tmp/ltsmin8652606207755834734;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8652606207755834734;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X([](<>((LTLAPp0==true)))) U ([](((LTLAPp1==true) U ((LTLAPp2==true) U (LTLAPp0==true))))||(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SwimmingPool-PT-10-LTLFireability-10 finished in 80852 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)) U p2))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 4 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 12:16:42] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:16:42] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 12:16:42] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:16:42] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-21 12:16:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 12:16:42] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:16:42] [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, 6/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p2), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(GEQ s1 1), p0:(GEQ s4 1), p1:(GEQ s3 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11315 reset in 149 ms.
Product exploration explored 100000 steps with 11314 reset in 185 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 p2) (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 236 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p2), (NOT p1)]
Finished random walk after 304 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=152 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (F p2), (F p1), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 280 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 73 ms :[(NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p2), (NOT p1)]
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 12:16:43] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:16:43] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 12:16:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 12:16:43] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-21 12:16:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 12:16:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 12:16:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 12:16:43] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-21 12:16:43] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-21 12:16:43] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 12:16:43] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:16:43] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 12:16:43] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:16:43] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-21 12:16:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 12:16:43] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:16:43] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 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 (NOT p2) (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p2), (NOT p1)]
Finished random walk after 507 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=507 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (F p2), (F p1), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 327 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 3 edges and 3 AP.
Stuttering acceptance computed with spot in 51 ms :[(NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p2), (NOT p1)]
// Phase 1: matrix 6 rows 8 cols
[2022-05-21 12:16:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:16:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 12:16:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 12:16:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-21 12:16:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 12:16:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 12:16:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 12:16:44] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-21 12:16:44] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-21 12:16:44] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 59 ms :[(NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 11293 reset in 52 ms.
Product exploration explored 100000 steps with 11280 reset in 62 ms.
Built C files in :
/tmp/ltsmin6460416115648248588
[2022-05-21 12:16:44] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-21 12:16:44] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 12:16:44] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-21 12:16:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 12:16:44] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-21 12:16:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 12:16:44] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6460416115648248588
Running compilation step : cd /tmp/ltsmin6460416115648248588;'/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 66 ms.
Running link step : cd /tmp/ltsmin6460416115648248588;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin6460416115648248588;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7434949476096036778.hoa' '--buchi-type=spotba'
LTSmin run took 3883 ms.
FORMULA SwimmingPool-PT-10-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-10-LTLFireability-12 finished in 6480 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(((p0 U G(p1))||p0)))&&(F(p0) U p2)))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:16:48] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:16:48] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:16:48] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:16:48] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:16:48] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:16:48] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s4 1), p0:(AND (GEQ s1 1) (GEQ s8 1)), p1:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-10-LTLFireability-13 finished in 313 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&(F(!p0)||p1))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 9 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 12:16:49] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:16:49] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 12:16:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:16:49] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-21 12:16:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-21 12:16:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:16:49] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s2 1), p1:(AND (GEQ s1 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 61 reset in 66 ms.
Stack based approach found an accepted trace after 35 steps with 2 reset with depth 19 and stack size 19 in 0 ms.
FORMULA SwimmingPool-PT-10-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-10-LTLFireability-14 finished in 271 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(p0)))||X(G(p1))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:16:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:16:49] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:16:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 12:16:49] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2022-05-21 12:16:49] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 12:16:49] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-10-LTLFireability-15 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=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(AND (GEQ s2 1) (GEQ s0 1) (GEQ s7 1)), p1:(LT s2 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-10-LTLFireability-15 finished in 279 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(F(p0))) U (G((p1 U (p2 U p0)))||p2)))'
[2022-05-21 12:16:49] [INFO ] Flatten gal took : 1 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15239585572890203355
[2022-05-21 12:16:49] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2022-05-21 12:16:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 12:16:49] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2022-05-21 12:16:49] [INFO ] Applying decomposition
[2022-05-21 12:16:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 12:16:49] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2022-05-21 12:16:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 12:16:49] [INFO ] Flatten gal took : 2 ms
[2022-05-21 12:16:49] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15239585572890203355
Running compilation step : cd /tmp/ltsmin15239585572890203355;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15712297155030288503.txt' '-o' '/tmp/graph15712297155030288503.bin' '-w' '/tmp/graph15712297155030288503.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15712297155030288503.bin' '-l' '-1' '-v' '-w' '/tmp/graph15712297155030288503.weights' '-q' '0' '-e' '0.001'
[2022-05-21 12:16:49] [INFO ] Decomposing Gal with order
[2022-05-21 12:16:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 12:16:49] [INFO ] Flatten gal took : 2 ms
[2022-05-21 12:16:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-21 12:16:49] [INFO ] Time to serialize gal into /tmp/LTLFireability16494651416142675285.gal : 0 ms
[2022-05-21 12:16:49] [INFO ] Time to serialize properties into /tmp/LTLFireability2661650367465459958.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16494651416142675285.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2661650367465459958.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !(((X(G(F("(u0.Dressed>=1)"))))U((G(("((u2.WaitBag>=1)&&(u1.Bags>=1))")U(("(u1.Dress>=1)")U("(u0.Dressed>=1)"))))||("(u1.Dress>=1)")))...156
Formula 0 simplified : !(XGF"(u0.Dressed>=1)" U ("(u1.Dress>=1)" | G("((u2.WaitBag>=1)&&(u1.Bags>=1))" U ("(u1.Dress>=1)" U "(u0.Dressed>=1)"))))
Compilation finished in 83 ms.
Running link step : cd /tmp/ltsmin15239585572890203355;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15239585572890203355;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X([](<>((LTLAPp0==true)))) U ([](((LTLAPp1==true) U ((LTLAPp2==true) U (LTLAPp0==true))))||(LTLAPp2==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: LTL layer: formula: (X([](<>((LTLAPp0==true)))) U ([](((LTLAPp1==true) U ((LTLAPp2==true) U (LTLAPp0==true))))||(LTLAPp2==true)))
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: "(X([](<>((LTLAPp0==true)))) U ([](((LTLAPp1==true) U ((LTLAPp2==true) U (LTLAPp0==true))))||(LTLAPp2==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: There are 11 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.021: State length is 10, there are 29 groups
pins2lts-mc-linux64( 0/ 8), 0.021: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.021: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.021: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.021: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.051: [Blue] ~87 levels ~960 states ~2792 transitions
pins2lts-mc-linux64( 0/ 8), 0.072: [Blue] ~151 levels ~1920 states ~5168 transitions
pins2lts-mc-linux64( 0/ 8), 0.122: [Blue] ~305 levels ~3840 states ~11360 transitions
pins2lts-mc-linux64( 4/ 8), 0.172: [Blue] ~628 levels ~7680 states ~20176 transitions
pins2lts-mc-linux64( 1/ 8), 0.204: [Blue] ~752 levels ~15360 states ~32456 transitions
pins2lts-mc-linux64( 1/ 8), 0.278: [Blue] ~752 levels ~30720 states ~65688 transitions
pins2lts-mc-linux64( 1/ 8), 0.427: [Blue] ~752 levels ~61440 states ~135368 transitions
pins2lts-mc-linux64( 4/ 8), 0.662: [Blue] ~759 levels ~122880 states ~295344 transitions
pins2lts-mc-linux64( 4/ 8), 1.034: [Blue] ~759 levels ~245760 states ~598808 transitions
pins2lts-mc-linux64( 4/ 8), 1.528: [Blue] ~759 levels ~491520 states ~1221992 transitions
pins2lts-mc-linux64( 6/ 8), 2.190: [Blue] ~752 levels ~983040 states ~1927832 transitions
pins2lts-mc-linux64( 6/ 8), 2.852: [Blue] ~752 levels ~1966080 states ~3871192 transitions
pins2lts-mc-linux64( 6/ 8), 4.176: [Blue] ~752 levels ~3932160 states ~8682496 transitions
pins2lts-mc-linux64( 6/ 8), 6.672: [Blue] ~752 levels ~7864320 states ~18316664 transitions
pins2lts-mc-linux64( 6/ 8), 12.133: [Blue] ~752 levels ~15728640 states ~37597464 transitions
pins2lts-mc-linux64( 6/ 8), 22.600: [Blue] ~752 levels ~31457280 states ~76215104 transitions
pins2lts-mc-linux64( 6/ 8), 44.747: [Blue] ~752 levels ~62914560 states ~157379008 transitions
pins2lts-mc-linux64( 6/ 8), 96.521: [Blue] ~752 levels ~125829120 states ~350022256 transitions
pins2lts-mc-linux64( 1/ 8), 150.135: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 150.166:
pins2lts-mc-linux64( 0/ 8), 150.166: Explored 156977691 states 456900909 transitions, fanout: 2.911
pins2lts-mc-linux64( 0/ 8), 150.166: Total exploration time 150.130 sec (150.080 sec minimum, 150.104 sec on average)
pins2lts-mc-linux64( 0/ 8), 150.166: States per second: 1045612, Transitions per second: 3043368
pins2lts-mc-linux64( 0/ 8), 150.166:
pins2lts-mc-linux64( 0/ 8), 150.166: State space has 134217349 states, 93583404 are accepting
pins2lts-mc-linux64( 0/ 8), 150.166: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 150.166: blue states: 156977691 (116.96%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 150.166: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 150.166: all-red states: 93583404 (69.73%), bogus 12927966 (9.63%)
pins2lts-mc-linux64( 0/ 8), 150.167:
pins2lts-mc-linux64( 0/ 8), 150.167: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 150.167:
pins2lts-mc-linux64( 0/ 8), 150.167: Queue width: 8B, total height: 6023, memory: 0.05MB
pins2lts-mc-linux64( 0/ 8), 150.167: Tree memory: 1198.0MB, 9.4 B/state, compr.: 22.3%
pins2lts-mc-linux64( 0/ 8), 150.167: Tree fill ratio (roots/leafs): 99.0%/67.0%
pins2lts-mc-linux64( 0/ 8), 150.167: Stored 7 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 150.167: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 150.167: Est. total memory use: 1198.1MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15239585572890203355;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X([](<>((LTLAPp0==true)))) U ([](((LTLAPp1==true) U ((LTLAPp2==true) U (LTLAPp0==true))))||(LTLAPp2==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15239585572890203355;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X([](<>((LTLAPp0==true)))) U ([](((LTLAPp1==true) U ((LTLAPp2==true) U (LTLAPp0==true))))||(LTLAPp2==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-21 12:37:22] [INFO ] Flatten gal took : 5 ms
[2022-05-21 12:37:22] [INFO ] Time to serialize gal into /tmp/LTLFireability14411354569849608453.gal : 0 ms
[2022-05-21 12:37:22] [INFO ] Time to serialize properties into /tmp/LTLFireability12399671798345430143.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14411354569849608453.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12399671798345430143.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...290
Read 1 LTL properties
Checking formula 0 : !(((X(G(F("(Dressed>=1)"))))U((G(("((WaitBag>=1)&&(Bags>=1))")U(("(Dress>=1)")U("(Dressed>=1)"))))||("(Dress>=1)"))))
Formula 0 simplified : !(XGF"(Dressed>=1)" U ("(Dress>=1)" | G("((WaitBag>=1)&&(Bags>=1))" U ("(Dress>=1)" U "(Dressed>=1)"))))
Detected timeout of ITS tools.
[2022-05-21 12:57:54] [INFO ] Flatten gal took : 6 ms
[2022-05-21 12:57:54] [INFO ] Input system was already deterministic with 7 transitions.
[2022-05-21 12:57:54] [INFO ] Transformed 9 places.
[2022-05-21 12:57:54] [INFO ] Transformed 7 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-21 12:57:54] [INFO ] Time to serialize gal into /tmp/LTLFireability6210559916404003545.gal : 1 ms
[2022-05-21 12:57:54] [INFO ] Time to serialize properties into /tmp/LTLFireability12112817799601965543.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6210559916404003545.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12112817799601965543.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X(G(F("(Dressed>=1)"))))U((G(("((WaitBag>=1)&&(Bags>=1))")U(("(Dress>=1)")U("(Dressed>=1)"))))||("(Dress>=1)"))))
Formula 0 simplified : !(XGF"(Dressed>=1)" U ("(Dress>=1)" | G("((WaitBag>=1)&&(Bags>=1))" U ("(Dress>=1)" U "(Dressed>=1)"))))

BK_TIME_CONFINEMENT_REACHED

--------------------
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="SwimmingPool-PT-10"
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 SwimmingPool-PT-10, 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 r258-tall-165303545700436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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