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.r222-tall-165286024800188.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 ShieldIIPt-PT-001B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024800188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 7.3K Apr 29 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 29 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 17K 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 ShieldIIPt-PT-001B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-001B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652950000618

Running Version 202205111006
[2022-05-19 08:46:41] [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-19 08:46:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 08:46:41] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2022-05-19 08:46:41] [INFO ] Transformed 73 places.
[2022-05-19 08:46:41] [INFO ] Transformed 68 transitions.
[2022-05-19 08:46:41] [INFO ] Found NUPN structural information;
[2022-05-19 08:46:41] [INFO ] Parsed PT model containing 73 places and 68 transitions in 169 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldIIPt-PT-001B-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001B-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 69 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 69 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 68 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 68 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 67 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 67 transition count 62
Applied a total of 12 rules in 24 ms. Remains 67 /73 variables (removed 6) and now considering 62/68 (removed 6) transitions.
// Phase 1: matrix 62 rows 67 cols
[2022-05-19 08:46:42] [INFO ] Computed 10 place invariants in 5 ms
[2022-05-19 08:46:42] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 62 rows 67 cols
[2022-05-19 08:46:42] [INFO ] Computed 10 place invariants in 5 ms
[2022-05-19 08:46:42] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 67 cols
[2022-05-19 08:46:42] [INFO ] Computed 10 place invariants in 7 ms
[2022-05-19 08:46:42] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/73 places, 62/68 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/73 places, 62/68 transitions.
Support contains 30 out of 67 places after structural reductions.
[2022-05-19 08:46:42] [INFO ] Flatten gal took : 74 ms
[2022-05-19 08:46:42] [INFO ] Flatten gal took : 12 ms
[2022-05-19 08:46:42] [INFO ] Input system was already deterministic with 62 transitions.
Support contains 27 out of 67 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 24) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 62 rows 67 cols
[2022-05-19 08:46:42] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-19 08:46:43] [INFO ] [Real]Absence check using 10 positive place invariants in 20 ms returned sat
[2022-05-19 08:46:43] [INFO ] After 58ms 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 1 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 15 stabilizing places and 15 stable transitions
FORMULA ShieldIIPt-PT-001B-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((X(p0) U (G(p1)||F(p2)))))))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 62 transition count 57
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 62 transition count 57
Applied a total of 10 rules in 4 ms. Remains 62 /67 variables (removed 5) and now considering 57/62 (removed 5) transitions.
// Phase 1: matrix 57 rows 62 cols
[2022-05-19 08:46:43] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 08:46:43] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 57 rows 62 cols
[2022-05-19 08:46:43] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 08:46:43] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
// Phase 1: matrix 57 rows 62 cols
[2022-05-19 08:46:43] [INFO ] Computed 10 place invariants in 5 ms
[2022-05-19 08:46:43] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/67 places, 57/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/67 places, 57/62 transitions.
Stuttering acceptance computed with spot in 545 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s55 1), p2:(EQ s50 1), p0:(OR (EQ s55 1) (AND (EQ s1 1) (EQ s46 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4685 reset in 236 ms.
Product exploration explored 100000 steps with 4682 reset in 188 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 184 ms. Reduced automaton from 8 states, 16 edges and 3 AP to 8 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 57 rows 62 cols
[2022-05-19 08:46:45] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 08:46:45] [INFO ] After 26ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 5 factoid took 314 ms. Reduced automaton from 8 states, 16 edges and 3 AP to 6 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 248 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 245 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
// Phase 1: matrix 57 rows 62 cols
[2022-05-19 08:46:45] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-19 08:46:45] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2022-05-19 08:46:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:46:45] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-19 08:46:45] [INFO ] Computed and/alt/rep : 56/85/56 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 08:46:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 08:46:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-19 08:46:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 08:46:46] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-19 08:46:46] [INFO ] Computed and/alt/rep : 56/85/56 causal constraints (skipped 0 transitions) in 17 ms.
[2022-05-19 08:46:46] [INFO ] Added : 55 causal constraints over 11 iterations in 251 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
// Phase 1: matrix 57 rows 62 cols
[2022-05-19 08:46:46] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-19 08:46:46] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-19 08:46:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:46:46] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-19 08:46:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 08:46:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-19 08:46:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 08:46:46] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-19 08:46:46] [INFO ] Computed and/alt/rep : 56/85/56 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 08:46:46] [INFO ] Added : 50 causal constraints over 10 iterations in 65 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 57/57 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 57/57 (removed 0) transitions.
// Phase 1: matrix 57 rows 62 cols
[2022-05-19 08:46:46] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 08:46:46] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 57 rows 62 cols
[2022-05-19 08:46:46] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 08:46:46] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
// Phase 1: matrix 57 rows 62 cols
[2022-05-19 08:46:46] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 08:46:46] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 57/57 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), true, (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 210 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 6 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 221 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Finished random walk after 31 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), true, (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 4 factoid took 207 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 6 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 531 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 226 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
// Phase 1: matrix 57 rows 62 cols
[2022-05-19 08:46:48] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 08:46:48] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-19 08:46:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:46:48] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-19 08:46:48] [INFO ] Computed and/alt/rep : 56/85/56 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 08:46:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 08:46:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-19 08:46:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 08:46:48] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-19 08:46:48] [INFO ] Computed and/alt/rep : 56/85/56 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 08:46:48] [INFO ] Added : 55 causal constraints over 11 iterations in 61 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
// Phase 1: matrix 57 rows 62 cols
[2022-05-19 08:46:48] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 08:46:48] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-19 08:46:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:46:48] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-19 08:46:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 08:46:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-05-19 08:46:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 08:46:48] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-19 08:46:48] [INFO ] Computed and/alt/rep : 56/85/56 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-19 08:46:48] [INFO ] Added : 50 causal constraints over 10 iterations in 64 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 245 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Product exploration explored 100000 steps with 4691 reset in 96 ms.
Product exploration explored 100000 steps with 4688 reset in 227 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 272 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 57/57 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 62 transition count 57
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 9 place count 62 transition count 62
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 62 transition count 62
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 34 place count 62 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 62 transition count 61
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 42 place count 55 transition count 54
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 49 place count 55 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 55 transition count 54
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 53 transition count 52
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 53 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 53 transition count 58
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 50 transition count 52
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 50 transition count 52
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 62 rules in 26 ms. Remains 50 /62 variables (removed 12) and now considering 52/57 (removed 5) transitions.
[2022-05-19 08:46:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 52 rows 50 cols
[2022-05-19 08:46:49] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 08:46:49] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/62 places, 52/57 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/62 places, 52/57 transitions.
Product exploration explored 100000 steps with 12997 reset in 196 ms.
Product exploration explored 100000 steps with 13003 reset in 169 ms.
Built C files in :
/tmp/ltsmin9701047662766670492
[2022-05-19 08:46:50] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9701047662766670492
Running compilation step : cd /tmp/ltsmin9701047662766670492;'/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 232 ms.
Running link step : cd /tmp/ltsmin9701047662766670492;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9701047662766670492;'/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/stateBased8836703998188164197.hoa' '--buchi-type=spotba'
LTSmin run took 193 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-001B-LTLFireability-01 finished in 7273 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G(p0) U (G(F(X(p0)))||X(p1))))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 61 transition count 56
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 56
Applied a total of 12 rules in 6 ms. Remains 61 /67 variables (removed 6) and now considering 56/62 (removed 6) transitions.
// Phase 1: matrix 56 rows 61 cols
[2022-05-19 08:46:50] [INFO ] Computed 10 place invariants in 11 ms
[2022-05-19 08:46:50] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 56 rows 61 cols
[2022-05-19 08:46:50] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 08:46:50] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 61 cols
[2022-05-19 08:46:50] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-19 08:46:50] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/67 places, 56/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/67 places, 56/62 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s25 1), p0:(EQ s45 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 5 factoid took 126 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-001B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-001B-LTLFireability-02 finished in 578 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(p0))||G(p1)||p2)))'
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 60 transition count 55
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 60 transition count 55
Applied a total of 14 rules in 19 ms. Remains 60 /67 variables (removed 7) and now considering 55/62 (removed 7) transitions.
// Phase 1: matrix 55 rows 60 cols
[2022-05-19 08:46:51] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 08:46:51] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 55 rows 60 cols
[2022-05-19 08:46:51] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 08:46:51] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 60 cols
[2022-05-19 08:46:51] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 08:46:51] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/67 places, 55/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/67 places, 55/62 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(EQ s33 1), p1:(AND (EQ s15 1) (EQ s37 1)), p0:(AND (OR (EQ s3 0) (EQ s22 0)) (EQ s57 0))], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 29 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-LTLFireability-05 finished in 468 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||F(p1))))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 60 transition count 55
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 60 transition count 55
Applied a total of 14 rules in 7 ms. Remains 60 /67 variables (removed 7) and now considering 55/62 (removed 7) transitions.
// Phase 1: matrix 55 rows 60 cols
[2022-05-19 08:46:51] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-19 08:46:51] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 55 rows 60 cols
[2022-05-19 08:46:51] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-19 08:46:51] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 60 cols
[2022-05-19 08:46:51] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 08:46:51] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/67 places, 55/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/67 places, 55/62 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s35 1), p0:(EQ s48 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 75976 steps with 7518 reset in 90 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-LTLFireability-06 finished in 376 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(X(F(X(X(G(p0)))))))))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 66 transition count 47
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 52 transition count 47
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 28 place count 52 transition count 42
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 38 place count 47 transition count 42
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 44 transition count 39
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 44 transition count 39
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 44 place count 44 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 42 transition count 37
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 82 place count 25 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 25 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 24 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 89 place count 22 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 22 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 21 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 93 place count 19 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 93 place count 19 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 95 place count 18 transition count 17
Applied a total of 95 rules in 18 ms. Remains 18 /67 variables (removed 49) and now considering 17/62 (removed 45) transitions.
// Phase 1: matrix 17 rows 18 cols
[2022-05-19 08:46:52] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-19 08:46:52] [INFO ] Implicit Places using invariants in 31 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/67 places, 17/62 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 16 transition count 16
Applied a total of 2 rules in 2 ms. Remains 16 /17 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 16 cols
[2022-05-19 08:46:52] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-19 08:46:52] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2022-05-19 08:46:52] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-19 08:46:52] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/67 places, 16/62 transitions.
Finished structural reductions, in 2 iterations. Remains : 16/67 places, 16/62 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s9 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-LTLFireability-07 finished in 160 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0) U p1))||G(p2)))'
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 61 transition count 56
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 56
Applied a total of 12 rules in 6 ms. Remains 61 /67 variables (removed 6) and now considering 56/62 (removed 6) transitions.
// Phase 1: matrix 56 rows 61 cols
[2022-05-19 08:46:52] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 08:46:52] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 56 rows 61 cols
[2022-05-19 08:46:52] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 08:46:52] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 61 cols
[2022-05-19 08:46:52] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 08:46:52] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/67 places, 56/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/67 places, 56/62 transitions.
Stuttering acceptance computed with spot in 862 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s34 1), p1:(EQ s44 1), p0:(OR (EQ s25 1) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7399 reset in 105 ms.
Product exploration explored 100000 steps with 7406 reset in 108 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Detected a total of 14/61 stabilizing places and 14/56 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 824 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 17 factoid took 672 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
// Phase 1: matrix 56 rows 61 cols
[2022-05-19 08:46:55] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 08:46:55] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-19 08:46:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:46:55] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-19 08:46:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 08:46:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-19 08:46:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 08:46:55] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-19 08:46:55] [INFO ] Computed and/alt/rep : 55/83/55 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 08:46:55] [INFO ] Added : 44 causal constraints over 9 iterations in 53 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 56 rows 61 cols
[2022-05-19 08:46:55] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-19 08:46:55] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-19 08:46:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:46:55] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-19 08:46:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 08:46:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2022-05-19 08:46:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 08:46:55] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-19 08:46:55] [INFO ] Computed and/alt/rep : 55/83/55 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 08:46:55] [INFO ] Added : 54 causal constraints over 11 iterations in 63 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 61 cols
[2022-05-19 08:46:55] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 08:46:55] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 56 rows 61 cols
[2022-05-19 08:46:55] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 08:46:55] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 61 cols
[2022-05-19 08:46:55] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 08:46:55] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 56/56 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Detected a total of 14/61 stabilizing places and 14/56 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 295 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 362 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
// Phase 1: matrix 56 rows 61 cols
[2022-05-19 08:46:57] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 08:46:57] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-19 08:46:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:46:57] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-19 08:46:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 08:46:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-19 08:46:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 08:46:57] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-19 08:46:57] [INFO ] Computed and/alt/rep : 55/83/55 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 08:46:57] [INFO ] Added : 44 causal constraints over 9 iterations in 83 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 56 rows 61 cols
[2022-05-19 08:46:57] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 08:46:57] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-19 08:46:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:46:57] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-19 08:46:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 08:46:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2022-05-19 08:46:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 08:46:57] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-19 08:46:57] [INFO ] Computed and/alt/rep : 55/83/55 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 08:46:57] [INFO ] Added : 54 causal constraints over 11 iterations in 86 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 430 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 7183 reset in 87 ms.
Product exploration explored 100000 steps with 7223 reset in 104 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 56/56 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 61 transition count 56
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 10 place count 61 transition count 60
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 61 transition count 60
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 31 place count 61 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 61 transition count 58
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 40 place count 54 transition count 51
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 47 place count 54 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 54 transition count 51
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 52 transition count 49
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 52 transition count 49
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 52 transition count 63
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 49 transition count 57
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 49 transition count 57
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 61 rules in 18 ms. Remains 49 /61 variables (removed 12) and now considering 57/56 (removed -1) transitions.
[2022-05-19 08:46:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 57 rows 49 cols
[2022-05-19 08:46:58] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 08:46:58] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/61 places, 57/56 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/61 places, 57/56 transitions.
Product exploration explored 100000 steps with 18803 reset in 181 ms.
Product exploration explored 100000 steps with 18822 reset in 147 ms.
Built C files in :
/tmp/ltsmin8523570062137236626
[2022-05-19 08:46:58] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8523570062137236626
Running compilation step : cd /tmp/ltsmin8523570062137236626;'/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 127 ms.
Running link step : cd /tmp/ltsmin8523570062137236626;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin8523570062137236626;'/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/stateBased17899632428392427656.hoa' '--buchi-type=spotba'
LTSmin run took 214 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-001B-LTLFireability-08 finished in 7156 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1)&&G((G(p0)&&p2)))))'
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 62 transition count 57
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 62 transition count 57
Applied a total of 10 rules in 2 ms. Remains 62 /67 variables (removed 5) and now considering 57/62 (removed 5) transitions.
// Phase 1: matrix 57 rows 62 cols
[2022-05-19 08:46:59] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 08:46:59] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 57 rows 62 cols
[2022-05-19 08:46:59] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 08:46:59] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
// Phase 1: matrix 57 rows 62 cols
[2022-05-19 08:46:59] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 08:46:59] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/67 places, 57/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/67 places, 57/62 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1 p2), acceptance={0} source=3 dest: 0}, { cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s61 1), p2:(EQ s43 1), p1:(EQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-LTLFireability-09 finished in 288 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G((!p0 U p1))||F(p2)||X(p2))))'
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 67 transition count 50
Reduce places removed 12 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 15 rules applied. Total rules applied 27 place count 55 transition count 47
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 52 transition count 47
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 30 place count 52 transition count 42
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 40 place count 47 transition count 42
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 43 place count 44 transition count 39
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 44 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 46 place count 44 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 43 transition count 38
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 80 place count 27 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 27 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 85 place count 25 transition count 22
Applied a total of 85 rules in 8 ms. Remains 25 /67 variables (removed 42) and now considering 22/62 (removed 40) transitions.
// Phase 1: matrix 22 rows 25 cols
[2022-05-19 08:46:59] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 08:46:59] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 22 rows 25 cols
[2022-05-19 08:46:59] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 08:46:59] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-19 08:46:59] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2022-05-19 08:46:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 25 cols
[2022-05-19 08:46:59] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 08:46:59] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/67 places, 22/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/67 places, 22/62 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s18 1), p0:(NEQ s16 1), p2:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 101 ms.
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/25 stabilizing places and 4/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 588 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 14 steps, including 0 resets, run visited all 6 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F p2), (F (AND p0 (NOT p2) p1)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2) (NOT p1))))]
Knowledge based reduction with 14 factoid took 597 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
// Phase 1: matrix 22 rows 25 cols
[2022-05-19 08:47:01] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 08:47:01] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-19 08:47:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:47:01] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-19 08:47:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 08:47:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2022-05-19 08:47:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 08:47:01] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-19 08:47:01] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-19 08:47:01] [INFO ] [Nat]Added 7 Read/Feed constraints in 0 ms returned sat
[2022-05-19 08:47:01] [INFO ] Computed and/alt/rep : 21/73/21 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 08:47:01] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 25 cols
[2022-05-19 08:47:01] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 08:47:01] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 22 rows 25 cols
[2022-05-19 08:47:01] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 08:47:01] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-19 08:47:01] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2022-05-19 08:47:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 25 cols
[2022-05-19 08:47:01] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 08:47:01] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 22/22 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/25 stabilizing places and 4/22 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 514 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 14 steps, including 0 resets, run visited all 6 properties in 5 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F p2), (F (AND (NOT p2) p1 p0)), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p2) (NOT p1) p0)))]
Knowledge based reduction with 14 factoid took 884 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
// Phase 1: matrix 22 rows 25 cols
[2022-05-19 08:47:03] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 08:47:03] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-19 08:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:47:03] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-19 08:47:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 08:47:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-19 08:47:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 08:47:03] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-19 08:47:03] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-19 08:47:03] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2022-05-19 08:47:03] [INFO ] Computed and/alt/rep : 21/73/21 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-19 08:47:03] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 50000 reset in 88 ms.
Product exploration explored 100000 steps with 50000 reset in 88 ms.
Built C files in :
/tmp/ltsmin14936953402827127893
[2022-05-19 08:47:04] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2022-05-19 08:47:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 08:47:04] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2022-05-19 08:47:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 08:47:04] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2022-05-19 08:47:04] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 08:47:04] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14936953402827127893
Running compilation step : cd /tmp/ltsmin14936953402827127893;'/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 100 ms.
Running link step : cd /tmp/ltsmin14936953402827127893;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin14936953402827127893;'/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/stateBased3636840025664257552.hoa' '--buchi-type=spotba'
LTSmin run took 150 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-001B-LTLFireability-10 finished in 4913 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X((X(p0)&&p1)) U !p0))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 62/62 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 61 transition count 56
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 61 transition count 56
Applied a total of 12 rules in 2 ms. Remains 61 /67 variables (removed 6) and now considering 56/62 (removed 6) transitions.
// Phase 1: matrix 56 rows 61 cols
[2022-05-19 08:47:04] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 08:47:04] [INFO ] Implicit Places using invariants in 448 ms returned []
// Phase 1: matrix 56 rows 61 cols
[2022-05-19 08:47:04] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-19 08:47:05] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 61 cols
[2022-05-19 08:47:05] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-19 08:47:05] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/67 places, 56/62 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/67 places, 56/62 transitions.
Stuttering acceptance computed with spot in 99 ms :[p0, p0, p0, true]
Running random walk in product with property : ShieldIIPt-PT-001B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s48 1), p1:(EQ s36 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 59 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-001B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-LTLFireability-15 finished in 680 ms.
All properties solved by simple procedures.
Total runtime 23436 ms.

BK_STOP 1652950025336

--------------------
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="ShieldIIPt-PT-001B"
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 ShieldIIPt-PT-001B, 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 r222-tall-165286024800188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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