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.r150-smll-165276998700348.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 PermAdmissibility-COL-01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998700348
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 300K
-rw-r--r-- 1 mcc users 6.7K Apr 29 12:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 12:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 12:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 12:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 54K 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 PermAdmissibility-COL-01-LTLFireability-00
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-01
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-02
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-03
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-04
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-05
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-06
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-07
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-08
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-09
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-10
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-11
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-12
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-13
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-14
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653066990152

Running Version 202205111006
[2022-05-20 17:16:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 17:16:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 17:16:32] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-20 17:16:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 17:16:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1599 ms
[2022-05-20 17:16:34] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 45 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
[2022-05-20 17:16:34] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 12 ms.
[2022-05-20 17:16:34] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PermAdmissibility-COL-01-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 588 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 40 cols
[2022-05-20 17:16:35] [INFO ] Computed 24 place invariants in 17 ms
[2022-05-20 17:16:35] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 34 ms returned sat
[2022-05-20 17:16:35] [INFO ] After 267ms 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.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA PermAdmissibility-COL-01-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 17:16:35] [INFO ] Flatten gal took : 45 ms
[2022-05-20 17:16:35] [INFO ] Flatten gal took : 20 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2022-05-20 17:16:35] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 17 ms.
[2022-05-20 17:16:35] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 26 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 16
Applied a total of 8 rules in 11 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 32 cols
[2022-05-20 17:16:35] [INFO ] Computed 16 place invariants in 3 ms
[2022-05-20 17:16:35] [INFO ] Implicit Places using invariants in 73 ms returned [24, 28]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 81 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 30/40 places, 16/16 transitions.
Support contains 26 out of 30 places after structural reductions.
[2022-05-20 17:16:35] [INFO ] Flatten gal took : 7 ms
[2022-05-20 17:16:36] [INFO ] Flatten gal took : 14 ms
[2022-05-20 17:16:36] [INFO ] Input system was already deterministic with 16 transitions.
Finished random walk after 13 steps, including 0 resets, run visited all 17 properties in 6 ms. (steps per millisecond=2 )
FORMULA PermAdmissibility-COL-01-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PermAdmissibility-COL-01-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 30 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))||X(G((!G(p1) U p0)))||G(p1))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Graph (complete) has 73 edges and 30 vertex of which 16 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 7 ms. Remains 15 /30 variables (removed 15) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 15 cols
[2022-05-20 17:16:36] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-20 17:16:36] [INFO ] Implicit Places using invariants in 54 ms returned [4, 9, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 56 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/30 places, 8/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 10 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 9 transition count 5
Applied a total of 4 rules in 8 ms. Remains 9 /12 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 9 cols
[2022-05-20 17:16:36] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 17:16:36] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 5 rows 9 cols
[2022-05-20 17:16:36] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 17:16:36] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/30 places, 5/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 9/30 places, 5/16 transitions.
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s4 1)), p0:(AND (GEQ s5 1) (GEQ s6 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 328 steps with 73 reset in 9 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-02 finished in 600 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Graph (complete) has 73 edges and 30 vertex of which 16 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 3 ms. Remains 14 /30 variables (removed 16) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 14 cols
[2022-05-20 17:16:37] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 17:16:37] [INFO ] Implicit Places using invariants in 43 ms returned [4, 5, 8, 10]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 44 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/30 places, 8/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 9 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 2 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 17:16:37] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 17:16:37] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 17:16:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:16:37] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/30 places, 5/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 7/30 places, 5/16 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s3 1) (GEQ s5 1)), p1:(AND (GEQ s2 1) (GEQ s3 1) (GEQ s6 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 5 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-03 finished in 166 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(X(F(p0)))))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Graph (complete) has 73 edges and 30 vertex of which 4 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.0 ms
Discarding 26 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Applied a total of 1 rules in 1 ms. Remains 4 /30 variables (removed 26) and now considering 2/16 (removed 14) transitions.
// Phase 1: matrix 2 rows 4 cols
[2022-05-20 17:16:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:16:37] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 2 rows 4 cols
[2022-05-20 17:16:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:16:37] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-20 17:16:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 4 cols
[2022-05-20 17:16:37] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-20 17:16:37] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/30 places, 2/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/30 places, 2/16 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-05 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:(OR (LT s0 1) (LT s1 1) (LT s3 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]]
Product exploration explored 100000 steps with 33333 reset in 296 ms.
Product exploration explored 100000 steps with 33333 reset in 207 ms.
Computed a total of 4 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PermAdmissibility-COL-01-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-01-LTLFireability-05 finished in 884 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(G(p2)&&p1))))'
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 29 transition count 16
Applied a total of 1 rules in 2 ms. Remains 29 /30 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 29 cols
[2022-05-20 17:16:38] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 17:16:38] [INFO ] Implicit Places using invariants in 89 ms returned [4, 5, 6, 7, 14, 15, 16]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 91 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/30 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 22/30 places, 16/16 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s16 1) (GEQ s18 1) (GEQ s20 1)), p1:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s12 1)), p2:(AND (OR (AND (GEQ s10 1) (GEQ s11 1) (GEQ s12 1)) (AND (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7142 reset in 129 ms.
Product exploration explored 100000 steps with 7142 reset in 220 ms.
Computed a total of 22 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 456 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 436 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
// Phase 1: matrix 16 rows 22 cols
[2022-05-20 17:16:39] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 17:16:40] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-20 17:16:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 17:16:40] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-20 17:16:40] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-20 17:16:40] [INFO ] Added : 11 causal constraints over 3 iterations in 56 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Graph (complete) has 33 edges and 22 vertex of which 20 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 13
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 18 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 5 place count 18 transition count 10
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 9 place count 16 transition count 10
Applied a total of 9 rules in 14 ms. Remains 16 /22 variables (removed 6) and now considering 10/16 (removed 6) transitions.
// Phase 1: matrix 10 rows 16 cols
[2022-05-20 17:16:40] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-20 17:16:40] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 10 rows 16 cols
[2022-05-20 17:16:40] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 17:16:40] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2022-05-20 17:16:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 16 cols
[2022-05-20 17:16:40] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 17:16:40] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/22 places, 10/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/22 places, 10/16 transitions.
Computed a total of 16 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 10
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 204 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 234 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
// Phase 1: matrix 10 rows 16 cols
[2022-05-20 17:16:40] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 17:16:41] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-20 17:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 17:16:41] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-20 17:16:41] [INFO ] Computed and/alt/rep : 9/17/9 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-20 17:16:41] [INFO ] Added : 7 causal constraints over 2 iterations in 31 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10000 reset in 137 ms.
Product exploration explored 100000 steps with 10000 reset in 138 ms.
Built C files in :
/tmp/ltsmin14785938615503234722
[2022-05-20 17:16:41] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2022-05-20 17:16:41] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:16:41] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2022-05-20 17:16:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:16:41] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2022-05-20 17:16:41] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:16:41] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14785938615503234722
Running compilation step : cd /tmp/ltsmin14785938615503234722;'/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 378 ms.
Running link step : cd /tmp/ltsmin14785938615503234722;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin14785938615503234722;'/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/stateBased8190726861713993538.hoa' '--buchi-type=spotba'
LTSmin run took 105 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-01-LTLFireability-07 finished in 3877 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(F(p0))||p1) U (X(p1) U !p2))))'
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 29 transition count 16
Applied a total of 1 rules in 2 ms. Remains 29 /30 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 29 cols
[2022-05-20 17:16:42] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 17:16:42] [INFO ] Implicit Places using invariants in 87 ms returned [5, 7, 12, 15, 16, 17, 19, 23, 25]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 89 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/30 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/30 places, 16/16 transitions.
Stuttering acceptance computed with spot in 245 ms :[p2, p2, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s8 1) (GEQ s10 1) (GEQ s11 1)), p1:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s11 1)), p0:(AND (GEQ s3 1) (GEQ s4 1) (GEQ s5 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]]
Product exploration explored 100000 steps with 50000 reset in 225 ms.
Product exploration explored 100000 steps with 50000 reset in 294 ms.
Computed a total of 20 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 10 factoid took 239 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA PermAdmissibility-COL-01-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-01-LTLFireability-08 finished in 1180 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F((F(X(G(p0)))||G(X(!p0)))))||p1)))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Graph (complete) has 73 edges and 30 vertex of which 28 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 4 ms. Remains 26 /30 variables (removed 4) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 26 cols
[2022-05-20 17:16:43] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-20 17:16:43] [INFO ] Implicit Places using invariants in 103 ms returned [4, 5, 6, 7, 12, 13, 14, 15]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 104 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/30 places, 14/16 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 16 transition count 12
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 4 place count 16 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 10 place count 13 transition count 9
Applied a total of 10 rules in 7 ms. Remains 13 /18 variables (removed 5) and now considering 9/14 (removed 5) transitions.
// Phase 1: matrix 9 rows 13 cols
[2022-05-20 17:16:43] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 17:16:43] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 9 rows 13 cols
[2022-05-20 17:16:43] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-20 17:16:43] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/30 places, 9/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 13/30 places, 9/16 transitions.
Stuttering acceptance computed with spot in 110 ms :[false, false]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s12 1)), p0:(OR (LT s6 1) (LT s7 1) (LT s8 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10000 reset in 417 ms.
Product exploration explored 100000 steps with 10000 reset in 214 ms.
Computed a total of 13 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 13 transition count 9
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 249 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PermAdmissibility-COL-01-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-01-LTLFireability-09 finished in 1272 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X((G(F(p1))||p0))&&p1)))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 28 transition count 16
Applied a total of 2 rules in 2 ms. Remains 28 /30 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 28 cols
[2022-05-20 17:16:44] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 17:16:44] [INFO ] Implicit Places using invariants in 105 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 22, 24]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 107 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/30 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 18/30 places, 16/16 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s8 1) (LT s10 1) (LT s12 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 5 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-12 finished in 326 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(X((p1 U p2)))&&F(p3)&&p0))))'
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 28 transition count 16
Applied a total of 2 rules in 2 ms. Remains 28 /30 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 28 cols
[2022-05-20 17:16:44] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-20 17:16:44] [INFO ] Implicit Places using invariants in 81 ms returned [4, 6, 12, 13, 14, 15]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 85 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/30 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 22/30 places, 16/16 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p0) (NOT p3) (NOT p2)), true, (NOT p3), (NOT p2)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s4 1) (GEQ s5 1) (OR (LT s10 1) (LT s12 1) (LT s14 1))), p3:(AND (GEQ s16 1) (GEQ s17 1) (GEQ s18 1)), p2:(AND (GEQ s10 1) (GEQ s1...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 2 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-13 finished in 427 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(X((G(p0)&&G(p1)&&p0)))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Graph (complete) has 73 edges and 30 vertex of which 28 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 5 ms. Remains 26 /30 variables (removed 4) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 26 cols
[2022-05-20 17:16:45] [INFO ] Computed 12 place invariants in 6 ms
[2022-05-20 17:16:45] [INFO ] Implicit Places using invariants in 101 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 18]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 102 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/30 places, 14/16 transitions.
Reduce places removed 1 places and 1 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 15 transition count 7
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 9 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 9 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 7 transition count 5
Applied a total of 16 rules in 6 ms. Remains 7 /16 variables (removed 9) and now considering 5/14 (removed 9) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 17:16:45] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 17:16:45] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 17:16:45] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 17:16:45] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/30 places, 5/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 7/30 places, 5/16 transitions.
Stuttering acceptance computed with spot in 53 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s5 1) (LT s6 1)), p1:(OR (LT s3 1) (LT s4 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 16666 reset in 464 ms.
Product exploration explored 100000 steps with 16666 reset in 339 ms.
Computed a total of 7 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 275 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 50 ms :[(OR (NOT p1) (NOT p0))]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (OR (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 366 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 50 ms :[(OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 50 ms :[(OR (NOT p1) (NOT p0))]
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 17:16:47] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 17:16:47] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 17:16:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:16:47] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-20 17:16:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 17:16:47] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 17:16:47] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 5/5 transitions.
Computed a total of 7 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 242 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 38 ms :[(OR (NOT p1) (NOT p0))]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (OR (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 283 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 35 ms :[(OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 37 ms :[(OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 34 ms :[(OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 16666 reset in 112 ms.
Product exploration explored 100000 steps with 16666 reset in 516 ms.
Built C files in :
/tmp/ltsmin10502596883506089675
[2022-05-20 17:16:48] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-20 17:16:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:16:48] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-20 17:16:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:16:48] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-20 17:16:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:16:48] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10502596883506089675
Running compilation step : cd /tmp/ltsmin10502596883506089675;'/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 143 ms.
Running link step : cd /tmp/ltsmin10502596883506089675;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin10502596883506089675;'/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/stateBased18677448711870359.hoa' '--buchi-type=spotba'
LTSmin run took 68 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-01-LTLFireability-14 finished in 3653 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G((X(p0)||(X(F(p0))&&p1)))))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 29 transition count 16
Applied a total of 1 rules in 1 ms. Remains 29 /30 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 29 cols
[2022-05-20 17:16:48] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 17:16:49] [INFO ] Implicit Places using invariants in 97 ms returned [4, 6, 12, 15, 16, 17, 19, 23, 25]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 100 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/30 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/30 places, 16/16 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s4 1) (GEQ s5 1)), p0:(AND (GEQ s8 1) (GEQ s10 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 28 steps with 3 reset in 1 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-15 finished in 273 ms.
All properties solved by simple procedures.
Total runtime 16545 ms.

BK_STOP 1653067009639

--------------------
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="PermAdmissibility-COL-01"
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 PermAdmissibility-COL-01, 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 r150-smll-165276998700348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-01.tgz
mv PermAdmissibility-COL-01 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 ;