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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 8.7K Apr 29 12:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 29 12:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 29 12:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 12:39 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 3.8K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:24 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-20-LTLFireability-00
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-01
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-02
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-03
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-04
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-05
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-06
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-07
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-08
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-09
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-10
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-11
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-12
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-13
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-14
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653076283365

Running Version 202205111006
[2022-05-20 19:51:25] [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 19:51:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 19:51:26] [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 19:51:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 19:51:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1458 ms
[2022-05-20 19:51:27] [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 22 ms.
Working with output stream class java.io.PrintStream
[2022-05-20 19:51:27] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 11 ms.
[2022-05-20 19:51:27] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PermAdmissibility-COL-20-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-20-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-20-LTLFireability-09 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).
Finished random walk after 274 steps, including 0 resets, run visited all 17 properties in 62 ms. (steps per millisecond=4 )
[2022-05-20 19:51:28] [INFO ] Flatten gal took : 34 ms
[2022-05-20 19:51:28] [INFO ] Flatten gal took : 11 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 19:51:28] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 17 ms.
[2022-05-20 19:51:28] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Support contains 27 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 9 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 19:51:28] [INFO ] Computed 16 place invariants in 11 ms
[2022-05-20 19:51:28] [INFO ] Implicit Places using invariants in 217 ms returned [4, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 265 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 0 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 27 out of 30 places after structural reductions.
[2022-05-20 19:51:28] [INFO ] Flatten gal took : 6 ms
[2022-05-20 19:51:28] [INFO ] Flatten gal took : 7 ms
[2022-05-20 19:51:28] [INFO ] Input system was already deterministic with 16 transitions.
Finished random walk after 274 steps, including 0 resets, run visited all 16 properties in 11 ms. (steps per millisecond=24 )
FORMULA PermAdmissibility-COL-20-LTLFireability-03 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' '!((X(X(p0))&&F(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 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 19:51:28] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-20 19:51:28] [INFO ] Implicit Places using invariants in 84 ms returned [4, 5, 10, 11, 12, 13, 20, 24]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 86 ms to find 8 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 411 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s10 1) (GEQ s12 1)), p0:(AND (GEQ s14 1) (GEQ s15 1) (GEQ s16 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-LTLFireability-01 finished in 572 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G((F(X(X(p1)))&&(p1 U !p1)))&&p0)))))'
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 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 19:51:29] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-20 19:51:29] [INFO ] Implicit Places using invariants in 101 ms returned [10, 13, 14, 15, 17, 21, 22, 24, 25]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 102 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 3 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 375 ms :[true, true, true, true, true, (NOT p1), p1, true]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 5}, { cond=p1, acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s4 1) (GEQ s5 1)), p1:(AND (GEQ s8 1) (GEQ s10 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-LTLFireability-04 finished in 514 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G(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 67 edges and 30 vertex of which 16 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.2 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 9 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 19:51:29] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 19:51:30] [INFO ] Implicit Places using invariants in 48 ms returned [4, 5, 8, 10]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 49 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.
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 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 8 transition count 4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 9 ms. Remains 6 /10 variables (removed 4) and now considering 4/8 (removed 4) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-20 19:51:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 19:51:30] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-20 19:51:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 19:51:30] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/30 places, 4/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/30 places, 4/16 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 3 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-LTLFireability-05 finished in 207 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((G(p0)&&X(p0))))||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 67 edges and 30 vertex of which 22 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Ensure Unique test removed 2 places
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 20 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 19 transition count 11
Applied a total of 3 rules in 6 ms. Remains 19 /30 variables (removed 11) and now considering 11/16 (removed 5) transitions.
// Phase 1: matrix 11 rows 19 cols
[2022-05-20 19:51:30] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-20 19:51:30] [INFO ] Implicit Places using invariants in 67 ms returned [9, 10, 11, 12, 13, 15]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 70 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/30 places, 11/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 12 transition count 7
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 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 6 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 10 place count 7 transition count 5
Applied a total of 10 rules in 5 ms. Remains 7 /13 variables (removed 6) and now considering 5/11 (removed 6) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 19:51:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 19:51:30] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 19:51:30] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-20 19:51:30] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 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 47 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15078 reset in 547 ms.
Product exploration explored 100000 steps with 15133 reset in 290 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 185 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 45 ms :[(NOT p0)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
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 209 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 19:51:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 19:51:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-20 19:51:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 19:51:31] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-20 19:51:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 19:51:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-20 19:51:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 19:51:31] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-20 19:51:31] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-20 19:51:31] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 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 6 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 19:51:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 19:51:31] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 19:51:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 19:51:31] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-20 19:51:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 19:51:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 19:51:32] [INFO ] Dead Transitions using invariants and state equation in 23 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 172 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 33 ms :[(NOT p0)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
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 208 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 19:51:32] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 19:51:32] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-20 19:51:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 19:51:32] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-20 19:51:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 19:51:32] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-20 19:51:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 19:51:32] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-20 19:51:32] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-20 19:51:32] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15049 reset in 183 ms.
Product exploration explored 100000 steps with 15130 reset in 160 ms.
Built C files in :
/tmp/ltsmin10480482441401748879
[2022-05-20 19:51:33] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-20 19:51:33] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:51:33] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-20 19:51:33] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:51:33] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-20 19:51:33] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:51:33] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10480482441401748879
Running compilation step : cd /tmp/ltsmin10480482441401748879;'/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 284 ms.
Running link step : cd /tmp/ltsmin10480482441401748879;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin10480482441401748879;'/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/stateBased4768193021925317332.hoa' '--buchi-type=spotba'
LTSmin run took 100 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-20-LTLFireability-06 finished in 3385 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(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 67 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 2 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 19:51:33] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 19:51:33] [INFO ] Implicit Places using invariants in 35 ms returned [4, 5, 8, 10]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 36 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.
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 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 8 transition count 4
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 6 place count 6 transition count 4
Applied a total of 6 rules in 3 ms. Remains 6 /10 variables (removed 4) and now considering 4/8 (removed 4) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-20 19:51:33] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 19:51:33] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-20 19:51:33] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 19:51:33] [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 : 6/30 places, 4/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/30 places, 4/16 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-07 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:(AND (GEQ s2 1) (GEQ s3 1) (GEQ s5 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 5515 steps with 766 reset in 11 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-LTLFireability-07 finished in 184 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U p1)||F(p2)))'
Support contains 12 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 29 transition count 15
Applied a total of 2 rules in 4 ms. Remains 29 /30 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 29 cols
[2022-05-20 19:51:33] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 19:51:33] [INFO ] Implicit Places using invariants in 73 ms returned [3, 4, 15, 17, 22, 24]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 74 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 15/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 23 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 22 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 22 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 19 transition count 11
Applied a total of 8 rules in 16 ms. Remains 19 /23 variables (removed 4) and now considering 11/15 (removed 4) transitions.
// Phase 1: matrix 11 rows 19 cols
[2022-05-20 19:51:33] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-20 19:51:33] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 11 rows 19 cols
[2022-05-20 19:51:33] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-20 19:51:33] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/30 places, 11/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 19/30 places, 11/16 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p2), (AND p1 (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p2:(AND (GEQ s6 1) (GEQ s8 1) (GEQ s9 1)), p1:(AND (NOT (AND (GEQ s2 1) (GEQ s3 1) (GEQ s7 1))) (NOT (AND (GEQ s15 1) (GEQ s17 1) (GEQ s18 1)))), p0:(AND ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 25028 reset in 149 ms.
Product exploration explored 100000 steps with 25009 reset in 181 ms.
Computed a total of 19 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 11
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) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 9 factoid took 509 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[(NOT p2), (NOT p2)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 9 factoid took 532 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 46 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p2)]
// Phase 1: matrix 11 rows 19 cols
[2022-05-20 19:51:35] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-20 19:51:35] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-20 19:51:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 19:51:35] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-20 19:51:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 19:51:35] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-20 19:51:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 19:51:35] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-20 19:51:35] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-20 19:51:35] [INFO ] Added : 10 causal constraints over 2 iterations in 27 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 19 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 : 19/19 places, 11/11 transitions.
Applied a total of 0 rules in 5 ms. Remains 19 /19 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 19 cols
[2022-05-20 19:51:35] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-20 19:51:35] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 11 rows 19 cols
[2022-05-20 19:51:35] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-20 19:51:35] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2022-05-20 19:51:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 19 cols
[2022-05-20 19:51:35] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-20 19:51:35] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/19 places, 11/11 transitions.
Computed a total of 19 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 11
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 p2), (X (NOT p2)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 3 factoid took 203 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 46 ms :[(NOT p2)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 3 factoid took 253 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 49 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p2)]
// Phase 1: matrix 11 rows 19 cols
[2022-05-20 19:51:36] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-20 19:51:36] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-20 19:51:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 19:51:36] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-20 19:51:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 19:51:36] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-20 19:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 19:51:36] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-20 19:51:36] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-20 19:51:36] [INFO ] Added : 10 causal constraints over 2 iterations in 21 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 38 ms :[(NOT p2)]
Product exploration explored 100000 steps with 25012 reset in 133 ms.
Product exploration explored 100000 steps with 24995 reset in 188 ms.
Built C files in :
/tmp/ltsmin6761945112882259446
[2022-05-20 19:51:37] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2022-05-20 19:51:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:51:37] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2022-05-20 19:51:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:51:37] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2022-05-20 19:51:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:51:37] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6761945112882259446
Running compilation step : cd /tmp/ltsmin6761945112882259446;'/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 158 ms.
Running link step : cd /tmp/ltsmin6761945112882259446;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6761945112882259446;'/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/stateBased17495509288454036006.hoa' '--buchi-type=spotba'
LTSmin run took 71 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-20-LTLFireability-08 finished in 3739 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((G(X(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 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 19:51:37] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 19:51:37] [INFO ] Implicit Places using invariants in 88 ms returned [4, 5, 12, 13, 14, 15, 17, 21, 25]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 92 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 0 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 153 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (LT s4 1) (LT s5 1) (LT s9 1)), p1:(AND (GEQ s14 1) (GEQ s16 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-LTLFireability-10 finished in 272 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
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 1 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 19:51:37] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-20 19:51:37] [INFO ] Implicit Places using invariants in 90 ms returned [10, 11, 12, 13, 14, 16, 20, 21, 23, 24]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 91 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 1 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 105 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-11 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:(OR (LT s1 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-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 36 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-LTLFireability-11 finished in 221 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((p0 U X(p1))))&&p2)))'
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 1 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 19:51:37] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-20 19:51:38] [INFO ] Implicit Places using invariants in 59 ms returned [4, 5, 10, 11, 12, 13]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 60 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 263 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p2 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 4}, { cond=p0, acceptance={0} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (LT s14 1) (LT s18 1) (LT s21 1)), p0:(AND (GEQ s8 1) (GEQ s9 1) (GEQ s10 1)), p1:(AND (GEQ s15 1) (GEQ s16 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1857 reset in 235 ms.
Product exploration explored 100000 steps with 1837 reset in 347 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 p2 (NOT p0) (NOT p1)), (X (NOT (AND p2 p0))), (X (AND p2 (NOT p0))), (X p2), (X (X (NOT p0))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 571 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 232 steps, including 0 resets, run visited all 5 properties in 5 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND p2 p0))), (X (AND p2 (NOT p0))), (X p2), (X (X (NOT p0))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F (OR p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 12 factoid took 764 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 16 rows 22 cols
[2022-05-20 19:51:40] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 19:51:40] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-20 19:51:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 19:51:40] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-20 19:51:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 19:51:40] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-20 19:51:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 19:51:40] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-20 19:51:40] [INFO ] Computed and/alt/rep : 15/27/15 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-20 19:51:40] [INFO ] Added : 15 causal constraints over 3 iterations in 25 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 6 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.
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 22 transition count 15
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 21 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 20 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 20 transition count 13
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 6 place count 19 transition count 13
Applied a total of 6 rules in 4 ms. Remains 19 /22 variables (removed 3) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 19 cols
[2022-05-20 19:51:40] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 19:51:40] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 13 rows 19 cols
[2022-05-20 19:51:40] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-20 19:51:40] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2022-05-20 19:51:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 19 cols
[2022-05-20 19:51:40] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 19:51:40] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/22 places, 13/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/22 places, 13/16 transitions.
Computed a total of 19 stabilizing places and 13 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 13
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)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR p0 p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 597 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 169 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=84 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR p0 p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F (OR p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 877 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 13 rows 19 cols
[2022-05-20 19:51:42] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 19:51:42] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-20 19:51:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 19:51:42] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-20 19:51:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 19:51:42] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-20 19:51:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 19:51:42] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-20 19:51:42] [INFO ] Computed and/alt/rep : 12/24/12 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-20 19:51:42] [INFO ] Added : 12 causal constraints over 3 iterations in 26 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2693 reset in 177 ms.
Product exploration explored 100000 steps with 2672 reset in 228 ms.
Built C files in :
/tmp/ltsmin634321427518501851
[2022-05-20 19:51:43] [INFO ] Computing symmetric may disable matrix : 13 transitions.
[2022-05-20 19:51:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:51:43] [INFO ] Computing symmetric may enable matrix : 13 transitions.
[2022-05-20 19:51:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:51:43] [INFO ] Computing Do-Not-Accords matrix : 13 transitions.
[2022-05-20 19:51:43] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:51:43] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin634321427518501851
Running compilation step : cd /tmp/ltsmin634321427518501851;'/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 158 ms.
Running link step : cd /tmp/ltsmin634321427518501851;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin634321427518501851;'/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/stateBased6396170336186157036.hoa' '--buchi-type=spotba'
LTSmin run took 102 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-20-LTLFireability-12 finished in 5875 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X((F(G(p0))||p0)))||X(!p0))))'
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 1 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 19:51:43] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 19:51:43] [INFO ] Implicit Places using invariants in 48 ms returned [10, 11, 12, 13, 14, 16, 20, 21, 23, 24]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 49 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 1 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 132 ms :[false, false, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 320 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-LTLFireability-13 finished in 198 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X((F(G(p1))&&p2))||!p2)&&p0)))'
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 19:51:44] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 19:51:44] [INFO ] Implicit Places using invariants in 56 ms returned [4, 5, 10, 15, 17, 21, 22, 24, 25]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 65 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 113 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) p1) (AND p2 p1)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p1))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s8 1) (GEQ s9 1)), p2:(OR (LT s10 1) (LT s11 1) (LT s15 1)), p1:(AND (GEQ s6 1) (GEQ s8 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3718 reset in 205 ms.
Product exploration explored 100000 steps with 3762 reset in 169 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 p0) p2 (NOT p1)), (X (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT p0))), (X (X p2)), (X (X (OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p2 p1))))), (X (X (NOT (AND p0 p2)))), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 963 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 5 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND p0 p2 (NOT p1)), false]
Incomplete random walk after 10004 steps, including 29 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 20 cols
[2022-05-20 19:51:45] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 19:51:46] [INFO ] After 28ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT p0))), (X (X p2)), (X (X (OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p2 p1))))), (X (X (NOT (AND p0 p2)))), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1))), (G (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND p0 p1 p2)), (F (OR (AND (NOT p0) p1) (AND p1 p2))), (F (NOT p2)), (F p0), (F (AND p0 p2)), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))))]
Knowledge based reduction with 15 factoid took 1281 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 16 rows 20 cols
[2022-05-20 19:51:47] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 19:51:47] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-20 19:51:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 19:51:47] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-20 19:51:47] [INFO ] Computed and/alt/rep : 15/19/15 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-20 19:51:47] [INFO ] Added : 15 causal constraints over 3 iterations in 47 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Graph (complete) has 27 edges and 20 vertex of which 12 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 11 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 10 transition count 6
Applied a total of 3 rules in 3 ms. Remains 10 /20 variables (removed 10) and now considering 6/16 (removed 10) transitions.
// Phase 1: matrix 6 rows 10 cols
[2022-05-20 19:51:47] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 19:51:47] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 6 rows 10 cols
[2022-05-20 19:51:47] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 19:51:47] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-20 19:51:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 10 cols
[2022-05-20 19:51:47] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 19:51:47] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/20 places, 6/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/20 places, 6/16 transitions.
Computed a total of 10 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 6
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) p2 (NOT p1)), (X (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND (NOT p0) p1) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2)))))]
Knowledge based reduction with 10 factoid took 798 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Finished random walk after 67 steps, including 0 resets, run visited all 6 properties in 3 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND (NOT p0) p1) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))), (F (OR (AND (NOT p0) p1) (AND p1 p2))), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND (NOT p0) (NOT p2))), (F (AND p0 p2))]
Knowledge based reduction with 10 factoid took 978 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 6 rows 10 cols
[2022-05-20 19:51:50] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 19:51:50] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-20 19:51:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 19:51:50] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-20 19:51:50] [INFO ] Computed and/alt/rep : 5/9/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-20 19:51:50] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6972 reset in 143 ms.
Product exploration explored 100000 steps with 6994 reset in 137 ms.
Built C files in :
/tmp/ltsmin8208998851901034838
[2022-05-20 19:51:50] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-20 19:51:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:51:50] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-20 19:51:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:51:50] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-20 19:51:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:51:50] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8208998851901034838
Running compilation step : cd /tmp/ltsmin8208998851901034838;'/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 110 ms.
Running link step : cd /tmp/ltsmin8208998851901034838;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin8208998851901034838;'/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/stateBased10993737535556838903.hoa' '--buchi-type=spotba'
LTSmin run took 378 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-20-LTLFireability-14 finished in 7213 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(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 67 edges and 30 vertex of which 26 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 2 places
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 24 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 23 transition count 13
Applied a total of 3 rules in 9 ms. Remains 23 /30 variables (removed 7) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 23 cols
[2022-05-20 19:51:51] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-20 19:51:51] [INFO ] Implicit Places using invariants in 60 ms returned [3, 4, 9, 10, 11, 12, 13, 15]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 61 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/30 places, 13/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 14 transition count 6
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 7 transition count 5
Applied a total of 14 rules in 2 ms. Remains 7 /15 variables (removed 8) and now considering 5/13 (removed 8) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 19:51:51] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 19:51:51] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 19:51:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 19:51:51] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 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 47 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15039 reset in 117 ms.
Product exploration explored 100000 steps with 15027 reset in 134 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 275 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 44 ms :[(NOT p0)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
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 216 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 19:51:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 19:51:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-20 19:51:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 19:51:52] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-20 19:51:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 19:51:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-20 19:51:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 19:51:52] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-20 19:51:52] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-20 19:51:52] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 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 1 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 19:51:52] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 19:51:52] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 19:51:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 19:51:52] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2022-05-20 19:51:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 19:51:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 19:51:52] [INFO ] Dead Transitions using invariants and state equation in 26 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 187 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 44 ms :[(NOT p0)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
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 215 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 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 19:51:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 19:51:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-20 19:51:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 19:51:53] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-20 19:51:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 19:51:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-20 19:51:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 19:51:53] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-20 19:51:53] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-20 19:51:53] [INFO ] Added : 4 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15040 reset in 122 ms.
Product exploration explored 100000 steps with 15102 reset in 150 ms.
Built C files in :
/tmp/ltsmin14545287573463572359
[2022-05-20 19:51:53] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-20 19:51:53] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:51:53] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-20 19:51:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:51:53] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-20 19:51:53] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:51:53] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14545287573463572359
Running compilation step : cd /tmp/ltsmin14545287573463572359;'/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 126 ms.
Running link step : cd /tmp/ltsmin14545287573463572359;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14545287573463572359;'/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/stateBased17664149002232951775.hoa' '--buchi-type=spotba'
LTSmin run took 138 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-20-LTLFireability-15 finished in 2673 ms.
All properties solved by simple procedures.
Total runtime 28008 ms.

BK_STOP 1653076314510

--------------------
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-20"
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-20, 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-165276998800380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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