Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r199-smll-167840346200588.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is HouseConstruction-PT-02000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840346200588
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.6K Feb 25 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 25 13:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 242K Feb 25 13:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 13:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 13K Mar 5 18:22 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 HouseConstruction-PT-02000-LTLFireability-00
FORMULA_NAME HouseConstruction-PT-02000-LTLFireability-01
FORMULA_NAME HouseConstruction-PT-02000-LTLFireability-02
FORMULA_NAME HouseConstruction-PT-02000-LTLFireability-03
FORMULA_NAME HouseConstruction-PT-02000-LTLFireability-04
FORMULA_NAME HouseConstruction-PT-02000-LTLFireability-05
FORMULA_NAME HouseConstruction-PT-02000-LTLFireability-06
FORMULA_NAME HouseConstruction-PT-02000-LTLFireability-07
FORMULA_NAME HouseConstruction-PT-02000-LTLFireability-08
FORMULA_NAME HouseConstruction-PT-02000-LTLFireability-09
FORMULA_NAME HouseConstruction-PT-02000-LTLFireability-10
FORMULA_NAME HouseConstruction-PT-02000-LTLFireability-11
FORMULA_NAME HouseConstruction-PT-02000-LTLFireability-12
FORMULA_NAME HouseConstruction-PT-02000-LTLFireability-13
FORMULA_NAME HouseConstruction-PT-02000-LTLFireability-14
FORMULA_NAME HouseConstruction-PT-02000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678566263806

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-02000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 20:24:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 20:24:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 20:24:27] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-11 20:24:27] [INFO ] Transformed 26 places.
[2023-03-11 20:24:27] [INFO ] Transformed 18 transitions.
[2023-03-11 20:24:27] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HouseConstruction-PT-02000-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-02000-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 19 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-11 20:24:27] [INFO ] Computed 7 place invariants in 5 ms
[2023-03-11 20:24:27] [INFO ] Implicit Places using invariants in 192 ms returned [9, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 247 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/26 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 269 ms. Remains : 23/26 places, 18/18 transitions.
Support contains 19 out of 23 places after structural reductions.
[2023-03-11 20:24:28] [INFO ] Flatten gal took : 23 ms
[2023-03-11 20:24:28] [INFO ] Flatten gal took : 7 ms
[2023-03-11 20:24:28] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 17) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 4) seen :3
Finished Best-First random walk after 538 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=107 )
FORMULA HouseConstruction-PT-02000-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 23 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 18
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Graph (complete) has 25 edges and 23 vertex of which 9 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 6
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 7 transition count 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 10 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 2 transition count 2
Applied a total of 12 rules in 144 ms. Remains 2 /23 variables (removed 21) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-11 20:24:28] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 20:24:28] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 20:24:28] [INFO ] Invariant cache hit.
[2023-03-11 20:24:29] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-11 20:24:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 20:24:29] [INFO ] Invariant cache hit.
[2023-03-11 20:24:29] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/23 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 244 ms. Remains : 2/23 places, 2/18 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-02000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s1 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 24 reset in 332 ms.
Product exploration explored 100000 steps with 24 reset in 185 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-02000-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-02000-LTLFireability-00 finished in 1385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-11 20:24:30] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-11 20:24:30] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-11 20:24:30] [INFO ] Invariant cache hit.
[2023-03-11 20:24:30] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-11 20:24:30] [INFO ] Invariant cache hit.
[2023-03-11 20:24:30] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 255 ms. Remains : 23/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-02000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s17 1) (GEQ s18 1) (GEQ s21 1)), p1:(OR (LT s3 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-02000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-02000-LTLFireability-01 finished in 470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((F(G(!p1))&&p0) U X(X((p1 U (p2||G(p1)))))))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-11 20:24:30] [INFO ] Invariant cache hit.
[2023-03-11 20:24:30] [INFO ] Implicit Places using invariants in 38 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 22/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 495 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, false, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), p1]
Running random walk in product with property : HouseConstruction-PT-02000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 6}, { cond=(NOT p0), acceptance={} source=3 dest: 7}, { cond=p0, acceptance={} source=3 dest: 8}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 9}], [{ cond=(NOT p2), acceptance={} source=7 dest: 4}], [{ cond=(NOT p2), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=8 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={} source=9 dest: 9}, { cond=p1, acceptance={0} source=9 dest: 9}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s10 1)), p1:(OR (LT s3 1) (LT s7 1)), p2:(AND (NOT (AND (GEQ s3 1) (GEQ s7 1))) (LT s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 38321 steps with 467 reset in 221 ms.
FORMULA HouseConstruction-PT-02000-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-02000-LTLFireability-03 finished in 791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0)||X(p1))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-11 20:24:31] [INFO ] Invariant cache hit.
[2023-03-11 20:24:31] [INFO ] Implicit Places using invariants in 69 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 71 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : HouseConstruction-PT-02000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LT s12 1), p1:(LT s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 237 ms.
Product exploration explored 100000 steps with 33333 reset in 119 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
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 p0), (X (X (NOT (AND p0 (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p0 (NOT p1)))))
Knowledge based reduction with 5 factoid took 241 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-02000-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-02000-LTLFireability-04 finished in 972 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-11 20:24:32] [INFO ] Invariant cache hit.
[2023-03-11 20:24:32] [INFO ] Implicit Places using invariants in 77 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 81 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-02000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(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][false, false]]
Product exploration explored 100000 steps with 6369 reset in 123 ms.
Product exploration explored 100000 steps with 6412 reset in 161 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
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 206 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3335 ) properties (out of 1) seen :0
Finished Best-First random walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
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 235 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2023-03-11 20:24:33] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-11 20:24:33] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-11 20:24:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:24:33] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-11 20:24:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 20:24:33] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-11 20:24:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 20:24:33] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-11 20:24:33] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 20:24:33] [INFO ] Added : 17 causal constraints over 4 iterations in 56 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Graph (complete) has 22 edges and 21 vertex of which 6 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 12 output transitions
Drop transitions removed 12 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 5 transition count 3
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 2 transition count 2
Applied a total of 7 rules in 64 ms. Remains 2 /21 variables (removed 19) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-11 20:24:33] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 20:24:33] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-11 20:24:33] [INFO ] Invariant cache hit.
[2023-03-11 20:24:33] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-11 20:24:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 20:24:33] [INFO ] Invariant cache hit.
[2023-03-11 20:24:33] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/21 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154 ms. Remains : 2/21 places, 2/18 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-02000-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-02000-LTLFireability-05 finished in 1766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(!p0))))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Graph (complete) has 25 edges and 23 vertex of which 11 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 10 transition count 6
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 7 transition count 6
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 7 place count 7 transition count 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 14 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 2 transition count 2
Applied a total of 16 rules in 78 ms. Remains 2 /23 variables (removed 21) and now considering 2/18 (removed 16) transitions.
[2023-03-11 20:24:34] [INFO ] Invariant cache hit.
[2023-03-11 20:24:34] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 20:24:34] [INFO ] Invariant cache hit.
[2023-03-11 20:24:34] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-11 20:24:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 20:24:34] [INFO ] Invariant cache hit.
[2023-03-11 20:24:34] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/23 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 162 ms. Remains : 2/23 places, 2/18 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, p0]
Running random walk in product with property : HouseConstruction-PT-02000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s1 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, null][true, true]]
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-02000-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-02000-LTLFireability-06 finished in 782 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p1)&&p0))||G(p2))))'
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 14
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 19 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 18 transition count 13
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 8 place count 18 transition count 9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 16 place count 14 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 17 place count 13 transition count 9
Applied a total of 17 rules in 66 ms. Remains 13 /23 variables (removed 10) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2023-03-11 20:24:35] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-11 20:24:35] [INFO ] Implicit Places using invariants in 37 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/23 places, 9/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 108 ms. Remains : 12/23 places, 9/18 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-02000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s9 1) (GEQ s11 1)), p2:(OR (GEQ s1 1) (AND (GEQ s5 1) (GEQ s6 1))), p1:(GEQ s1 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 43502 steps with 21 reset in 144 ms.
FORMULA HouseConstruction-PT-02000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-02000-LTLFireability-07 finished in 401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 17 transition count 12
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 17 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 13 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 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 19 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 21 place count 11 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 8 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 7 transition count 5
Applied a total of 26 rules in 189 ms. Remains 7 /23 variables (removed 16) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-11 20:24:35] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 20:24:35] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-11 20:24:35] [INFO ] Invariant cache hit.
[2023-03-11 20:24:35] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-11 20:24:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 20:24:35] [INFO ] Invariant cache hit.
[2023-03-11 20:24:35] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/23 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 309 ms. Remains : 7/23 places, 5/18 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-02000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LT s6 1), p1:(AND (GEQ s6 1) (GEQ s2 1) (GEQ s3 1) (GEQ s5 1))], nbAcceptance=2, 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 9 reset in 210 ms.
Product exploration explored 100000 steps with 9 reset in 252 ms.
Computed a total of 7 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 510 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-02000-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-02000-LTLFireability-08 finished in 1407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X((F((p1 U (p2||G(p1))))||G(p0)))))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Graph (complete) has 25 edges and 23 vertex of which 9 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 8 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 6 transition count 6
Applied a total of 6 rules in 4 ms. Remains 6 /23 variables (removed 17) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-11 20:24:36] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 20:24:36] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-11 20:24:36] [INFO ] Invariant cache hit.
[2023-03-11 20:24:36] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-11 20:24:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 20:24:36] [INFO ] Invariant cache hit.
[2023-03-11 20:24:36] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/23 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 6/23 places, 6/18 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-02000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(LT s1 1), p2:(AND (GEQ s5 1) (LT s3 1)), p1:(LT s3 1)], nbAcceptance=2, 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 333 reset in 136 ms.
Product exploration explored 100000 steps with 493 reset in 179 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (G p0)), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 11 factoid took 751 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-02000-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-02000-LTLFireability-09 finished in 1513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(!p0)||F(!p1))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Graph (complete) has 25 edges and 23 vertex of which 12 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 11 transition count 7
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 8 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 7 place count 8 transition count 4
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 14 place count 4 transition count 4
Applied a total of 14 rules in 62 ms. Remains 4 /23 variables (removed 19) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-11 20:24:38] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 20:24:38] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 20:24:38] [INFO ] Invariant cache hit.
[2023-03-11 20:24:38] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-11 20:24:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 20:24:38] [INFO ] Invariant cache hit.
[2023-03-11 20:24:38] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/23 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 4/23 places, 4/18 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND p0 p1), p1]
Running random walk in product with property : HouseConstruction-PT-02000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1 1), p1:(LT s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10746 reset in 90 ms.
Product exploration explored 100000 steps with 10718 reset in 120 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 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 : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 291 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND p0 p1), p1]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2001 ) properties (out of 2) seen :1
Finished Best-First random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 353 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 109 ms :[(AND p0 p1), p1]
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-11 20:24:39] [INFO ] Invariant cache hit.
[2023-03-11 20:24:39] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 20:24:39] [INFO ] Invariant cache hit.
[2023-03-11 20:24:39] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-11 20:24:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 20:24:39] [INFO ] Invariant cache hit.
[2023-03-11 20:24:39] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 4/4 places, 4/4 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 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 : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 301 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND p0 p1), p1]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2001 ) properties (out of 2) seen :1
Finished Best-First random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 350 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 111 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 96 ms :[(AND p0 p1), p1]
Product exploration explored 100000 steps with 10531 reset in 89 ms.
Product exploration explored 100000 steps with 10961 reset in 122 ms.
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 4/4 transitions.
Applied a total of 0 rules in 2 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-11 20:24:41] [INFO ] Invariant cache hit.
[2023-03-11 20:24:41] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-11 20:24:41] [INFO ] Invariant cache hit.
[2023-03-11 20:24:41] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-11 20:24:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 20:24:41] [INFO ] Invariant cache hit.
[2023-03-11 20:24:41] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 4/4 places, 4/4 transitions.
Treatment of property HouseConstruction-PT-02000-LTLFireability-10 finished in 3163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U (!p0||G(p1))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Graph (complete) has 25 edges and 23 vertex of which 8 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 5 transition count 4
Applied a total of 5 rules in 58 ms. Remains 5 /23 variables (removed 18) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 5 cols
[2023-03-11 20:24:41] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 20:24:41] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-11 20:24:41] [INFO ] Invariant cache hit.
[2023-03-11 20:24:41] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-11 20:24:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 20:24:41] [INFO ] Invariant cache hit.
[2023-03-11 20:24:41] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/23 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154 ms. Remains : 5/23 places, 4/18 transitions.
Stuttering acceptance computed with spot in 108 ms :[p0, (AND p0 (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-02000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s3 1)), p1:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 15203 reset in 129 ms.
Product exploration explored 100000 steps with 15087 reset in 145 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 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 : [(AND p0 p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 7 factoid took 614 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[p0, (AND p0 (NOT p1))]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1667 ) properties (out of 3) seen :2
Finished Best-First random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND p0 p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 609 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[p0, (AND p0 (NOT p1))]
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-11 20:24:43] [INFO ] Invariant cache hit.
[2023-03-11 20:24:43] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 20:24:43] [INFO ] Invariant cache hit.
[2023-03-11 20:24:43] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-11 20:24:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 20:24:43] [INFO ] Invariant cache hit.
[2023-03-11 20:24:43] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 5/5 places, 4/4 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 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 : [(AND p0 p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 7 factoid took 461 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[p0, (AND p0 (NOT p1))]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1667 ) properties (out of 3) seen :2
Finished Best-First random walk after 17 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p0 p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 602 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[p0, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 15074 reset in 115 ms.
Product exploration explored 100000 steps with 15085 reset in 134 ms.
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-11 20:24:45] [INFO ] Invariant cache hit.
[2023-03-11 20:24:45] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-11 20:24:45] [INFO ] Invariant cache hit.
[2023-03-11 20:24:45] [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.
[2023-03-11 20:24:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 20:24:45] [INFO ] Invariant cache hit.
[2023-03-11 20:24:45] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 5/5 places, 4/4 transitions.
Treatment of property HouseConstruction-PT-02000-LTLFireability-11 finished in 4129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||X((p0 U X((!p0&&X(F(p1))))))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-11 20:24:45] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-11 20:24:45] [INFO ] Implicit Places using invariants in 45 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 396 ms :[(NOT p1), (AND (NOT p1) p0), p0, p0, p0, (OR (NOT p1) p0), true, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : HouseConstruction-PT-02000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=p0, acceptance={} source=5 dest: 7}, { cond=(NOT p0), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 0}, { cond=p0, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 6}]], initial=2, aps=[p1:(LT s1 1), p0:(LT s3 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][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 34 reset in 252 ms.
Product exploration explored 100000 steps with 72 reset in 311 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
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 p0), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 9 states, 16 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[p0, p0]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1429 ) properties (out of 1) seen :0
Finished Best-First random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 298 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[p0]
Stuttering acceptance computed with spot in 51 ms :[p0]
// Phase 1: matrix 18 rows 21 cols
[2023-03-11 20:24:47] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 20:24:47] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-11 20:24:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:24:47] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-11 20:24:47] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-11 20:24:47] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Graph (complete) has 22 edges and 21 vertex of which 4 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Applied a total of 1 rules in 2 ms. Remains 4 /21 variables (removed 17) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-11 20:24:47] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 20:24:47] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-11 20:24:47] [INFO ] Invariant cache hit.
[2023-03-11 20:24:47] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-11 20:24:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 20:24:47] [INFO ] Invariant cache hit.
[2023-03-11 20:24:47] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/21 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 4/21 places, 4/18 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 260 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[p0]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2501 ) properties (out of 1) seen :0
Finished Best-First random walk after 17 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 242 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[p0]
Stuttering acceptance computed with spot in 49 ms :[p0]
[2023-03-11 20:24:48] [INFO ] Invariant cache hit.
[2023-03-11 20:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:24:48] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-11 20:24:48] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-11 20:24:48] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 50 ms :[p0]
Product exploration explored 100000 steps with 15073 reset in 116 ms.
Product exploration explored 100000 steps with 15166 reset in 98 ms.
Support contains 1 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 4/4 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 3 transition count 2
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 2 transition count 2
Applied a total of 2 rules in 57 ms. Remains 2 /4 variables (removed 2) and now considering 2/4 (removed 2) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-11 20:24:48] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 20:24:48] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-11 20:24:48] [INFO ] Invariant cache hit.
[2023-03-11 20:24:48] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-11 20:24:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 20:24:48] [INFO ] Invariant cache hit.
[2023-03-11 20:24:48] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/4 places, 2/4 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 2/4 places, 2/4 transitions.
Treatment of property HouseConstruction-PT-02000-LTLFireability-12 finished in 3230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Graph (complete) has 25 edges and 23 vertex of which 2 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 2 ms. Remains 2 /23 variables (removed 21) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-11 20:24:48] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 20:24:48] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 20:24:48] [INFO ] Invariant cache hit.
[2023-03-11 20:24:48] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-11 20:24:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 20:24:48] [INFO ] Invariant cache hit.
[2023-03-11 20:24:48] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/23 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 2/23 places, 2/18 transitions.
Stuttering acceptance computed with spot in 40 ms :[p0]
Running random walk in product with property : HouseConstruction-PT-02000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s1 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 4000 steps with 0 reset in 2 ms.
FORMULA HouseConstruction-PT-02000-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-02000-LTLFireability-13 finished in 141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(!p0)||F(!p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U (!p0||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||X((p0 U X((!p0&&X(F(p1))))))))'
[2023-03-11 20:24:49] [INFO ] Flatten gal took : 7 ms
[2023-03-11 20:24:49] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-11 20:24:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 23 places, 18 transitions and 45 arcs took 0 ms.
Total runtime 22302 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT HouseConstruction-PT-02000
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

