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.r201-smll-167840347900532.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 ltsminxred
Input is HouseConstruction-PT-00010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347900532
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 7.2K Feb 25 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 13:05 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:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 13:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:15 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-00010-LTLFireability-00
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-01
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-02
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-03
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-04
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-05
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-06
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-07
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-08
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-09
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-10
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-11
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-12
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-13
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-14
FORMULA_NAME HouseConstruction-PT-00010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678769562517

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-00010
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-14 04:52:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 04:52:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 04:52:45] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-14 04:52:45] [INFO ] Transformed 26 places.
[2023-03-14 04:52:45] [INFO ] Transformed 18 transitions.
[2023-03-14 04:52:45] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HouseConstruction-PT-00010-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00010-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00010-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 14 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2023-03-14 04:52:45] [INFO ] Computed 8 place invariants in 5 ms
[2023-03-14 04:52:45] [INFO ] Implicit Places using invariants in 184 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 246 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/26 places, 18/18 transitions.
Applied a total of 0 rules in 3 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 264 ms. Remains : 23/26 places, 18/18 transitions.
Support contains 20 out of 23 places after structural reductions.
[2023-03-14 04:52:45] [INFO ] Flatten gal took : 22 ms
[2023-03-14 04:52:46] [INFO ] Flatten gal took : 7 ms
[2023-03-14 04:52:46] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10005 steps, including 50 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 19) seen :18
Finished Best-First random walk after 532 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=106 )
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' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-14 04:52:46] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-14 04:52:46] [INFO ] Implicit Places using invariants in 58 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 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 62 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 287 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LT s7 1) (AND (OR (LT s17 1) (LT s18 1)) (LT s1 1))), p0:(AND (GEQ s17 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 284 ms.
Product exploration explored 100000 steps with 50000 reset in 219 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 (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 9 factoid took 166 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00010-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00010-LTLFireability-00 finished in 1204 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))||G(p1)))'
Support contains 3 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-14 04:52:47] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-14 04:52:47] [INFO ] Implicit Places using invariants in 49 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 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 54 ms. Remains : 22/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(OR (LT s13 1) (LT s14 1)), p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 62 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLFireability-02 finished in 236 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((G((F(G(p0)) U p1))||X(p2)))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-14 04:52:48] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-14 04:52:48] [INFO ] Implicit Places using invariants in 61 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 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 66 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s15 1), p2:(GEQ s2 1), p0:(GEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 232 steps with 14 reset in 2 ms.
FORMULA HouseConstruction-PT-00010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLFireability-03 finished in 417 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) U X(p2))||X(p3)))))'
Support contains 7 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-03-14 04:52:48] [INFO ] Invariant cache hit.
[2023-03-14 04:52:48] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-14 04:52:48] [INFO ] Invariant cache hit.
[2023-03-14 04:52:48] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-14 04:52:48] [INFO ] Invariant cache hit.
[2023-03-14 04:52:48] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 22/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 401 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=5 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=5 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=7 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s12 1), p1:(AND (GEQ s8 1) (GEQ s9 1)), p2:(AND (GEQ s16 1) (GEQ s17 1) (GEQ s20 1)), p3:(GEQ s5 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7357 reset in 305 ms.
Product exploration explored 100000 steps with 7388 reset in 218 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 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 (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (AND (NOT p2) (NOT p3))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p3)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 24 factoid took 2443 ms. Reduced automaton from 8 states, 34 edges and 4 AP (stutter sensitive) to 16 states, 63 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 782 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), false, (AND (NOT p0) (NOT p3) (NOT p2) p1), false, false, false, false, false, false, false, false, false]
Incomplete random walk after 10005 steps, including 50 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 18) seen :16
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :1
Finished Best-First random walk after 3882 steps, including 4 resets, run visited all 1 properties in 8 ms. (steps per millisecond=485 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (AND (NOT p2) (NOT p3))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p3)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (F (AND p0 (NOT p3) (NOT p2) p1)), (F (OR (AND p0 (NOT p1)) (AND p3 (NOT p1)) (AND p2 (NOT p1)))), (F (OR (AND p0 (NOT p2) p1) (AND p3 (NOT p2) p1))), (F (AND (NOT p0) (NOT p3) (NOT p2) p1)), (F (AND (NOT p0) p3 (NOT p2) p1)), (F (OR (AND (NOT p0) p3 p1) (AND (NOT p0) p2 p1))), (F (AND p0 (NOT p3) (NOT p2) (NOT p1))), (F (AND (NOT p0) p3 p2 (NOT p1))), (F (AND (NOT p0) (NOT p3) p2 (NOT p1))), (F (OR (AND p0 (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p2) p1))), (F (OR p0 p3 p2 p1)), (F (AND p0 p3 (NOT p2) (NOT p1))), (F (OR (AND (NOT p0) p3 (NOT p1)) (AND (NOT p0) p2 (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (F (AND (NOT p0) p3 (NOT p2) (NOT p1))), (F (OR (AND p0 p1) (AND p3 p1) (AND p2 p1)))]
Knowledge based reduction with 24 factoid took 2622 ms. Reduced automaton from 16 states, 63 edges and 4 AP (stutter insensitive) to 16 states, 63 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 849 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), false, (AND (NOT p0) (NOT p3) (NOT p2) p1), false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 817 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), false, (AND (NOT p0) (NOT p3) (NOT p2) p1), false, false, false, false, false, false, false, false, false]
[2023-03-14 04:52:57] [INFO ] Invariant cache hit.
[2023-03-14 04:52:57] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-14 04:52:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 04:52:57] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-14 04:52:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 04:52:57] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-14 04:52:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 04:52:57] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-14 04:52:57] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-14 04:52:57] [INFO ] Added : 17 causal constraints over 4 iterations in 59 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2) (NOT p3))
Support contains 7 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 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 2 place count 21 transition count 15
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 19 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 17 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 17 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 15 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 13 place count 14 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 14 place count 13 transition count 10
Applied a total of 14 rules in 31 ms. Remains 13 /22 variables (removed 9) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2023-03-14 04:52:57] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-14 04:52:57] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-14 04:52:57] [INFO ] Invariant cache hit.
[2023-03-14 04:52:57] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-14 04:52:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 04:52:57] [INFO ] Invariant cache hit.
[2023-03-14 04:52:57] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/22 places, 10/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 13/22 places, 10/18 transitions.
Computed a total of 13 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 13 transition count 10
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (NOT (OR (AND p0 (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p2) p1)))), (X (NOT (AND (NOT p0) p3 (NOT p2) p1))), (X (NOT (AND p0 (NOT p3) (NOT p2) p1))), (X (NOT (OR (AND p0 (NOT p2) p1) (AND p3 (NOT p2) p1)))), (X (NOT (AND (NOT p0) p3 p2 (NOT p1)))), (X (NOT (AND p0 p3 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p3 p1) (AND (NOT p0) p2 p1)))), (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR (AND p0 p1) (AND p3 p1) (AND p2 p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (X (X (NOT (OR (AND p0 (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p2) p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p3 p2 (NOT p1))))), (X (X (NOT (AND p0 p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p1)) (AND p3 (NOT p1)) (AND p2 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p3 (NOT p1)) (AND p2 (NOT p1))))), (X (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (AND (NOT p0) p3 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1)))), (X (OR (AND (NOT p0) p3 (NOT p1)) (AND (NOT p0) p2 (NOT p1)))), (X (NOT (OR (AND (NOT p0) p3 (NOT p1)) (AND (NOT p0) p2 (NOT p1))))), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (OR p0 p3 p2 p1)), (X (NOT (OR p0 p3 p2 p1))), (X (X (OR (AND p0 (NOT p1)) (AND p3 (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p3 (NOT p1)) (AND p2 (NOT p1)))))), (X (X (AND (NOT p0) p3 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p3 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (OR (AND p0 (NOT p2) p1) (AND p3 (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p2) p1) (AND p3 (NOT p2) p1))))), (X (X (AND (NOT p0) p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1))))), (X (X (OR (AND (NOT p0) p3 p1) (AND (NOT p0) p2 p1)))), (X (X (NOT (OR (AND (NOT p0) p3 p1) (AND (NOT p0) p2 p1))))), (X (X (OR (AND (NOT p0) p3 (NOT p1)) (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p3 (NOT p1)) (AND (NOT p0) p2 (NOT p1)))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (OR (AND p0 p1) (AND p3 p1) (AND p2 p1)))), (X (X (NOT (OR (AND p0 p1) (AND p3 p1) (AND p2 p1))))), (X (X (OR p0 p3 p2 p1))), (X (X (NOT (OR p0 p3 p2 p1))))]
Knowledge based reduction with 24 factoid took 3034 ms. Reduced automaton from 16 states, 63 edges and 4 AP (stutter insensitive) to 16 states, 63 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 958 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), false, (AND (NOT p2) p1 (NOT p3) (NOT p0)), false, false, false, false, false, false, false, false, false]
Incomplete random walk after 10001 steps, including 90 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 18) seen :17
Finished Best-First random walk after 69 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=69 )
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (NOT (OR (AND p0 (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p2) p1)))), (X (NOT (AND (NOT p0) p3 (NOT p2) p1))), (X (NOT (AND p0 (NOT p3) (NOT p2) p1))), (X (NOT (OR (AND p0 (NOT p2) p1) (AND p3 (NOT p2) p1)))), (X (NOT (AND (NOT p0) p3 p2 (NOT p1)))), (X (NOT (AND p0 p3 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p3 p1) (AND (NOT p0) p2 p1)))), (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR (AND p0 p1) (AND p3 p1) (AND p2 p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (X (X (NOT (OR (AND p0 (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p2) p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p3 p2 (NOT p1))))), (X (X (NOT (AND p0 p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p1)) (AND p3 (NOT p1)) (AND p2 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p3 (NOT p1)) (AND p2 (NOT p1))))), (X (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (AND (NOT p0) p3 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1)))), (X (OR (AND (NOT p0) p3 (NOT p1)) (AND (NOT p0) p2 (NOT p1)))), (X (NOT (OR (AND (NOT p0) p3 (NOT p1)) (AND (NOT p0) p2 (NOT p1))))), (X (AND (NOT p3) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (OR p0 p3 p2 p1)), (X (NOT (OR p0 p3 p2 p1))), (X (X (OR (AND p0 (NOT p1)) (AND p3 (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p3 (NOT p1)) (AND p2 (NOT p1)))))), (X (X (AND (NOT p0) p3 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p3 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (OR (AND p0 (NOT p2) p1) (AND p3 (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p2) p1) (AND p3 (NOT p2) p1))))), (X (X (AND (NOT p0) p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1))))), (X (X (OR (AND (NOT p0) p3 p1) (AND (NOT p0) p2 p1)))), (X (X (NOT (OR (AND (NOT p0) p3 p1) (AND (NOT p0) p2 p1))))), (X (X (OR (AND (NOT p0) p3 (NOT p1)) (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p3 (NOT p1)) (AND (NOT p0) p2 (NOT p1)))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (OR (AND p0 p1) (AND p3 p1) (AND p2 p1)))), (X (X (NOT (OR (AND p0 p1) (AND p3 p1) (AND p2 p1))))), (X (X (OR p0 p3 p2 p1))), (X (X (NOT (OR p0 p3 p2 p1)))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (F (AND (NOT p2) p1 (NOT p3) p0)), (F (OR (AND p2 (NOT p1)) (AND (NOT p1) p3) (AND (NOT p1) p0))), (F (OR (AND (NOT p2) p1 p3) (AND (NOT p2) p1 p0))), (F (AND (NOT p2) p1 (NOT p3) (NOT p0))), (F (AND (NOT p2) p1 p3 (NOT p0))), (F (OR (AND p2 p1 (NOT p0)) (AND p1 p3 (NOT p0)))), (F (AND p2 (NOT p1) p3 (NOT p0))), (F (AND (NOT p2) (NOT p1) (NOT p3) p0)), (F (AND p2 (NOT p1) (NOT p3) (NOT p0))), (F (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) (NOT p3) p0))), (F (OR p2 p1 p3 p0)), (F (AND (NOT p2) (NOT p1) p3 p0)), (F (OR (AND p2 (NOT p1) (NOT p0)) (AND (NOT p1) p3 (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)))), (F (AND (NOT p2) (NOT p1) p3 (NOT p0))), (F (OR (AND p2 p1) (AND p1 p3) (AND p1 p0)))]
Knowledge based reduction with 24 factoid took 3990 ms. Reduced automaton from 16 states, 63 edges and 4 AP (stutter insensitive) to 16 states, 63 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 842 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), false, (AND (NOT p2) p1 (NOT p3) (NOT p0)), false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 749 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), false, (AND (NOT p2) p1 (NOT p3) (NOT p0)), false, false, false, false, false, false, false, false, false]
[2023-03-14 04:53:07] [INFO ] Invariant cache hit.
[2023-03-14 04:53:07] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-14 04:53:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 04:53:07] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-14 04:53:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 04:53:07] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-14 04:53:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 04:53:07] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-14 04:53:07] [INFO ] Computed and/alt/rep : 8/11/8 causal constraints (skipped 0 transitions) in 19 ms.
[2023-03-14 04:53:07] [INFO ] Added : 8 causal constraints over 2 iterations in 45 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 997 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), false, (AND (NOT p2) p1 (NOT p3) (NOT p0)), false, false, false, false, false, false, false, false, false]
Stuttering criterion allowed to conclude after 16726 steps with 2124 reset in 58 ms.
FORMULA HouseConstruction-PT-00010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLFireability-04 finished in 20197 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((F(!p0)&&X((G(F(p0))&&(X(!p1) U ((!p1&&X(!p1))||X(G(!p1)))))))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-14 04:53:08] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-14 04:53:08] [INFO ] Implicit Places using invariants in 34 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 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 50 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 307 ms :[true, (OR (NOT p0) p1), p0, (NOT p0), (NOT p0), p1, false, (AND p0 p1)]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=true, acceptance={} source=1 dest: 5}, { cond=p1, acceptance={} source=1 dest: 6}, { cond=p0, acceptance={} source=1 dest: 7}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 4}, { cond=p1, acceptance={0} source=5 dest: 5}, { cond=p1, acceptance={0} source=5 dest: 6}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=7 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s9 1)), p1:(GEQ 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][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10404 reset in 78 ms.
Product exploration explored 100000 steps with 10500 reset in 198 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 (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 906 ms. Reduced automaton from 8 states, 19 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 56 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=56 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 11 factoid took 497 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2023-03-14 04:53:11] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-14 04:53:11] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-14 04:53:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 04:53:11] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-14 04:53:11] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-14 04:53:11] [INFO ] Added : 17 causal constraints over 4 iterations in 40 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 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 12 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 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.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 7 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 6 transition count 5
Applied a total of 10 rules in 4 ms. Remains 6 /21 variables (removed 15) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 6 cols
[2023-03-14 04:53:11] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-14 04:53:11] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-14 04:53:11] [INFO ] Invariant cache hit.
[2023-03-14 04:53:11] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-14 04:53:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 04:53:11] [INFO ] Invariant cache hit.
[2023-03-14 04:53:11] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/21 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 6/21 places, 5/18 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2023-03-14 04:53:12] [INFO ] Invariant cache hit.
[2023-03-14 04:53:12] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 04:53:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 04:53:12] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-14 04:53:12] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 04:53:12] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 74 steps with 5 reset in 0 ms.
FORMULA HouseConstruction-PT-00010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLFireability-05 finished in 3637 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(((p0||X((p1||(p2 U !p3)))) U (G((p0||X((p1||(p2 U !p3)))))||(!p2&&(p0||X((p1||(p2 U !p3)))))))))'
Support contains 8 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-14 04:53:12] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-14 04:53:12] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-14 04:53:12] [INFO ] Invariant cache hit.
[2023-03-14 04:53:12] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-14 04:53:12] [INFO ] Invariant cache hit.
[2023-03-14 04:53:12] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 23/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) p3), true, p3]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1) p3), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p3), acceptance={0} source=4 dest: 3}, { cond=(AND p2 p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s17 1) (GEQ s18 1) (GEQ s21 1)), p0:(AND (GEQ s16 1) (GEQ s17 1) (GEQ s18 1) (GEQ s21 1)), p1:(AND (GEQ s19 1) (GEQ s20 1)), p3:(OR (LT s13 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLFireability-06 finished in 418 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)&&F(G(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 14 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 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 13 transition count 9
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 10 transition count 9
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 10 transition count 6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 7 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 16 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 17 place count 4 transition count 4
Applied a total of 17 rules in 15 ms. Remains 4 /23 variables (removed 19) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-14 04:53:12] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-14 04:53:12] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-14 04:53:12] [INFO ] Invariant cache hit.
[2023-03-14 04:53:12] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-14 04:53:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 04:53:12] [INFO ] Invariant cache hit.
[2023-03-14 04:53:12] [INFO ] Dead Transitions using invariants and state equation in 24 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 97 ms. Remains : 4/23 places, 4/18 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s2 1), p1:(AND (LT s3 1) (LT s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3016 reset in 75 ms.
Product exploration explored 100000 steps with 3046 reset in 108 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 p0 p1), (X (NOT p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 4 factoid took 412 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00010-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00010-LTLFireability-07 finished in 873 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((G(p0)||(p0&&F(!p1)))) U X(G(p2)))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 8 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-14 04:53:13] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-14 04:53:13] [INFO ] Implicit Places using invariants in 60 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 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 83 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 310 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s20 1), p0:(LT s3 1), p1:(AND (GEQ s14 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4622 reset in 115 ms.
Product exploration explored 100000 steps with 4509 reset in 131 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 (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (G (NOT p2))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 602 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p2)]
Finished random walk after 90 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (G (NOT p2))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 14 factoid took 533 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p2)]
// Phase 1: matrix 18 rows 21 cols
[2023-03-14 04:53:15] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-14 04:53:15] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-14 04:53:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 04:53:15] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-14 04:53:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 04:53:15] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-14 04:53:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 04:53:15] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-14 04:53:15] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-14 04:53:15] [INFO ] Added : 17 causal constraints over 4 iterations in 92 ms. Result :sat
Could not prove EG (NOT p2)
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 15 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 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 14 transition count 10
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 11 transition count 10
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 7 place count 11 transition count 6
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 15 place count 7 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 6 transition count 6
Applied a total of 16 rules in 3 ms. Remains 6 /21 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-14 04:53:15] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-14 04:53:15] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-14 04:53:15] [INFO ] Invariant cache hit.
[2023-03-14 04:53:15] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-14 04:53:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 04:53:15] [INFO ] Invariant cache hit.
[2023-03-14 04:53:16] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/21 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 6/21 places, 6/18 transitions.
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 : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 226 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p2)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p2)]
[2023-03-14 04:53:16] [INFO ] Invariant cache hit.
[2023-03-14 04:53:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 04:53:16] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-14 04:53:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 04:53:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 04:53:16] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-14 04:53:16] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 04:53:16] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 37 ms :[(NOT p2)]
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLFireability-08 finished in 3035 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)||G(!p1)||(!p2&&X(!p2)))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-14 04:53:16] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-14 04:53:16] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-14 04:53:16] [INFO ] Invariant cache hit.
[2023-03-14 04:53:16] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-14 04:53:16] [INFO ] Invariant cache hit.
[2023-03-14 04:53:16] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 22/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p1)]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (GEQ s16 1) (GEQ s17 1) (GEQ s20 1)), p2:(GEQ s14 1), p1:(GEQ s5 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 73 ms.
Product exploration explored 100000 steps with 33333 reset in 82 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 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 (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1) p2))))
Knowledge based reduction with 14 factoid took 277 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00010-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00010-LTLFireability-09 finished in 843 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 13 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 11 transition count 6
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 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 9 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 16 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 16 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 18 place count 2 transition count 2
Applied a total of 18 rules in 4 ms. Remains 2 /23 variables (removed 21) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-14 04:53:17] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-14 04:53:17] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-14 04:53:17] [INFO ] Invariant cache hit.
[2023-03-14 04:53:17] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-14 04:53:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 04:53:17] [INFO ] Invariant cache hit.
[2023-03-14 04:53:17] [INFO ] Dead Transitions using invariants and state equation in 17 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 66 ms. Remains : 2/23 places, 2/18 transitions.
Stuttering acceptance computed with spot in 36 ms :[p0]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ 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 4761 reset in 95 ms.
Product exploration explored 100000 steps with 4761 reset in 139 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 : [(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 :(F (G (NOT p0)))
Knowledge based reduction with 3 factoid took 237 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-00010-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00010-LTLFireability-12 finished in 651 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((F(p1)&&p0)))'
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.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 13
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 16 transition count 12
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 16 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 13 transition count 9
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 19 place count 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 20 place count 10 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 20 place count 10 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 22 place count 9 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 23 place count 8 transition count 6
Applied a total of 23 rules in 5 ms. Remains 8 /23 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-14 04:53:18] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-14 04:53:18] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-14 04:53:18] [INFO ] Invariant cache hit.
[2023-03-14 04:53:18] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-14 04:53:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 04:53:18] [INFO ] Invariant cache hit.
[2023-03-14 04:53:18] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/23 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 8/23 places, 6/18 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LT s1 1), p0:(AND (GEQ s3 1) (GEQ s4 1) (GEQ s6 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 3849 reset in 86 ms.
Product exploration explored 100000 steps with 3772 reset in 92 ms.
Computed a total of 8 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 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 p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 659 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 45 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p0)]
Knowledge based reduction with 7 factoid took 376 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 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-14 04:53:19] [INFO ] Invariant cache hit.
[2023-03-14 04:53:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-14 04:53:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 04:53:19] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-14 04:53:19] [INFO ] Computed and/alt/rep : 4/6/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 04:53:19] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 8 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 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-14 04:53:19] [INFO ] Invariant cache hit.
[2023-03-14 04:53:19] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-14 04:53:19] [INFO ] Invariant cache hit.
[2023-03-14 04:53:20] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-14 04:53:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 04:53:20] [INFO ] Invariant cache hit.
[2023-03-14 04:53:20] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 8/8 places, 6/6 transitions.
Computed a total of 8 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 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 35 ms :[(NOT p0)]
Finished random walk after 45 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=45 )
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 166 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-14 04:53:20] [INFO ] Invariant cache hit.
[2023-03-14 04:53:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-14 04:53:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 04:53:20] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-14 04:53:20] [INFO ] Computed and/alt/rep : 4/6/4 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 04:53:20] [INFO ] Added : 4 causal constraints over 1 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7760 reset in 74 ms.
Product exploration explored 100000 steps with 7821 reset in 90 ms.
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 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 7 transition count 4
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 6 transition count 4
Applied a total of 2 rules in 1 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-14 04:53:20] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-14 04:53:20] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-14 04:53:20] [INFO ] Invariant cache hit.
[2023-03-14 04:53:20] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-14 04:53:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 04:53:20] [INFO ] Invariant cache hit.
[2023-03-14 04:53:20] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8 places, 4/6 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 6/8 places, 4/6 transitions.
Treatment of property HouseConstruction-PT-00010-LTLFireability-13 finished in 2704 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(G(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.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 2 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-14 04:53:20] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-14 04:53:20] [INFO ] Implicit Places using invariants in 37 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 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 45 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 307 ms :[true, (NOT p0), p0, false, false]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLFireability-14 finished in 380 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 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 0 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-03-14 04:53:21] [INFO ] Invariant cache hit.
[2023-03-14 04:53:21] [INFO ] Implicit Places using invariants in 41 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 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 44 ms. Remains : 21/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 109 ms :[p1, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : HouseConstruction-PT-00010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LT s7 1), p0:(AND (GEQ s8 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6460 reset in 85 ms.
Product exploration explored 100000 steps with 6441 reset in 96 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 (NOT p0)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 310 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[p1, (AND p1 p0), (AND p1 p0)]
Finished random walk after 77 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=77 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p0)))), (F (AND p1 p0))]
Knowledge based reduction with 8 factoid took 369 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 107 ms :[p1, (AND p1 p0), (AND p1 p0)]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 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.
// Phase 1: matrix 18 rows 21 cols
[2023-03-14 04:53:22] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-14 04:53:22] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-14 04:53:22] [INFO ] Invariant cache hit.
[2023-03-14 04:53:22] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-14 04:53:22] [INFO ] Invariant cache hit.
[2023-03-14 04:53:22] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 21/21 places, 18/18 transitions.
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 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 310 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[p1, (AND p1 p0), (AND p1 p0)]
Finished random walk after 56 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p0)))), (F (AND p1 p0))]
Knowledge based reduction with 8 factoid took 373 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 115 ms :[p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 108 ms :[p1, (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 6470 reset in 83 ms.
Product exploration explored 100000 steps with 6476 reset in 98 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 112 ms :[p1, (AND p1 p0), (AND p1 p0)]
Support contains 3 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 9 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 9 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 9 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 8 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 8 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 5 rules in 8 ms. Remains 8 /21 variables (removed 13) and now considering 7/18 (removed 11) transitions.
[2023-03-14 04:53:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2023-03-14 04:53:24] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-14 04:53:24] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/21 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47 ms. Remains : 8/21 places, 7/18 transitions.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 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.
// Phase 1: matrix 18 rows 21 cols
[2023-03-14 04:53:24] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-14 04:53:24] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-14 04:53:24] [INFO ] Invariant cache hit.
[2023-03-14 04:53:24] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-14 04:53:24] [INFO ] Invariant cache hit.
[2023-03-14 04:53:24] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property HouseConstruction-PT-00010-LTLFireability-15 finished in 3464 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((F(p1)&&p0)))'
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))))'
[2023-03-14 04:53:24] [INFO ] Flatten gal took : 4 ms
[2023-03-14 04:53:24] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-14 04:53:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 23 places, 18 transitions and 45 arcs took 1 ms.
Total runtime 39870 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2698/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2698/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : HouseConstruction-PT-00010-LTLFireability-13
Could not compute solution for formula : HouseConstruction-PT-00010-LTLFireability-15

BK_STOP 1678769606932

--------------------
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
mcc2023
ltl formula name HouseConstruction-PT-00010-LTLFireability-13
ltl formula formula --ltl=/tmp/2698/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 23 places, 18 transitions and 45 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2698/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2698/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2698/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2698/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name HouseConstruction-PT-00010-LTLFireability-15
ltl formula formula --ltl=/tmp/2698/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 23 places, 18 transitions and 45 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2698/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2698/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2698/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2698/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-00010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is HouseConstruction-PT-00010, 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 r201-smll-167840347900532"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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