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.r197-smll-167840344500620.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 itstools
Input is HouseConstruction-PT-32000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-167840344500620
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 6.7K Feb 25 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 13:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 13:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 13:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 13K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678698017721

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-32000
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-13 09:00:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-13 09:00:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:00:21] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2023-03-13 09:00:21] [INFO ] Transformed 26 places.
[2023-03-13 09:00:21] [INFO ] Transformed 18 transitions.
[2023-03-13 09:00:21] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 201 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 6 formulas.
FORMULA HouseConstruction-PT-32000-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-32000-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-32000-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-32000-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-32000-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-32000-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 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 20 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2023-03-13 09:00:21] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-13 09:00:22] [INFO ] Implicit Places using invariants in 213 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 278 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 299 ms. Remains : 25/26 places, 18/18 transitions.
Support contains 18 out of 25 places after structural reductions.
[2023-03-13 09:00:22] [INFO ] Flatten gal took : 35 ms
[2023-03-13 09:00:22] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:00:22] [INFO ] Input system was already deterministic with 18 transitions.
Support contains 17 out of 25 places (down from 18) after GAL structural reductions.
Incomplete random walk after 32001 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=820 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 13) seen :12
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 25 cols
[2023-03-13 09:00:22] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-13 09:00:22] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-13 09:00:22] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:00:22] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-13 09:00:22] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:00:22] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-13 09:00:22] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 64000 steps, including 0 resets, run visited all 1 properties in 303 ms. (steps per millisecond=211 )
Parikh walk visited 1 properties in 304 ms.
FORMULA HouseConstruction-PT-32000-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 25 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 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' '!(X((p0 U (p1||G(p0)))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 2 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2023-03-13 09:00:23] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-13 09:00:23] [INFO ] Implicit Places using invariants in 69 ms returned [8, 12, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 70 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 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 73 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 314 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (LT s0 1) (LT s1 1)), p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA HouseConstruction-PT-32000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-32000-LTLFireability-00 finished in 485 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 U (p1||G(p0))))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 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 23 transition count 13
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 19 transition count 13
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 19 transition count 8
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 12 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 11 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 21 place count 11 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 10 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 9 transition count 6
Applied a total of 25 rules in 9114 ms. Remains 9 /25 variables (removed 16) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-13 09:00:33] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-13 09:00:33] [INFO ] Implicit Places using invariants in 28 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/25 places, 6/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9145 ms. Remains : 8/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s4 1) (GEQ s5 1) (GEQ s7 1))) (LT s1 1)), p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9 reset in 420 ms.
Product exploration explored 100000 steps with 19 reset in 297 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 p0), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 6 factoid took 196 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-32000-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-32000-LTLFireability-03 finished in 10206 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 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 4 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Discarding 21 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 10181 ms. Remains 2 /25 variables (removed 23) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-13 09:00:44] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-13 09:00:44] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-13 09:00:44] [INFO ] Invariant cache hit.
[2023-03-13 09:00:44] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-13 09:00:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-13 09:00:44] [INFO ] Invariant cache hit.
[2023-03-13 09:00:44] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/25 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10265 ms. Remains : 2/25 places, 2/18 transitions.
Stuttering acceptance computed with spot in 37 ms :[p0]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 64000 steps with 0 reset in 39 ms.
FORMULA HouseConstruction-PT-32000-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-32000-LTLFireability-04 finished in 10356 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))&&F(p1)))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 8 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 6
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 4 transition count 4
Applied a total of 7 rules in 10005 ms. Remains 4 /25 variables (removed 21) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-13 09:00:54] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-13 09:00:54] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-13 09:00:54] [INFO ] Invariant cache hit.
[2023-03-13 09:00:54] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-13 09:00:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-13 09:00:54] [INFO ] Invariant cache hit.
[2023-03-13 09:00:54] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/25 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10080 ms. Remains : 4/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s1 1), p0:(GEQ s3 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 2 reset in 55 ms.
Product exploration explored 100000 steps with 1 reset in 112 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 6 factoid took 396 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p0)]
Knowledge based reduction with 6 factoid took 382 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 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2023-03-13 09:00:56] [INFO ] Invariant cache hit.
[2023-03-13 09:00:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:00:56] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-13 09:00:56] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 09:00:56] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 4 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 : 4/4 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-13 09:00:56] [INFO ] Invariant cache hit.
[2023-03-13 09:00:56] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-13 09:00:56] [INFO ] Invariant cache hit.
[2023-03-13 09:00:56] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-13 09:00:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-13 09:00:56] [INFO ] Invariant cache hit.
[2023-03-13 09:00:56] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 4/4 places, 4/4 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 199 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Incomplete random walk after 32001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=2461 ) properties (out of 1) seen :0
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 373 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 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2023-03-13 09:00:56] [INFO ] Invariant cache hit.
[2023-03-13 09:00:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:00:56] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-13 09:00:56] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 09:00:57] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 93 ms.
Product exploration explored 100000 steps with 0 reset in 126 ms.
Built C files in :
/tmp/ltsmin11209329110806841331
[2023-03-13 09:00:57] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2023-03-13 09:00:57] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-13 09:00:57] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2023-03-13 09:00:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-13 09:00:57] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2023-03-13 09:00:57] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-13 09:00:57] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11209329110806841331
Running compilation step : cd /tmp/ltsmin11209329110806841331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 324 ms.
Running link step : cd /tmp/ltsmin11209329110806841331;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin11209329110806841331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10830257169151490980.hoa' '--buchi-type=spotba'
LTSmin run took 3797 ms.
FORMULA HouseConstruction-PT-32000-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-32000-LTLFireability-09 finished in 16923 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 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 15 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 13 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 11 transition count 8
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 5 place count 11 transition count 5
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 13 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 5 transition count 4
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 4 transition count 4
Applied a total of 16 rules in 9149 ms. Remains 4 /25 variables (removed 21) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-13 09:01:10] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-13 09:01:10] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-13 09:01:10] [INFO ] Invariant cache hit.
[2023-03-13 09:01:10] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-13 09:01:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-13 09:01:10] [INFO ] Invariant cache hit.
[2023-03-13 09:01:10] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/25 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9248 ms. Remains : 4/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s1 1) (GEQ s3 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 0 reset in 57 ms.
Product exploration explored 100000 steps with 0 reset in 92 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 210 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 50 ms :[(NOT p0)]
Incomplete random walk after 32001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=6400 ) properties (out of 1) seen :0
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 241 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 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2023-03-13 09:01:11] [INFO ] Invariant cache hit.
[2023-03-13 09:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:01:11] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 09:01:11] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 09:01:11] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-13 09:01:11] [INFO ] Invariant cache hit.
[2023-03-13 09:01:11] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-13 09:01:11] [INFO ] Invariant cache hit.
[2023-03-13 09:01:11] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-13 09:01:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-13 09:01:11] [INFO ] Invariant cache hit.
[2023-03-13 09:01:11] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 4/4 places, 4/4 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 201 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 46 ms :[(NOT p0)]
Incomplete random walk after 32001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=8000 ) properties (out of 1) seen :0
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 242 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 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2023-03-13 09:01:12] [INFO ] Invariant cache hit.
[2023-03-13 09:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:01:12] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 09:01:12] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 09:01:12] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 61 ms.
Product exploration explored 100000 steps with 0 reset in 93 ms.
Built C files in :
/tmp/ltsmin4235856357954923673
[2023-03-13 09:01:12] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2023-03-13 09:01:12] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-13 09:01:12] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2023-03-13 09:01:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-13 09:01:12] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2023-03-13 09:01:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-13 09:01:12] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4235856357954923673
Running compilation step : cd /tmp/ltsmin4235856357954923673;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 136 ms.
Running link step : cd /tmp/ltsmin4235856357954923673;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin4235856357954923673;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10642743452825673598.hoa' '--buchi-type=spotba'
LTSmin run took 3454 ms.
FORMULA HouseConstruction-PT-32000-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-32000-LTLFireability-10 finished in 14884 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 U (G(p0)||(p0&&(p1 U G((F(p3)&&p2)))))))))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-13 09:01:16] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-13 09:01:16] [INFO ] Implicit Places using invariants in 38 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 24/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p3) p0), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p3) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=4 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1)), p1:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1)), p0:(LT s18 1), p3:(AND (GEQ s15 1) (GEQ s16 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2346 reset in 163 ms.
Product exploration explored 100000 steps with 2323 reset in 282 ms.
Computed a total of 24 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 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) (NOT p1) p0 (NOT p3)), (X p0), (X (NOT (AND p2 p1 p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND p2 (NOT p3) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G p0)), (F (G (NOT p3)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 26 factoid took 1039 ms. Reduced automaton from 5 states, 25 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-32000-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-32000-LTLFireability-11 finished in 1860 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(X((X(p0)||(p1&&X(F(p1)))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 2 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2023-03-13 09:01:18] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-13 09:01:18] [INFO ] Implicit Places using invariants in 37 ms returned [8, 12, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 39 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 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 43 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 322 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=6, aps=[p1:(GEQ s20 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, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-32000-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-32000-LTLFireability-12 finished in 383 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)||F(p1)))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 17 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 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 16 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 13 transition count 10
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 13 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 8 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 15 place count 8 transition count 6
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 17 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 19 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 20 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 21 place count 4 transition count 4
Applied a total of 21 rules in 46629 ms. Remains 4 /25 variables (removed 21) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-13 09:02:05] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-13 09:02:05] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-13 09:02:05] [INFO ] Invariant cache hit.
[2023-03-13 09:02:05] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-13 09:02:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-13 09:02:05] [INFO ] Invariant cache hit.
[2023-03-13 09:02:05] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/25 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46760 ms. Remains : 4/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(GEQ s2 1), p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 29661 reset in 207 ms.
Product exploration explored 100000 steps with 29582 reset in 271 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 561 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1)]
Knowledge based reduction with 4 factoid took 567 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
[2023-03-13 09:02:07] [INFO ] Invariant cache hit.
[2023-03-13 09:02:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:02:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 09:02:07] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 09:02:07] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 4 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 : 4/4 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-13 09:02:07] [INFO ] Invariant cache hit.
[2023-03-13 09:02:07] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-13 09:02:07] [INFO ] Invariant cache hit.
[2023-03-13 09:02:07] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-13 09:02:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-13 09:02:07] [INFO ] Invariant cache hit.
[2023-03-13 09:02:07] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 4/4 places, 4/4 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 261 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 52 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 264 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 50 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p1)]
[2023-03-13 09:02:08] [INFO ] Invariant cache hit.
[2023-03-13 09:02:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:02:08] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-13 09:02:08] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 09:02:08] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 56 ms :[(NOT p1)]
Product exploration explored 100000 steps with 29651 reset in 96 ms.
Product exploration explored 100000 steps with 29635 reset in 124 ms.
Built C files in :
/tmp/ltsmin1763172884562152992
[2023-03-13 09:02:08] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2023-03-13 09:02:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-13 09:02:08] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2023-03-13 09:02:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-13 09:02:08] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2023-03-13 09:02:08] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-13 09:02:08] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1763172884562152992
Running compilation step : cd /tmp/ltsmin1763172884562152992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 138 ms.
Running link step : cd /tmp/ltsmin1763172884562152992;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin1763172884562152992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2828890313705321369.hoa' '--buchi-type=spotba'
LTSmin run took 2247 ms.
FORMULA HouseConstruction-PT-32000-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-32000-LTLFireability-14 finished in 52473 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))||(!p0 U p1)))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 29 edges and 25 vertex of which 14 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 13 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 11 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 11 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 10 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 9 transition count 6
Applied a total of 8 rules in 44417 ms. Remains 9 /25 variables (removed 16) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-13 09:02:55] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-13 09:02:55] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-13 09:02:55] [INFO ] Invariant cache hit.
[2023-03-13 09:02:55] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-13 09:02:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-13 09:02:55] [INFO ] Invariant cache hit.
[2023-03-13 09:02:55] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44531 ms. Remains : 9/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND p0 (NOT p1)), p0, p0]
Running random walk in product with property : HouseConstruction-PT-32000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s8 1), p1:(AND (GEQ s3 1) (GEQ s6 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2919 reset in 78 ms.
Product exploration explored 100000 steps with 1896 reset in 289 ms.
Computed a total of 9 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 7 factoid took 379 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-32000-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-32000-LTLFireability-15 finished in 45459 ms.
All properties solved by simple procedures.
Total runtime 155263 ms.

BK_STOP 1678698178052

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-32000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is HouseConstruction-PT-32000, 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 r197-smll-167840344500620"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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