Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 5.9K Apr 29 18:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 29 18:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 18:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 18:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 13K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652789896574

Running Version 202205111006
[2022-05-17 12:18:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 12:18:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 12:18:18] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2022-05-17 12:18:18] [INFO ] Transformed 26 places.
[2022-05-17 12:18:18] [INFO ] Transformed 18 transitions.
[2022-05-17 12:18:18] [INFO ] Parsed PT model containing 26 places and 18 transitions in 251 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HouseConstruction-PT-00020-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00020-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 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 19 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2022-05-17 12:18:19] [INFO ] Computed 8 place invariants in 8 ms
[2022-05-17 12:18:19] [INFO ] Implicit Places using invariants in 187 ms returned []
// Phase 1: matrix 18 rows 26 cols
[2022-05-17 12:18:19] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-17 12:18:19] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 26 cols
[2022-05-17 12:18:19] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-17 12:18:19] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 18/18 transitions.
Support contains 23 out of 26 places after structural reductions.
[2022-05-17 12:18:19] [INFO ] Flatten gal took : 25 ms
[2022-05-17 12:18:19] [INFO ] Flatten gal took : 8 ms
[2022-05-17 12:18:19] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 4085 steps, including 10 resets, run visited all 16 properties in 204 ms. (steps per millisecond=20 )
FORMULA HouseConstruction-PT-00020-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 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 23 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 21 transition count 12
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 17 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 9 place count 17 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 13 transition count 10
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 13 transition count 9
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 12 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 9 transition count 8
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 2 with 2 rules applied. Total rules applied 23 place count 8 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 7 transition count 6
Applied a total of 24 rules in 20 ms. Remains 7 /26 variables (removed 19) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-17 12:18:20] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 12:18:20] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-17 12:18:20] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 12:18:20] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-17 12:18:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-17 12:18:20] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 12:18:20] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/26 places, 6/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/26 places, 6/18 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s6 1) (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 120 steps with 0 reset in 4 ms.
FORMULA HouseConstruction-PT-00020-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-LTLFireability-00 finished in 397 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(!p0 U !((X(p0)&&X(p1))||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.
// Phase 1: matrix 18 rows 25 cols
[2022-05-17 12:18:20] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 12:18:20] [INFO ] Implicit Places using invariants in 38 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 42 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 2 iterations. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : HouseConstruction-PT-00020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s3 1), p0:(AND (GEQ s17 1) (GEQ s18 1)), p1:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1592 reset in 386 ms.
Product exploration explored 100000 steps with 1633 reset in 222 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 502 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), false]
Incomplete random walk after 10001 steps, including 26 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :4
Finished Best-First random walk after 181 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1) p0)), (F (AND (NOT p2) p1 p0)), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p2 (NOT p0))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 9 factoid took 664 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 202 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), false]
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), false]
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 12:18:23] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 12:18:23] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-17 12:18:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 12:18:23] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-17 12:18:23] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 12:18:23] [INFO ] Added : 1 causal constraints over 1 iterations in 29 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 12:18:23] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 12:18:23] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-17 12:18:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 12:18:23] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 12:18:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 12:18:23] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-17 12:18:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 12:18:23] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-17 12:18:23] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 12:18:23] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Graph (complete) has 22 edges and 21 vertex of which 16 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 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 15 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 12 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 12 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 9 transition count 7
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 8 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 16 place count 7 transition count 6
Applied a total of 16 rules in 10 ms. Remains 7 /21 variables (removed 14) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-17 12:18:23] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 12:18:23] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-17 12:18:23] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 12:18:23] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2022-05-17 12:18:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-17 12:18:23] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 12:18:24] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/21 places, 6/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/21 places, 6/18 transitions.
Computed a total of 7 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 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 p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
Knowledge based reduction with 12 factoid took 707 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 310 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), false]
Finished random walk after 171 steps, including 1 resets, run visited all 5 properties in 3 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (F (AND (NOT p2) (NOT p1) p0)), (F (AND (NOT p2) p1 p0)), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p2 (NOT p0))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 12 factoid took 833 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), false]
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), false]
// Phase 1: matrix 6 rows 7 cols
[2022-05-17 12:18:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 12:18:26] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-17 12:18:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 12:18:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-17 12:18:26] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 12:18:26] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
// Phase 1: matrix 6 rows 7 cols
[2022-05-17 12:18:26] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 12:18:26] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-17 12:18:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 12:18:26] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 12:18:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 12:18:26] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-17 12:18:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 12:18:26] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-17 12:18:26] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 12:18:26] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), false]
Stuttering criterion allowed to conclude after 1025 steps with 43 reset in 7 ms.
FORMULA HouseConstruction-PT-00020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-LTLFireability-01 finished in 5868 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&p1)))'
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.
// Phase 1: matrix 18 rows 25 cols
[2022-05-17 12:18:26] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 12:18:26] [INFO ] Implicit Places using invariants in 56 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 57 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 2 iterations. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(GEQ s5 1), p1:(OR (LT s17 1) (LT s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-LTLFireability-03 finished in 202 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(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 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2022-05-17 12:18:26] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 12:18:26] [INFO ] Implicit Places using invariants in 75 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 76 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 3 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 12793 reset in 105 ms.
Product exploration explored 100000 steps with 12847 reset in 516 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), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
Knowledge obtained : [(NOT p0), true, (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 12:18:28] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 12:18:28] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-17 12:18:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 12:18:28] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-17 12:18:28] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 12:18:28] [INFO ] Added : 1 causal constraints over 1 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 4 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 12:18:28] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 12:18:28] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 12:18:28] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-17 12:18:29] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 12:18:29] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-17 12:18:29] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 18/18 transitions.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
Knowledge obtained : [(NOT p0), true, (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 200 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 12:18:30] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 12:18:30] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-17 12:18:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 12:18:30] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 12:18:30] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 12:18:30] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12779 reset in 95 ms.
Product exploration explored 100000 steps with 12727 reset in 208 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Graph (complete) has 22 edges and 21 vertex of which 4 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 4 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 4 transition count 4
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 5 rules in 4 ms. Remains 3 /21 variables (removed 18) and now considering 3/18 (removed 15) transitions.
[2022-05-17 12:18:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-17 12:18:31] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 12:18:31] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/21 places, 3/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/21 places, 3/18 transitions.
Product exploration explored 100000 steps with 17640 reset in 266 ms.
Product exploration explored 100000 steps with 17660 reset in 285 ms.
Built C files in :
/tmp/ltsmin1677375176752966834
[2022-05-17 12:18:31] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1677375176752966834
Running compilation step : cd /tmp/ltsmin1677375176752966834;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 266 ms.
Running link step : cd /tmp/ltsmin1677375176752966834;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin1677375176752966834;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9110296038331583778.hoa' '--buchi-type=spotba'
LTSmin run took 1543 ms.
FORMULA HouseConstruction-PT-00020-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-00020-LTLFireability-05 finished in 6691 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(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 7 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 12 output transitions
Drop transitions removed 12 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 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 4 transition count 3
Applied a total of 4 rules in 3 ms. Remains 4 /26 variables (removed 22) and now considering 3/18 (removed 15) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 12:18:33] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 12:18:33] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 12:18:33] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 12:18:33] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-17 12:18:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 12:18:33] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 12:18:33] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/26 places, 3/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/26 places, 3/18 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s3 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 24941 reset in 55 ms.
Product exploration explored 100000 steps with 24998 reset in 66 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 : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 215 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 12:18:34] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 12:18:34] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-17 12:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 12:18:34] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 12:18:34] [INFO ] Computed and/alt/rep : 1/2/1 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 12:18:34] [INFO ] Added : 1 causal constraints over 1 iterations in 5 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, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 12:18:34] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-17 12:18:34] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 12:18:34] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 12:18:34] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-17 12:18:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 12:18:34] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-17 12:18:34] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
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 : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 258 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 12:18:35] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 12:18:35] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-17 12:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 12:18:35] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 12:18:35] [INFO ] Computed and/alt/rep : 1/2/1 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 12:18:35] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25028 reset in 81 ms.
Product exploration explored 100000 steps with 25000 reset in 63 ms.
Built C files in :
/tmp/ltsmin17015145711788560617
[2022-05-17 12:18:35] [INFO ] Computing symmetric may disable matrix : 3 transitions.
[2022-05-17 12:18:35] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 12:18:35] [INFO ] Computing symmetric may enable matrix : 3 transitions.
[2022-05-17 12:18:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 12:18:35] [INFO ] Computing Do-Not-Accords matrix : 3 transitions.
[2022-05-17 12:18:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 12:18:35] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17015145711788560617
Running compilation step : cd /tmp/ltsmin17015145711788560617;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 126 ms.
Running link step : cd /tmp/ltsmin17015145711788560617;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17015145711788560617;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9622322782595482303.hoa' '--buchi-type=spotba'
LTSmin run took 54 ms.
FORMULA HouseConstruction-PT-00020-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-00020-LTLFireability-06 finished in 1885 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((G(p1)&&p0)||(F(G(F(p2)))&&X(p1))))))'
Support contains 3 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.0 ms
Discarding 11 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 14 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 12 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 12 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 11 place count 8 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 11 place count 8 transition count 5
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 7 transition count 5
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 6 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 14 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 3 with 2 rules applied. Total rules applied 16 place count 5 transition count 4
Applied a total of 16 rules in 5 ms. Remains 5 /26 variables (removed 21) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 5 cols
[2022-05-17 12:18:35] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 12:18:35] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2022-05-17 12:18:35] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 12:18:35] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-17 12:18:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2022-05-17 12:18:35] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 12:18:35] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/26 places, 4/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/26 places, 4/18 transitions.
Stuttering acceptance computed with spot in 346 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HouseConstruction-PT-00020-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={1} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={1} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1)), p1:(AND (GEQ s3 1) (GEQ s4 1)), p2:(GEQ s1 1)], nbAcceptance=2, 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 103 steps with 1 reset in 0 ms.
FORMULA HouseConstruction-PT-00020-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-LTLFireability-07 finished in 479 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p0 U (X(p0)&&p1)))||(G(!p1)&&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.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2022-05-17 12:18:35] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 12:18:36] [INFO ] Implicit Places using invariants in 58 ms returned [3, 9, 13, 20]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 59 ms to find 4 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 2 iterations. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 308 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : HouseConstruction-PT-00020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND (NOT p2) p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={1} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={1} source=2 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=4 dest: 5}], [{ cond=p1, acceptance={0} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p1 p0), acceptance={0, 1} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={1} source=5 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p1 p0), acceptance={0, 1} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={1} source=6 dest: 6}]], initial=0, aps=[p2:(LT s0 1), p1:(GEQ s15 1), p0:(AND (GEQ s13 1) (GEQ s14 1))], nbAcceptance=2, 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]]
Product exploration explored 100000 steps with 2023 reset in 242 ms.
Product exploration explored 100000 steps with 1994 reset in 185 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 p2) (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (OR (AND (NOT p2) p0) p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR (AND (NOT p2) p0) p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (G p2)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p2) (NOT p1) (NOT p0))
Knowledge based reduction with 21 factoid took 1248 ms. Reduced automaton from 7 states, 36 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA HouseConstruction-PT-00020-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00020-LTLFireability-08 finished in 2117 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0 U !p1)) U X(G(X(!p0)))))'
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.
// Phase 1: matrix 18 rows 25 cols
[2022-05-17 12:18:38] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 12:18:38] [INFO ] Implicit Places using invariants in 42 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 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 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 23/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND p1 p0), p0, (AND p1 p0), p1]
Running random walk in product with property : HouseConstruction-PT-00020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1)), p0:(LT s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2850 reset in 108 ms.
Product exploration explored 100000 steps with 2899 reset in 131 ms.
Computed a total of 23 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 p0), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 348 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 46 ms :[p0]
Finished random walk after 132 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=66 )
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 375 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 49 ms :[p0]
Stuttering acceptance computed with spot in 43 ms :[p0]
// Phase 1: matrix 18 rows 23 cols
[2022-05-17 12:18:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 12:18:39] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-17 12:18:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 12:18:39] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-17 12:18:39] [INFO ] Computed and/alt/rep : 17/22/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 12:18:39] [INFO ] Added : 11 causal constraints over 3 iterations in 19 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 23 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 : 23/23 places, 18/18 transitions.
Graph (complete) has 26 edges and 23 vertex of which 13 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 8 output transitions
Drop transitions removed 8 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 12 transition count 8
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 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 10 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 9 transition count 6
Applied a total of 6 rules in 5 ms. Remains 9 /23 variables (removed 14) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2022-05-17 12:18:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 12:18:39] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 6 rows 9 cols
[2022-05-17 12:18:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 12:18:39] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2022-05-17 12:18:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 9 cols
[2022-05-17 12:18:39] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-17 12:18:39] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/23 places, 6/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/23 places, 6/18 transitions.
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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 241 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[p0]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=85 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 43 ms :[p0]
Stuttering acceptance computed with spot in 38 ms :[p0]
// Phase 1: matrix 6 rows 9 cols
[2022-05-17 12:18:40] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 12:18:40] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 12:18:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 12:18:40] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 12:18:40] [INFO ] Computed and/alt/rep : 4/7/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 12:18:40] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 40 ms :[p0]
Stuttering criterion allowed to conclude after 120 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00020-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-LTLFireability-09 finished in 2350 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&X(!(X(!F(p0)) U G(p1)))))'
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.
// Phase 1: matrix 18 rows 25 cols
[2022-05-17 12:18:40] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 12:18:40] [INFO ] Implicit Places using invariants in 33 ms returned [9, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 34 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 2 iterations. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) p1), true, (OR (NOT p0) p1), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s7 1)), p1:(GEQ 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 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-LTLFireability-10 finished in 205 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X((!(!X(p0) U p1) U X(p2))) U p3))'
Support contains 5 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 3 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2022-05-17 12:18:40] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 12:18:40] [INFO ] Implicit Places using invariants in 56 ms returned [3, 9, 13, 20]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 58 ms to find 4 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 2 iterations. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 395 ms :[p3, true, (AND p2 p3), p2, (OR (AND (NOT p1) p2 p3) (AND p0 p2 p3)), (AND p2 p3), (OR (AND (NOT p1) p2) (AND p0 p2)), (OR (AND (NOT p1) p2) (AND p0 p2)), (OR (NOT p1) p0)]
Running random walk in product with property : HouseConstruction-PT-00020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p3, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(NOT p3), acceptance={} source=2 dest: 5}, { cond=(AND p3 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={} source=3 dest: 1}], [{ cond=(AND p3 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p0), acceptance={} source=4 dest: 5}, { cond=(AND p3 (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=(AND p3 p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 5}, { cond=(AND p3 (NOT p1) p2), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 3}, { cond=(NOT p1), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 p2), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=7 dest: 8}], [{ cond=p0, acceptance={0} source=8 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p3:(GEQ s3 1), p1:(GEQ s15 1), p2:(GEQ s11 1), p0:(AND (GEQ s13 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12407 steps with 2141 reset in 14 ms.
FORMULA HouseConstruction-PT-00020-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-LTLFireability-12 finished in 519 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!X(p0) U 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 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2022-05-17 12:18:41] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 12:18:41] [INFO ] Implicit Places using invariants in 27 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 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 2 iterations. Remains : 23/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (OR (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(LT s0 1), p0:(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, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00020-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-LTLFireability-13 finished in 162 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U X(F((G(X(p1))||p0))))))'
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.
// Phase 1: matrix 18 rows 25 cols
[2022-05-17 12:18:41] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 12:18:41] [INFO ] Implicit Places using invariants in 34 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 35 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 2 iterations. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR p0 p1), (OR p0 p1), (OR p0 p1), true, p1]
Running random walk in product with property : HouseConstruction-PT-00020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s3 1), p1:(AND (GEQ s16 1) (GEQ s17 1) (GEQ s20 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 6 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-LTLFireability-14 finished in 205 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(((p0 U p1)||F(p2)) U p3))'
Support contains 6 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 17 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Ensure Unique test removed 1 places
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 16 transition count 11
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 14 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 12 transition count 9
Applied a total of 9 rules in 4 ms. Remains 12 /26 variables (removed 14) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2022-05-17 12:18:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 12:18:41] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2022-05-17 12:18:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 12:18:41] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-17 12:18:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2022-05-17 12:18:41] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 12:18:41] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/26 places, 9/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/26 places, 9/18 transitions.
Stuttering acceptance computed with spot in 264 ms :[true, (AND p2 p3), (OR (AND p2 p3) (AND p1 p3)), p2, (OR p2 p1), p3]
Running random walk in product with property : HouseConstruction-PT-00020-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p2 p3), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND p1 p3) (AND p2 p3)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={} source=2 dest: 4}, { cond=(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(OR p1 p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=p3, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), acceptance={} source=5 dest: 5}]], initial=5, aps=[p2:(GEQ s11 1), p3:(GEQ s4 1), p1:(AND (GEQ s5 1) (GEQ s8 1) (GEQ s9 1)), p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00020-LTLFireability-15 finished in 367 ms.
All properties solved by simple procedures.
Total runtime 23351 ms.

BK_STOP 1652789922424

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HouseConstruction-PT-00020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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