BK_STOP 1678566331344

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 HouseConstruction-PT-02000-LTLFireability-10
lola: time limit : 1200 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HouseConstruction-PT-02000-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
HouseConstruction-PT-02000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
HouseConstruction-PT-02000-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1200 27/32 HouseConstruction-PT-02000-LTLFireability-10 4022395 m, 804479 m/sec, 6039772 t fired, .

Time elapsed: 5 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for HouseConstruction-PT-02000-LTLFireability-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HouseConstruction-PT-02000-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
HouseConstruction-PT-02000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
HouseConstruction-PT-02000-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 10 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 7 (type EXCL) for 6 HouseConstruction-PT-02000-LTLFireability-12
lola: time limit : 1795 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HouseConstruction-PT-02000-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
HouseConstruction-PT-02000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
HouseConstruction-PT-02000-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1795 11/32 HouseConstruction-PT-02000-LTLFireability-12 1681995 m, 336399 m/sec, 5169024 t fired, .

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HouseConstruction-PT-02000-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
HouseConstruction-PT-02000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
HouseConstruction-PT-02000-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1795 20/32 HouseConstruction-PT-02000-LTLFireability-12 3076119 m, 278824 m/sec, 9774077 t fired, .

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HouseConstruction-PT-02000-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
HouseConstruction-PT-02000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
HouseConstruction-PT-02000-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1795 29/32 HouseConstruction-PT-02000-LTLFireability-12 4440564 m, 272889 m/sec, 14245350 t fired, .

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 7 (type EXCL) for HouseConstruction-PT-02000-LTLFireability-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HouseConstruction-PT-02000-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
HouseConstruction-PT-02000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
HouseConstruction-PT-02000-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 4 (type EXCL) for 3 HouseConstruction-PT-02000-LTLFireability-11
lola: time limit : 3570 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HouseConstruction-PT-02000-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
HouseConstruction-PT-02000-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
HouseConstruction-PT-02000-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3570 25/32 HouseConstruction-PT-02000-LTLFireability-11 3850516 m, 770103 m/sec, 4007275 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for HouseConstruction-PT-02000-LTLFireability-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HouseConstruction-PT-02000-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
HouseConstruction-PT-02000-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
HouseConstruction-PT-02000-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HouseConstruction-PT-02000-LTLFireability-10: LTL unknown AGGR
HouseConstruction-PT-02000-LTLFireability-11: LTL unknown AGGR
HouseConstruction-PT-02000-LTLFireability-12: LTL unknown AGGR


Time elapsed: 40 secs. Pages in use: 32

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="HouseConstruction-PT-02000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is HouseConstruction-PT-02000, 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 r199-smll-167840346200588"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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