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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 7.9K Apr 29 12:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 29 12:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 12:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 12:37 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 26K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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-05-LTLFireability-00
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-01
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-02
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-03
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-04
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-05
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-06
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-07
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-08
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-09
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-10
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-11
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-12
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-13
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-14
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653067308256

Running Version 202205111006
[2022-05-20 17:21:50] [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:21:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 17:21:50] [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:21:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 17:21:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 989 ms
[2022-05-20 17:21:51] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 35 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2022-05-20 17:21:52] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 12 ms.
[2022-05-20 17:21:52] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PermAdmissibility-COL-05-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-LTLFireability-13 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 5273 steps, including 54 resets, run visited all 15 properties in 87 ms. (steps per millisecond=60 )
[2022-05-20 17:21:52] [INFO ] Flatten gal took : 52 ms
[2022-05-20 17:21:52] [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:21:52] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 18 ms.
[2022-05-20 17:21:52] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Support contains 26 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 16
Applied a total of 8 rules in 12 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 32 cols
[2022-05-20 17:21:52] [INFO ] Computed 16 place invariants in 10 ms
[2022-05-20 17:21:52] [INFO ] Implicit Places using invariants in 233 ms returned [5, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 294 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 30/40 places, 16/16 transitions.
Support contains 26 out of 30 places after structural reductions.
[2022-05-20 17:21:52] [INFO ] Flatten gal took : 7 ms
[2022-05-20 17:21:52] [INFO ] Flatten gal took : 5 ms
[2022-05-20 17:21:52] [INFO ] Input system was already deterministic with 16 transitions.
Finished random walk after 6243 steps, including 64 resets, run visited all 15 properties in 24 ms. (steps per millisecond=260 )
FORMULA PermAdmissibility-COL-05-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PermAdmissibility-COL-05-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 30 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (G(X(F(X(p1))))||!p2))))'
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.
Ensure Unique test removed 2 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 2 place count 27 transition count 15
Applied a total of 2 rules in 13 ms. Remains 27 /30 variables (removed 3) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 27 cols
[2022-05-20 17:21:53] [INFO ] Computed 12 place invariants in 6 ms
[2022-05-20 17:21:53] [INFO ] Implicit Places using invariants in 119 ms returned [3, 4, 9, 10, 11, 12, 20, 22]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 121 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/30 places, 15/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 19 transition count 12
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 16 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 15 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 15 transition count 9
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 13 transition count 9
Applied a total of 12 rules in 12 ms. Remains 13 /19 variables (removed 6) and now considering 9/15 (removed 6) transitions.
// Phase 1: matrix 9 rows 13 cols
[2022-05-20 17:21:53] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 17:21:53] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 9 rows 13 cols
[2022-05-20 17:21:53] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-20 17:21:53] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/30 places, 9/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 13/30 places, 9/16 transitions.
Stuttering acceptance computed with spot in 455 ms :[(AND (NOT p1) p2), (NOT p1), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) p0), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s9 1) (GEQ s11 1) (GEQ s12 1)), p0:(OR (AND (GEQ s9 1) (GEQ s11 1) (GEQ s12 1)) (AND (GEQ s5 1) (GEQ s6 1) (GEQ s7 1))), p1:(AND (GEQ s5 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3097 reset in 597 ms.
Product exploration explored 100000 steps with 3066 reset in 286 ms.
Computed a total of 13 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 13 transition count 9
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (OR (NOT p2) p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p1)), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (X (OR (NOT p2) p0))), true, (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 693 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) p2), (NOT p1), (NOT p1), (AND (NOT p1) p2)]
Incomplete random walk after 10003 steps, including 181 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 68 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 9 rows 13 cols
[2022-05-20 17:21:56] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-20 17:21:56] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (OR (NOT p2) p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p1)), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (X (OR (NOT p2) p0))), true, (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (G (OR (NOT p2) p0)), (G (NOT (AND p2 (NOT p0)))), (G (NOT (AND p2 (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p1), (F (AND p2 (NOT p1) p0))]
Property proved to be true thanks to knowledge :(F (G (NOT p2)))
Knowledge based reduction with 18 factoid took 976 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA PermAdmissibility-COL-05-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLFireability-01 finished in 4451 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))||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 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 3 ms. Remains 28 /30 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 28 cols
[2022-05-20 17:21:57] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-20 17:21:57] [INFO ] Implicit Places using invariants in 127 ms returned [10, 11, 14, 16, 20, 21, 23, 24]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 129 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 2 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 135 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ 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 s10 1) (LT s11 1) (LT s15 1)), p1:(AND (GEQ s3 1) (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-02 finished in 294 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&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 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 17:21:57] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-20 17:21:57] [INFO ] Implicit Places using invariants in 82 ms returned [10, 11, 12, 13, 14, 16, 20, 21, 23, 24]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 84 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 133 ms :[true, (NOT p0), p0]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1) (GEQ s5 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8369 reset in 162 ms.
Product exploration explored 100000 steps with 8422 reset in 519 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 3 states, 4 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 1 ms. (steps per millisecond=43 )
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 158 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)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
// Phase 1: matrix 16 rows 18 cols
[2022-05-20 17:21:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:21:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-20 17:21:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 17:21:59] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-20 17:21:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 17:21:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-20 17:21:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 17:21:59] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-20 17:21:59] [INFO ] Computed and/alt/rep : 15/19/15 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-20 17:21:59] [INFO ] Added : 6 causal constraints over 2 iterations in 36 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 16/16 transitions.
Graph (complete) has 21 edges and 18 vertex of which 12 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 11 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 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 5 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 9 place count 7 transition count 5
Applied a total of 9 rules in 8 ms. Remains 7 /18 variables (removed 11) and now considering 5/16 (removed 11) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 17:21:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:21:59] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 17:21:59] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 17:21:59] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-20 17:21:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 17:21:59] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 17:21:59] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/18 places, 5/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/18 places, 5/16 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 179 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 32 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(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 158 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 32 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 17:22:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:22:00] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-20 17:22:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 17:22:00] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-20 17:22:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 17:22:00] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-20 17:22:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 17:22:00] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-20 17:22:00] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-20 17:22:00] [INFO ] Added : 4 causal constraints over 1 iterations in 11 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 15786 reset in 74 ms.
Product exploration explored 100000 steps with 15715 reset in 77 ms.
Built C files in :
/tmp/ltsmin6085700254429125765
[2022-05-20 17:22:00] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-20 17:22:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:22:00] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-20 17:22:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:22:00] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-20 17:22:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:22:00] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6085700254429125765
Running compilation step : cd /tmp/ltsmin6085700254429125765;'/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 281 ms.
Running link step : cd /tmp/ltsmin6085700254429125765;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin6085700254429125765;'/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/stateBased14081926046495204909.hoa' '--buchi-type=spotba'
LTSmin run took 97 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-05-LTLFireability-03 finished in 2920 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G((X(p1)&&G(F((p1 U p2))))))||p0)))'
Support contains 12 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:22:00] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 17:22:00] [INFO ] Implicit Places using invariants in 48 ms returned [4, 5, 10, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 50 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/30 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 24/30 places, 16/16 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s6 1) (GEQ s8 1) (GEQ s9 1)) (AND (GEQ s17 1) (GEQ s18 1) (GEQ s19 1))), p1:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s12 1)), p2:(AND (GEQ s16 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-06 finished in 277 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X((F(p2)&&p1)))||G(p3)))'
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Ensure Unique test removed 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 17:22:01] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 17:22:01] [INFO ] Implicit Places using invariants in 54 ms returned [4, 5, 10, 11, 12, 13, 21, 23]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 58 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 500 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p3), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p3 (NOT p1)), acceptance={} source=2 dest: 7}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 9}], [{ cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p3 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=4 dest: 7}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=4 dest: 8}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=4 dest: 9}, { cond=(AND p0 p3 (NOT p1)), acceptance={} source=4 dest: 10}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p3), acceptance={} source=7 dest: 5}, { cond=p3, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p3 (NOT p2)), acceptance={} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 5}, { cond=p0, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p0) p3), acceptance={} source=10 dest: 7}, { cond=(AND p0 (NOT p3)), acceptance={} source=10 dest: 9}, { cond=(AND p0 p3), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(AND (GEQ s14 1) (GEQ s16 1) (GEQ s17 1)), p3:(AND (GEQ s8 1) (GEQ s9 1) (GEQ s10 1)), p1:(AND (OR (AND (GEQ s8 1) (GEQ s9 1) (GEQ s10 1)) (AND (GEQ s1...], 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, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-07 finished in 603 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(F(!p0) U X((F(X(p2))&&p1))))'
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Ensure Unique test removed 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 17:22:01] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 17:22:01] [INFO ] Implicit Places using invariants in 60 ms returned [10, 11, 14, 16, 20, 21, 23, 24]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 62 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 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 469 ms :[true, (AND p2 (NOT p0)), (AND p1 p2), (AND p2 (NOT p0) p1), (AND p1 p2), (AND p1 p2), p2, (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 6}, { cond=(AND p0 p2), acceptance={} source=1 dest: 7}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 6}], [{ cond=p2, acceptance={} source=6 dest: 0}, { cond=(NOT p2), acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=2, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1) (GEQ s5 1)), p2:(AND (GEQ s2 1) (GEQ s4 1) (GEQ s5 1)), p1:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 31 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-08 finished in 558 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(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.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 17:22:02] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 17:22:02] [INFO ] Implicit Places using invariants in 67 ms returned [4, 5, 8, 10]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 90 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/30 places, 8/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 9 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 3 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 17:22:02] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:22:02] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 17:22:02] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 17:22:02] [INFO ] Implicit Places using invariants and state equation in 29 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 : 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 48 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-10 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 s6 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 25 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-10 finished in 227 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(X(G((F(p0)&&p1)))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 16/16 transitions.
Ensure Unique test removed 2 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 2 place count 27 transition count 15
Applied a total of 2 rules in 4 ms. Remains 27 /30 variables (removed 3) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 27 cols
[2022-05-20 17:22:02] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 17:22:02] [INFO ] Implicit Places using invariants in 54 ms returned [3, 4, 9, 10, 11, 12, 13, 15, 20, 22]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 55 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/30 places, 15/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 16 transition count 7
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 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 14 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 18 place count 7 transition count 5
Applied a total of 18 rules in 5 ms. Remains 7 /17 variables (removed 10) and now considering 5/15 (removed 10) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 17:22:02] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:22:02] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 17:22:02] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:22:02] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 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 90 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s2 1) (LT s4 1) (LT s6 1)), p0:(OR (LT s2 1) (LT s4 1) (LT s5 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 5769 reset in 118 ms.
Product exploration explored 100000 steps with 5770 reset in 209 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 p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 9 factoid took 396 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PermAdmissibility-COL-05-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLFireability-11 finished in 977 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G((F(p0) U !F(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 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 17:22:03] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-20 17:22:03] [INFO ] Implicit Places using invariants in 60 ms returned [4, 5, 10, 11, 20, 21, 23, 24]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 66 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 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 237 ms :[p1, p1, p1, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s9 1) (GEQ s15 1)), p0:(AND (GEQ s10 1) (GEQ s12 1) (GEQ s14 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 19814 steps with 3823 reset in 18 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-12 finished in 348 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F(F(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 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:22:03] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-20 17:22:03] [INFO ] Implicit Places using invariants in 86 ms returned [4, 5, 12, 13, 14, 15, 17, 22, 24]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 88 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 166 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s5 1) (GEQ s9 1)), p0:(OR (LT s14 1) (LT s16 1) (LT s19 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Product exploration explored 100000 steps with 50000 reset in 147 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 p1) p0), (X p1), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PermAdmissibility-COL-05-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLFireability-14 finished in 725 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&G(p1))))'
Support contains 9 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 2 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 2 place count 27 transition count 15
Applied a total of 2 rules in 2 ms. Remains 27 /30 variables (removed 3) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 27 cols
[2022-05-20 17:22:04] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-20 17:22:04] [INFO ] Implicit Places using invariants in 70 ms returned [9, 10, 13, 15, 20, 22]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 71 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/30 places, 15/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 20 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 18 transition count 12
Applied a total of 4 rules in 2 ms. Remains 18 /21 variables (removed 3) and now considering 12/15 (removed 3) transitions.
// Phase 1: matrix 12 rows 18 cols
[2022-05-20 17:22:04] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 17:22:04] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2022-05-20 17:22:04] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 17:22:04] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/30 places, 12/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 18/30 places, 12/16 transitions.
Stuttering acceptance computed with spot in 52 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s3 1) (LT s4 1) (LT s7 1) (LT s8 1) (LT s12 1)), p1:(OR (LT s13 1) (LT s15 1) (LT s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1639 reset in 143 ms.
Product exploration explored 100000 steps with 1639 reset in 160 ms.
Computed a total of 18 stabilizing places and 12 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 12
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 241 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 37 ms :[(OR (NOT p1) (NOT p0))]
Finished random walk after 55 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (OR (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 275 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 36 ms :[(OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 51 ms :[(OR (NOT p1) (NOT p0))]
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 18 cols
[2022-05-20 17:22:05] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-20 17:22:05] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2022-05-20 17:22:05] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 17:22:05] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-20 17:22:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2022-05-20 17:22:05] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-20 17:22:05] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 12/12 transitions.
Computed a total of 18 stabilizing places and 12 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 12
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 339 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 49 ms :[(OR (NOT p1) (NOT p0))]
Finished random walk after 55 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=55 )
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (OR (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 310 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 51 ms :[(OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 50 ms :[(OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 42 ms :[(OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1639 reset in 231 ms.
Product exploration explored 100000 steps with 1639 reset in 261 ms.
Built C files in :
/tmp/ltsmin376545792242058305
[2022-05-20 17:22:07] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2022-05-20 17:22:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:22:07] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2022-05-20 17:22:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:22:07] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2022-05-20 17:22:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:22:07] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin376545792242058305
Running compilation step : cd /tmp/ltsmin376545792242058305;'/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/ltsmin376545792242058305;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin376545792242058305;'/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/stateBased9656591468091750330.hoa' '--buchi-type=spotba'
LTSmin run took 243 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-05-LTLFireability-15 finished in 3256 ms.
All properties solved by simple procedures.
Total runtime 17245 ms.

BK_STOP 1653067328263

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

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