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.r078-tall-165260110600612.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 FMS-PT-50000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110600612
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 7.9K Apr 30 02:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 30 02:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 02:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 02:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 16K May 10 09:33 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 FMS-PT-50000-LTLFireability-00
FORMULA_NAME FMS-PT-50000-LTLFireability-01
FORMULA_NAME FMS-PT-50000-LTLFireability-02
FORMULA_NAME FMS-PT-50000-LTLFireability-03
FORMULA_NAME FMS-PT-50000-LTLFireability-04
FORMULA_NAME FMS-PT-50000-LTLFireability-05
FORMULA_NAME FMS-PT-50000-LTLFireability-06
FORMULA_NAME FMS-PT-50000-LTLFireability-07
FORMULA_NAME FMS-PT-50000-LTLFireability-08
FORMULA_NAME FMS-PT-50000-LTLFireability-09
FORMULA_NAME FMS-PT-50000-LTLFireability-10
FORMULA_NAME FMS-PT-50000-LTLFireability-11
FORMULA_NAME FMS-PT-50000-LTLFireability-12
FORMULA_NAME FMS-PT-50000-LTLFireability-13
FORMULA_NAME FMS-PT-50000-LTLFireability-14
FORMULA_NAME FMS-PT-50000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652697581746

Running Version 202205111006
[2022-05-16 10:39:42] [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-16 10:39:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 10:39:43] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2022-05-16 10:39:43] [INFO ] Transformed 22 places.
[2022-05-16 10:39:43] [INFO ] Transformed 20 transitions.
[2022-05-16 10:39:43] [INFO ] Parsed PT model containing 22 places and 20 transitions in 145 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA FMS-PT-50000-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:43] [INFO ] Computed 6 place invariants in 10 ms
[2022-05-16 10:39:43] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:43] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-16 10:39:43] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:43] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 10:39:43] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Support contains 18 out of 22 places after structural reductions.
[2022-05-16 10:39:43] [INFO ] Flatten gal took : 18 ms
[2022-05-16 10:39:43] [INFO ] Flatten gal took : 7 ms
[2022-05-16 10:39:43] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 50001 steps, including 0 resets, run finished after 47 ms. (steps per millisecond=1063 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 18) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:43] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 10:39:43] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 10:39:43] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-16 10:39:43] [INFO ] After 22ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-16 10:39:43] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 100000 steps, including 0 resets, run visited all 2 properties in 834 ms. (steps per millisecond=119 )
Parikh walk visited 2 properties in 836 ms.
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' '!(X(!(p0 U !F(!(F(p0)&&p1)))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:45] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:39:45] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:45] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:39:45] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:45] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:39:45] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 314 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : FMS-PT-50000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s21 1), p1:(GEQ s16 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 179 ms.
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA FMS-PT-50000-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FMS-PT-50000-LTLFireability-00 finished in 964 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0 U p1)&&(F(p2)||G(p3)||p0)))))'
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:45] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:39:45] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:45] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:39:46] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:46] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:39:46] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 421 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : FMS-PT-50000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2) p3), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2) p3), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s6 1), p0:(AND (GEQ s2 1) (GEQ s18 1)), p2:(AND (GEQ s6 1) (GEQ s10 1) (GEQ s17 1)), p3:(GEQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5768 reset in 195 ms.
Stack based approach found an accepted trace after 21 steps with 1 reset with depth 18 and stack size 18 in 1 ms.
FORMULA FMS-PT-50000-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-50000-LTLFireability-01 finished in 743 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((X(G(p0))||X(p1))))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 11 edges and 15 vertex of which 9 / 15 are part of one of the 3 SCC in 2 ms
Free SCC test removed 6 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 9 transition count 15
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 20 place count 8 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 8 transition count 8
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 22 place count 7 transition count 8
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 7 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 24 place count 7 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 29 place count 4 transition count 4
Applied a total of 29 rules in 19 ms. Remains 4 /22 variables (removed 18) and now considering 4/20 (removed 16) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 10:39:46] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 10:39:46] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 10:39:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 10:39:46] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-16 10:39:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 10:39:46] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 10:39:46] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/22 places, 4/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/22 places, 4/20 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-50000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1 1), p1:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-02 finished in 170 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F(p1))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 10 edges and 16 vertex of which 6 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 12 place count 12 transition count 15
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 18 place count 10 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 10 transition count 9
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 23 place count 7 transition count 9
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 25 place count 6 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 6 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 26 place count 6 transition count 6
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 28 place count 5 transition count 6
Applied a total of 28 rules in 13 ms. Remains 5 /22 variables (removed 17) and now considering 6/20 (removed 14) transitions.
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 10:39:46] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-16 10:39:46] [INFO ] Implicit Places using invariants in 20 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/22 places, 6/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4/22 places, 6/20 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FMS-PT-50000-LTLFireability-03 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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s2 1), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-03 finished in 147 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 9 edges and 13 vertex of which 6 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 18 place count 9 transition count 12
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 24 place count 7 transition count 8
Applied a total of 24 rules in 2 ms. Remains 7 /22 variables (removed 15) and now considering 8/20 (removed 12) transitions.
[2022-05-16 10:39:46] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 7 cols
[2022-05-16 10:39:47] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 10:39:47] [INFO ] Implicit Places using invariants in 25 ms returned []
[2022-05-16 10:39:47] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 7 cols
[2022-05-16 10:39:47] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 10:39:47] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2022-05-16 10:39:47] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-16 10:39:47] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 7 cols
[2022-05-16 10:39:47] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 10:39:47] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/22 places, 8/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/22 places, 8/20 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : FMS-PT-50000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (NOT (OR (GEQ s2 1) (GEQ s6 1))) (GEQ s2 1)), p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-04 finished in 169 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:47] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:39:47] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:47] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:39:47] [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 20 rows 22 cols
[2022-05-16 10:39:47] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:39:47] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-50000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 1 ms.
FORMULA FMS-PT-50000-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-05 finished in 158 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0 U (X(p1) U p0))))||G((G(p2)||p3))))'
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:47] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 10:39:47] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:47] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 10:39:47] [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 20 rows 22 cols
[2022-05-16 10:39:47] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:39:47] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 482 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FMS-PT-50000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 7}], [{ cond=p2, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 11}], [{ cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 3}, { cond=p3, acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 11}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 12}], [{ cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 12}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=5 dest: 12}], [{ cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND p3 (NOT p0) p1), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND p3 (NOT p1)), acceptance={} source=6 dest: 10}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 12}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p3) p2), acceptance={} source=9 dest: 1}, { cond=p3, acceptance={} source=9 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 8}], [{ cond=(AND (NOT p3) p2), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=10 dest: 7}, { cond=p3, acceptance={} source=10 dest: 10}], [{ cond=(NOT p0), acceptance={} source=11 dest: 12}], [{ cond=(NOT p1), acceptance={0} source=12 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={0} source=12 dest: 12}]], initial=9, aps=[p2:(OR (LT s2 1) (LT s18 1)), p3:(GEQ s6 1), p0:(GEQ s19 1), p1:(AND (GEQ s13 1) (GEQ s15 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, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 43 steps with 0 reset in 1 ms.
FORMULA FMS-PT-50000-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-06 finished in 589 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(p1)&&p0))||G(p2))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 11 edges and 16 vertex of which 9 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 11 place count 10 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 18 place count 9 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 9 transition count 9
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 20 place count 8 transition count 9
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 8 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 22 place count 8 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 27 place count 5 transition count 5
Applied a total of 27 rules in 4 ms. Remains 5 /22 variables (removed 17) and now considering 5/20 (removed 15) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 10:39:47] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 10:39:47] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 10:39:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 10:39:47] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-16 10:39:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-16 10:39:47] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 10:39:47] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/22 places, 5/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/22 places, 5/20 transitions.
Stuttering acceptance computed with spot in 43 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FMS-PT-50000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s3 1)), p1:(GEQ s2 1), p2:(GEQ s0 1)], nbAcceptance=2, 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 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-07 finished in 137 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(X(p0))&&F((F(!p0)||p0)))))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:48] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 10:39:48] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:48] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:39:48] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:48] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:39:48] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-50000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (GEQ s10 1) (GEQ s17 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]]
Product exploration explored 100000 steps with 10943 reset in 98 ms.
Stack based approach found an accepted trace after 6298 steps with 694 reset with depth 16 and stack size 16 in 8 ms.
FORMULA FMS-PT-50000-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-50000-LTLFireability-09 finished in 383 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(X((X(!(G(p0) U G(p1)))&&(G(!p1)||p2))))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:48] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:39:48] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:48] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 10:39:48] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:48] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:39:48] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 156 ms :[p1, p1, true, p1, p1]
Running random walk in product with property : FMS-PT-50000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LT s20 1), p1:(GEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-10 finished in 264 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 10 edges and 16 vertex of which 6 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 13 place count 12 transition count 14
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 21 place count 9 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 8 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 22 place count 8 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 27 place count 5 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 28 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 31 place count 3 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 32 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 34 place count 2 transition count 3
Applied a total of 34 rules in 5 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 10:39:48] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 10:39:48] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 10:39:48] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 10:39:48] [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.
[2022-05-16 10:39:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 10:39:48] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 10:39:48] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/22 places, 3/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/22 places, 3/20 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-50000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-11 finished in 152 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X((p1 U F(p0))))||((p2 U !p1) U p2)))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:48] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:39:48] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:48] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:39:48] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:48] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:39:48] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FMS-PT-50000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s13 1) (GEQ s15 1)), p1:(GEQ s0 1), p0:(AND (GEQ s10 1) (GEQ s17 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 16177 reset in 98 ms.
Stack based approach found an accepted trace after 2897 steps with 492 reset with depth 6 and stack size 6 in 3 ms.
FORMULA FMS-PT-50000-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-50000-LTLFireability-12 finished in 333 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&p1)))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:49] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:39:49] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:49] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:39:49] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:49] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:39:49] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FMS-PT-50000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s19 1), p0:(LT s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 5588 reset in 86 ms.
Stack based approach found an accepted trace after 146 steps with 6 reset with depth 23 and stack size 23 in 1 ms.
FORMULA FMS-PT-50000-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-50000-LTLFireability-13 finished in 263 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:49] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:39:49] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:49] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:39:49] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:49] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:39:49] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-50000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(LT s20 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 4 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-14 finished in 298 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||!(p1 U p2))))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:49] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:39:49] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:49] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-16 10:39:49] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:39:49] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:39:49] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), p2]
Running random walk in product with property : FMS-PT-50000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p2 p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(GEQ s6 1), p2:(AND (GEQ s4 1) (GEQ s5 1) (GEQ s7 1)), p0:(AND (LT s6 1) (GEQ s0 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FMS-PT-50000-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-50000-LTLFireability-15 finished in 279 ms.
All properties solved by simple procedures.
Total runtime 7154 ms.

BK_STOP 1652697590078

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="FMS-PT-50000"
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 FMS-PT-50000, 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 r078-tall-165260110600612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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