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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 7.0K Apr 29 12:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 12:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 12:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 12:36 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.7K 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.6K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 54K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-00
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-01
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-02
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-03
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-04
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-05
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-06
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-07
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-08
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-09
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-10
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-11
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-12
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-13
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-14
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653067147782

Running Version 202205111006
[2022-05-20 17:19:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 17:19:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 17:19:10] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-20 17:19:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 17:19:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1478 ms
[2022-05-20 17:19:12] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 42 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 17:19:12] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 11 ms.
[2022-05-20 17:19:12] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PermAdmissibility-COL-02-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-LTLFireability-09 TRUE 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 12 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 43 steps, including 0 resets, run visited all 15 properties in 28 ms. (steps per millisecond=1 )
[2022-05-20 17:19:12] [INFO ] Flatten gal took : 40 ms
[2022-05-20 17:19:12] [INFO ] Flatten gal took : 13 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2022-05-20 17:19:12] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 15 ms.
[2022-05-20 17:19:12] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 22 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 31 transition count 16
Applied a total of 9 rules in 11 ms. Remains 31 /40 variables (removed 9) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2022-05-20 17:19:12] [INFO ] Computed 15 place invariants in 16 ms
[2022-05-20 17:19:13] [INFO ] Implicit Places using invariants in 251 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 304 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 30/40 places, 16/16 transitions.
Support contains 22 out of 30 places after structural reductions.
[2022-05-20 17:19:13] [INFO ] Flatten gal took : 8 ms
[2022-05-20 17:19:13] [INFO ] Flatten gal took : 8 ms
[2022-05-20 17:19:13] [INFO ] Input system was already deterministic with 16 transitions.
Finished random walk after 43 steps, including 0 resets, run visited all 14 properties in 11 ms. (steps per millisecond=3 )
Computed a total of 30 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p1)&&p0))||G(X((X(p2)||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 3 ms. Remains 29 /30 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 29 cols
[2022-05-20 17:19:13] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-20 17:19:13] [INFO ] Implicit Places using invariants in 113 ms returned [3, 5, 6, 7, 11, 15, 18, 23, 25]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 115 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 582 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s12 1) (GEQ s16 1) (GEQ s17 1)), p0:(AND (GEQ s12 1) (GEQ s16 1) (GEQ s17 1)), p2:(AND (GEQ s4 1) (GEQ s8 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 4 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-00 finished in 819 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(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 4 ms. Remains 29 /30 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 29 cols
[2022-05-20 17:19:14] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-20 17:19:14] [INFO ] Implicit Places using invariants in 117 ms returned [6, 7, 11, 15, 18, 19, 23, 24, 25]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 119 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 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1) (GEQ s5 1)), p1:(AND (GEQ s6 1) (GEQ s10 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 8300 reset in 405 ms.
Product exploration explored 100000 steps with 8279 reset in 182 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) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 327 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 34 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 321 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 16 rows 20 cols
[2022-05-20 17:19:16] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 17:19:16] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-20 17:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 17:19:16] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-20 17:19:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 17:19:16] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-20 17:19:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 17:19:16] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-20 17:19:16] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-20 17:19:16] [INFO ] Added : 10 causal constraints over 2 iterations in 28 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 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.
// Phase 1: matrix 16 rows 20 cols
[2022-05-20 17:19:16] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 17:19:16] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 16 rows 20 cols
[2022-05-20 17:19:16] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-20 17:19:16] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 20 cols
[2022-05-20 17:19:16] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 17:19:16] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 16/16 transitions.
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) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 471 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 33 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 389 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 16 rows 20 cols
[2022-05-20 17:19:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 17:19:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-20 17:19:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 17:19:17] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-20 17:19:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 17:19:17] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-20 17:19:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 17:19:17] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-20 17:19:17] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-20 17:19:17] [INFO ] Added : 10 causal constraints over 2 iterations in 24 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8292 reset in 323 ms.
Product exploration explored 100000 steps with 8288 reset in 323 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
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 18 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 18 transition count 14
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 2 place count 18 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 18 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 17 transition count 13
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 17 transition count 13
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 8 rules in 8 ms. Remains 17 /20 variables (removed 3) and now considering 13/16 (removed 3) transitions.
[2022-05-20 17:19:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 17 cols
[2022-05-20 17:19:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 17:19:19] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/20 places, 13/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 17/20 places, 13/16 transitions.
Product exploration explored 100000 steps with 16304 reset in 385 ms.
Product exploration explored 100000 steps with 16323 reset in 439 ms.
Built C files in :
/tmp/ltsmin409898324643943029
[2022-05-20 17:19:19] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin409898324643943029
Running compilation step : cd /tmp/ltsmin409898324643943029;'/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 280 ms.
Running link step : cd /tmp/ltsmin409898324643943029;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin409898324643943029;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11611897706839292554.hoa' '--buchi-type=spotba'
LTSmin run took 214 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-02-LTLFireability-01 finished in 6103 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(G(F((G(p1)||p0))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Graph (complete) has 73 edges and 30 vertex of which 14 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 12 transition count 7
Applied a total of 3 rules in 6 ms. Remains 12 /30 variables (removed 18) and now considering 7/16 (removed 9) transitions.
// Phase 1: matrix 7 rows 12 cols
[2022-05-20 17:19:20] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 17:19:20] [INFO ] Implicit Places using invariants in 56 ms returned [3, 7, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 60 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/30 places, 7/16 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 0 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 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 3 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 17:19:20] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:19:20] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 17:19:20] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:19:20] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 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 105 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s0 1) (LT s3 1) (LT s4 1)) (OR (LT s1 1) (LT s3 1) (LT s4 1))), p0:(OR (LT s0 1) (LT s3 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10260 reset in 227 ms.
Product exploration explored 100000 steps with 10294 reset in 297 ms.
Computed a total of 7 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 7 factoid took 356 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PermAdmissibility-COL-02-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-02-LTLFireability-04 finished in 1182 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))||X((X(G(!p0))||G(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.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2022-05-20 17:19:21] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-20 17:19:21] [INFO ] Implicit Places using invariants in 103 ms returned [3, 5, 11, 15, 20, 24, 25, 26]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 105 ms to find 8 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 489 ms :[true, (NOT p1), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), p0, (NOT p2), (AND p0 (NOT p2)), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 8}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p0 p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=9 dest: 9}]], initial=2, aps=[p1:(AND (GEQ s0 1) (GEQ s4 1) (GEQ s5 1)), p0:(AND (GEQ s6 1) (GEQ s10 1) (GEQ s11 1)), p2:(OR (LT s14 1) (LT s15 1) (LT s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-05 finished in 630 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((G(F(p2))&&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 17:19:22] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-20 17:19:22] [INFO ] Implicit Places using invariants in 104 ms returned [3, 5, 6, 7, 11, 15, 18, 19, 24]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 106 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 293 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s8 1) (GEQ s9 1)), p1:(AND (GEQ s15 1) (GEQ s16 1) (GEQ s19 1)), p2:(AND (GEQ s15 1) (GEQ s16 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-07 finished in 436 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(!(X(G(X(!p0))) U X(!p0))))&&F(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 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 29 transition count 16
Applied a total of 1 rules in 2 ms. Remains 29 /30 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 29 cols
[2022-05-20 17:19:22] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-20 17:19:22] [INFO ] Implicit Places using invariants in 136 ms returned [3, 5, 6, 7, 11, 15, 18, 19, 23, 24, 25]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 138 ms to find 11 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 149 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s4 1) (GEQ s8 1) (GEQ s9 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 2 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-08 finished in 310 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))&&G(X(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 17:19:23] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 17:19:23] [INFO ] Implicit Places using invariants in 107 ms returned [3, 5, 11, 13, 14, 15, 18, 19, 24]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 108 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 250 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(AND (GEQ s0 1) (GEQ s4 1) (GEQ s5 1)), p0:(OR (LT s15 1) (LT s16 1) (LT s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-10 finished in 385 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&X((X(p1)&&F(X(p2))&&p3))))'
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2022-05-20 17:19:23] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-20 17:19:23] [INFO ] Implicit Places using invariants in 88 ms returned [3, 5, 6, 7, 20, 24, 25, 26]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 91 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/30 places, 16/16 transitions.
Applied a total of 0 rules in 6 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 227 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1) (NOT p3) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p3) (NOT p0)), true]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p3 p0), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p3) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(AND (GEQ s6 1) (GEQ s9 1) (GEQ s10 1)), p1:(AND (GEQ s14 1) (GEQ s15 1) (GEQ s16 1)), p3:(OR (AND (GEQ s14 1) (GEQ s15 1) (GEQ s16 1)) (AND (GEQ s7 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-11 finished in 342 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.
Ensure Unique test removed 1 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 26 transition count 14
Applied a total of 5 rules in 5 ms. Remains 26 /30 variables (removed 4) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 26 cols
[2022-05-20 17:19:23] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-20 17:19:23] [INFO ] Implicit Places using invariants in 88 ms returned [3, 5, 11, 13, 14, 15, 16, 20, 21, 22]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 90 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/30 places, 14/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 15 transition count 7
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 9 transition count 7
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 12 place count 9 transition count 4
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 18 place count 6 transition count 4
Applied a total of 18 rules in 6 ms. Remains 6 /16 variables (removed 10) and now considering 4/14 (removed 10) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-20 17:19:23] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:19:23] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-20 17:19:23] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:19:23] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 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 48 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s3 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 19462 reset in 122 ms.
Product exploration explored 100000 steps with 19523 reset in 140 ms.
Computed a total of 6 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 4
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 199 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
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 230 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 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
// Phase 1: matrix 4 rows 6 cols
[2022-05-20 17:19:24] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 17:19:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-20 17:19:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 17:19:24] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-20 17:19:24] [INFO ] Computed and/alt/rep : 3/7/3 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-20 17:19:24] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 2 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-20 17:19:24] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 17:19:25] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-20 17:19:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:19:25] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2022-05-20 17:19:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-20 17:19:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:19:25] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 4/4 transitions.
Computed a total of 6 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 4
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 193 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 43 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
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 205 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 4 rows 6 cols
[2022-05-20 17:19:25] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 17:19:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-20 17:19:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 17:19:25] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-20 17:19:25] [INFO ] Computed and/alt/rep : 3/7/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-20 17:19:25] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 19514 reset in 103 ms.
Product exploration explored 100000 steps with 19515 reset in 126 ms.
Built C files in :
/tmp/ltsmin11958932447746948612
[2022-05-20 17:19:26] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2022-05-20 17:19:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:19:26] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2022-05-20 17:19:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:19:26] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2022-05-20 17:19:26] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:19:26] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11958932447746948612
Running compilation step : cd /tmp/ltsmin11958932447746948612;'/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 140 ms.
Running link step : cd /tmp/ltsmin11958932447746948612;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin11958932447746948612;'/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/stateBased15622987064222140661.hoa' '--buchi-type=spotba'
LTSmin run took 57 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-02-LTLFireability-12 finished in 2484 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||p1)))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Graph (complete) has 73 edges and 30 vertex of which 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
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 23 transition count 12
Applied a total of 6 rules in 7 ms. Remains 23 /30 variables (removed 7) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 23 cols
[2022-05-20 17:19:26] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 17:19:26] [INFO ] Implicit Places using invariants in 49 ms returned [7, 9, 10, 13, 17, 18, 19]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 51 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/30 places, 12/16 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 16 transition count 9
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 13 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 12 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 12 transition count 7
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 10 place count 11 transition count 7
Applied a total of 10 rules in 6 ms. Remains 11 /16 variables (removed 5) and now considering 7/12 (removed 5) transitions.
// Phase 1: matrix 7 rows 11 cols
[2022-05-20 17:19:26] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 17:19:26] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 7 rows 11 cols
[2022-05-20 17:19:26] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-20 17:19:26] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/30 places, 7/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 11/30 places, 7/16 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))) (OR (LT s4 1) (LT s5 1) (LT s6 1))), p0:(OR (LT s4 1) (LT s5 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14859 reset in 199 ms.
Product exploration explored 100000 steps with 14933 reset in 151 ms.
Computed a total of 11 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 7
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 p1 p0), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 6 factoid took 252 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PermAdmissibility-COL-02-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-02-LTLFireability-13 finished in 869 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(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 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 29 transition count 16
Applied a total of 1 rules in 1 ms. Remains 29 /30 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 29 cols
[2022-05-20 17:19:27] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 17:19:27] [INFO ] Implicit Places using invariants in 75 ms returned [3, 5, 6, 7, 13, 14, 18, 19, 23, 24, 25]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 76 ms to find 11 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 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s7 1) (LT s8 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 96 ms.
Product exploration explored 100000 steps with 33333 reset in 107 ms.
Computed a total of 18 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 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 : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PermAdmissibility-COL-02-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-02-LTLFireability-14 finished in 527 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U !p0) U X(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 73 edges and 30 vertex of which 14 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 1 places
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 3 place count 12 transition count 7
Applied a total of 3 rules in 4 ms. Remains 12 /30 variables (removed 18) and now considering 7/16 (removed 9) transitions.
// Phase 1: matrix 7 rows 12 cols
[2022-05-20 17:19:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 17:19:27] [INFO ] Implicit Places using invariants in 44 ms returned [3, 7, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 48 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/30 places, 7/16 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 0 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 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 5 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 17:19:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:19:27] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 17:19:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:19:27] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 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 52 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-15 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 s1 1) (GEQ s3 1) (GEQ s4 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 10 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-15 finished in 192 ms.
All properties solved by simple procedures.
Total runtime 17443 ms.

BK_STOP 1653067168356

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

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