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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 4.9K Feb 25 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Feb 25 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.5K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 12K Feb 25 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 25 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 25 13:05 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-00005-LTLFireability-00
FORMULA_NAME HouseConstruction-PT-00005-LTLFireability-01
FORMULA_NAME HouseConstruction-PT-00005-LTLFireability-02
FORMULA_NAME HouseConstruction-PT-00005-LTLFireability-03
FORMULA_NAME HouseConstruction-PT-00005-LTLFireability-04
FORMULA_NAME HouseConstruction-PT-00005-LTLFireability-05
FORMULA_NAME HouseConstruction-PT-00005-LTLFireability-06
FORMULA_NAME HouseConstruction-PT-00005-LTLFireability-07
FORMULA_NAME HouseConstruction-PT-00005-LTLFireability-08
FORMULA_NAME HouseConstruction-PT-00005-LTLFireability-09
FORMULA_NAME HouseConstruction-PT-00005-LTLFireability-10
FORMULA_NAME HouseConstruction-PT-00005-LTLFireability-11
FORMULA_NAME HouseConstruction-PT-00005-LTLFireability-12
FORMULA_NAME HouseConstruction-PT-00005-LTLFireability-13
FORMULA_NAME HouseConstruction-PT-00005-LTLFireability-14
FORMULA_NAME HouseConstruction-PT-00005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678622768952

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-00005
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-12 12:06:12] [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-12 12:06:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 12:06:12] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-12 12:06:12] [INFO ] Transformed 26 places.
[2023-03-12 12:06:12] [INFO ] Transformed 18 transitions.
[2023-03-12 12:06:12] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HouseConstruction-PT-00005-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00005-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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 13 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2023-03-12 12:06:12] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-12 12:06:12] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-12 12:06:12] [INFO ] Invariant cache hit.
[2023-03-12 12:06:12] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-12 12:06:12] [INFO ] Invariant cache hit.
[2023-03-12 12:06:12] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 334 ms. Remains : 26/26 places, 18/18 transitions.
Support contains 24 out of 26 places after structural reductions.
[2023-03-12 12:06:13] [INFO ] Flatten gal took : 22 ms
[2023-03-12 12:06:13] [INFO ] Flatten gal took : 6 ms
[2023-03-12 12:06:13] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 97 steps, including 0 resets, run visited all 19 properties in 23 ms. (steps per millisecond=4 )
Computed a total of 26 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 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(F(p0)))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 8 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 11 output transitions
Drop transitions removed 11 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 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 6 transition count 5
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 6 transition count 3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 4 transition count 3
Applied a total of 7 rules in 9 ms. Remains 4 /26 variables (removed 22) and now considering 3/18 (removed 15) transitions.
// Phase 1: matrix 3 rows 4 cols
[2023-03-12 12:06:13] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 12:06:13] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-12 12:06:13] [INFO ] Invariant cache hit.
[2023-03-12 12:06:13] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-12 12:06:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 12:06:13] [INFO ] Invariant cache hit.
[2023-03-12 12:06:13] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/26 places, 3/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 4/26 places, 3/18 transitions.
Stuttering acceptance computed with spot in 304 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00005-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10277 reset in 470 ms.
Product exploration explored 100000 steps with 10244 reset in 283 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 413 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00005-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00005-LTLFireability-02 finished in 1693 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' '!(((p0 U p1)||X(F((p0&&(p1 U G(p2)))))))'
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-12 12:06:15] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-12 12:06:15] [INFO ] Implicit Places using invariants in 109 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 113 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 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 116 ms. Remains : 23/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 384 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HouseConstruction-PT-00005-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=3 dest: 1}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0 p2), acceptance={} source=3 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s1 1), p0:(GEQ s4 1), p2:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 11 ms.
FORMULA HouseConstruction-PT-00005-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00005-LTLFireability-03 finished in 535 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 U G(!p0))))'
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-03-12 12:06:15] [INFO ] Invariant cache hit.
[2023-03-12 12:06:16] [INFO ] Implicit Places using invariants in 112 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 115 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/26 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 118 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 135 ms :[p0, p0, p0, true]
Running random walk in product with property : HouseConstruction-PT-00005-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00005-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00005-LTLFireability-04 finished in 274 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 U (p1||G(p0)))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-03-12 12:06:16] [INFO ] Invariant cache hit.
[2023-03-12 12:06:16] [INFO ] Implicit Places using invariants in 64 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 66 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/26 places, 18/18 transitions.
Applied a total of 0 rules in 2 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 70 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00005-LTLFireability-05 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:(GEQ s14 1), p0:(OR (GEQ s14 1) (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, 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 0 ms.
FORMULA HouseConstruction-PT-00005-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00005-LTLFireability-05 finished in 195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 11 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 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 10 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 9 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 9 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 6 transition count 5
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 7 place count 6 transition count 3
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 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 12 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 14 place count 2 transition count 2
Applied a total of 14 rules in 5 ms. Remains 2 /26 variables (removed 24) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-12 12:06:16] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 12:06:16] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-12 12:06:16] [INFO ] Invariant cache hit.
[2023-03-12 12:06:16] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-12 12:06:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 12:06:16] [INFO ] Invariant cache hit.
[2023-03-12 12:06:16] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/26 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 2/26 places, 2/18 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00005-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Product exploration explored 100000 steps with 50000 reset in 74 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 :(X p0)
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00005-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00005-LTLFireability-06 finished in 662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1))))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 15 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 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 6 ms. Remains 4 /26 variables (removed 22) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-12 12:06:17] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 12:06:17] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-12 12:06:17] [INFO ] Invariant cache hit.
[2023-03-12 12:06:17] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-12 12:06:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 12:06:17] [INFO ] Invariant cache hit.
[2023-03-12 12:06:17] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/26 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 4/26 places, 4/18 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00005-LTLFireability-07 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:(GEQ s3 1), p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 15692 reset in 75 ms.
Product exploration explored 100000 steps with 15771 reset in 85 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 p1)), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 7 factoid took 590 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 13 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p1), (F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 7 factoid took 703 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
[2023-03-12 12:06:19] [INFO ] Invariant cache hit.
[2023-03-12 12:06:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:06:19] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-12 12:06:19] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 12:06:19] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-12 12:06:19] [INFO ] Invariant cache hit.
[2023-03-12 12:06:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:06:19] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 12:06:19] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 12:06:19] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-12 12:06:19] [INFO ] Invariant cache hit.
[2023-03-12 12:06:19] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-12 12:06:19] [INFO ] Invariant cache hit.
[2023-03-12 12:06:19] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-12 12:06:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 12:06:19] [INFO ] Invariant cache hit.
[2023-03-12 12:06:19] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 4/4 places, 4/4 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) p0)), (X p0), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 7 factoid took 414 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 13 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) p0)), (X p0), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p0)), (F p1), (F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 7 factoid took 421 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
[2023-03-12 12:06:20] [INFO ] Invariant cache hit.
[2023-03-12 12:06:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:06:20] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-12 12:06:20] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-12 12:06:20] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-12 12:06:20] [INFO ] Invariant cache hit.
[2023-03-12 12:06:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:06:20] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-12 12:06:20] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 12:06:20] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 15732 reset in 249 ms.
Product exploration explored 100000 steps with 15770 reset in 75 ms.
Built C files in :
/tmp/ltsmin16242152518596313064
[2023-03-12 12:06:21] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2023-03-12 12:06:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 12:06:21] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2023-03-12 12:06:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 12:06:21] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2023-03-12 12:06:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 12:06:21] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16242152518596313064
Running compilation step : cd /tmp/ltsmin16242152518596313064;'/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 256 ms.
Running link step : cd /tmp/ltsmin16242152518596313064;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16242152518596313064;'/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/stateBased16024499294703726118.hoa' '--buchi-type=spotba'
LTSmin run took 86 ms.
FORMULA HouseConstruction-PT-00005-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-00005-LTLFireability-07 finished in 4563 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(X((F(p1)&&G(p2)))))))'
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-12 12:06:21] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 12:06:21] [INFO ] Implicit Places using invariants in 35 ms returned [9, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 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 39 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true, (OR (NOT p2) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00005-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=5 dest: 0}, { cond=(NOT p2), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p2:(OR (LT s3 1) (LT s7 1)), p0:(GEQ s5 1), p1:(AND (GEQ s9 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00005-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00005-LTLFireability-08 finished in 313 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)||X(!p0))))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-03-12 12:06:21] [INFO ] Invariant cache hit.
[2023-03-12 12:06:21] [INFO ] Implicit Places using invariants in 58 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 60 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/26 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/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 217 ms :[true, p0, false, false, false, (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00005-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[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, terminal, 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 45 ms.
Product exploration explored 100000 steps with 33333 reset in 58 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 6 states, 8 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00005-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00005-LTLFireability-09 finished in 647 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 U X(p1)) U p2)))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-03-12 12:06:22] [INFO ] Invariant cache hit.
[2023-03-12 12:06:22] [INFO ] Implicit Places using invariants in 49 ms returned [9, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 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 53 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p2), (NOT p1), (NOT p2), (NOT p1), true]
Running random walk in product with property : HouseConstruction-PT-00005-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LT s4 1), p0:(OR (GEQ s6 1) (AND (GEQ s3 1) (GEQ s7 1))), p1:(GEQ s6 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 12 steps with 1 reset in 2 ms.
FORMULA HouseConstruction-PT-00005-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00005-LTLFireability-10 finished in 288 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&&F(p1)))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-03-12 12:06:22] [INFO ] Invariant cache hit.
[2023-03-12 12:06:22] [INFO ] Implicit Places using invariants in 44 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 0 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 50 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : HouseConstruction-PT-00005-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s16 1) (GEQ s17 1) (GEQ s20 1)), p0:(LT s2 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 1947 reset in 127 ms.
Product exploration explored 100000 steps with 1946 reset in 100 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 p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 392 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 123 ms :[(OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Finished random walk after 92 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 539 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 176 ms :[(OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
// Phase 1: matrix 18 rows 22 cols
[2023-03-12 12:06:24] [INFO ] Computed 4 place invariants in 16 ms
[2023-03-12 12:06:24] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-12 12:06:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:06:24] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-12 12:06:24] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-12 12:06:24] [INFO ] Added : 17 causal constraints over 4 iterations in 103 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-12 12:06:24] [INFO ] Invariant cache hit.
[2023-03-12 12:06:25] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-12 12:06:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:06:25] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2023-03-12 12:06:25] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-12 12:06:25] [INFO ] Added : 0 causal constraints over 0 iterations in 77 ms. Result :sat
Could not prove EG p0
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 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.
[2023-03-12 12:06:25] [INFO ] Invariant cache hit.
[2023-03-12 12:06:25] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-12 12:06:25] [INFO ] Invariant cache hit.
[2023-03-12 12:06:25] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-12 12:06:25] [INFO ] Invariant cache hit.
[2023-03-12 12:06:25] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 217 ms. Remains : 22/22 places, 18/18 transitions.
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 p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 470 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 190 ms :[(OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Finished random walk after 97 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 560 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 135 ms :[(OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
[2023-03-12 12:06:27] [INFO ] Invariant cache hit.
[2023-03-12 12:06:27] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-12 12:06:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:06:27] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-12 12:06:27] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 12:06:27] [INFO ] Added : 17 causal constraints over 4 iterations in 35 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-12 12:06:27] [INFO ] Invariant cache hit.
[2023-03-12 12:06:27] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-12 12:06:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:06:27] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-12 12:06:27] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 12:06:27] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Product exploration explored 100000 steps with 1955 reset in 93 ms.
Product exploration explored 100000 steps with 1948 reset in 112 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 18
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 4 place count 22 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 22 transition count 18
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 19 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 19 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 19 transition count 16
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 17 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 17 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 20 rules in 19 ms. Remains 17 /22 variables (removed 5) and now considering 14/18 (removed 4) transitions.
[2023-03-12 12:06:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 17 cols
[2023-03-12 12:06:28] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 12:06:28] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/22 places, 14/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 17/22 places, 14/18 transitions.
Built C files in :
/tmp/ltsmin17719062181934738572
[2023-03-12 12:06:28] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17719062181934738572
Running compilation step : cd /tmp/ltsmin17719062181934738572;'/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 109 ms.
Running link step : cd /tmp/ltsmin17719062181934738572;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin17719062181934738572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6189362122885012069.hoa' '--buchi-type=spotba'
LTSmin run took 4817 ms.
FORMULA HouseConstruction-PT-00005-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-00005-LTLFireability-11 finished in 10186 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) U (p1&&G(!p0))))))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-12 12:06:33] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 12:06:33] [INFO ] Implicit Places using invariants in 51 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 60 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/26 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 64 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 147 ms :[p0, true, p0, (OR (NOT p1) p0)]
Running random walk in product with property : HouseConstruction-PT-00005-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LT s3 1), p1:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00005-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00005-LTLFireability-12 finished in 232 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)))&&(!p2 U (G(!p2)||(!p2&&G(p0)))))))'
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 18 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 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 17 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 16 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 16 transition count 8
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 11 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 11 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 13 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
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 8 transition count 6
Applied a total of 16 rules in 6 ms. Remains 8 /26 variables (removed 18) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-12 12:06:33] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 12:06:33] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-12 12:06:33] [INFO ] Invariant cache hit.
[2023-03-12 12:06:33] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-12 12:06:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 12:06:33] [INFO ] Invariant cache hit.
[2023-03-12 12:06:33] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/26 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 8/26 places, 6/18 transitions.
Stuttering acceptance computed with spot in 389 ms :[(OR (NOT p0) (NOT p1) p2), (NOT p1), (OR (NOT p0) (NOT p1)), (AND (NOT p0) p2), p2, (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00005-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p2), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1, 2} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1, 2} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={1, 2} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 4}, { cond=(AND p0 p2), acceptance={0, 2} source=3 dest: 5}], [{ cond=p2, acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 p2), acceptance={0, 2} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={2} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=6 dest: 0}, { cond=p0, acceptance={2} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s3 1)), p2:(AND (GEQ s6 1) (GEQ s7 1)), p1:(GEQ s4 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 39 steps with 1 reset in 1 ms.
FORMULA HouseConstruction-PT-00005-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00005-LTLFireability-13 finished in 572 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' '!((p0 U X(X(G(!p1)))))'
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-12 12:06:33] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 12:06:33] [INFO ] Implicit Places using invariants in 40 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 41 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 0 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 43 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 125 ms :[p1, p1, true, p1]
Running random walk in product with property : HouseConstruction-PT-00005-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p1:(AND (GEQ s16 1) (GEQ s17 1) (GEQ s20 1)), p0:(OR (GEQ s11 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 31 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00005-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00005-LTLFireability-14 finished in 185 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((X(p0)||F(!p1))) U (p0||X(G(p2)))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-03-12 12:06:34] [INFO ] Invariant cache hit.
[2023-03-12 12:06:34] [INFO ] Implicit Places using invariants in 34 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 36 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/26 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 39 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, (AND p1 (NOT p2) p0)]
Running random walk in product with property : HouseConstruction-PT-00005-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=6 dest: 6}]], initial=1, aps=[p2:(GEQ s15 1), p1:(LT s3 1), p0:(GEQ s5 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 6263 steps with 857 reset in 15 ms.
FORMULA HouseConstruction-PT-00005-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00005-LTLFireability-15 finished in 381 ms.
All properties solved by simple procedures.
Total runtime 22213 ms.

BK_STOP 1678622795736

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

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