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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 7.7K Apr 29 18:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 18:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 18:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 18:50 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 23K May 9 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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-00200-LTLFireability-00
FORMULA_NAME HouseConstruction-PT-00200-LTLFireability-01
FORMULA_NAME HouseConstruction-PT-00200-LTLFireability-02
FORMULA_NAME HouseConstruction-PT-00200-LTLFireability-03
FORMULA_NAME HouseConstruction-PT-00200-LTLFireability-04
FORMULA_NAME HouseConstruction-PT-00200-LTLFireability-05
FORMULA_NAME HouseConstruction-PT-00200-LTLFireability-06
FORMULA_NAME HouseConstruction-PT-00200-LTLFireability-07
FORMULA_NAME HouseConstruction-PT-00200-LTLFireability-08
FORMULA_NAME HouseConstruction-PT-00200-LTLFireability-09
FORMULA_NAME HouseConstruction-PT-00200-LTLFireability-10
FORMULA_NAME HouseConstruction-PT-00200-LTLFireability-11
FORMULA_NAME HouseConstruction-PT-00200-LTLFireability-12
FORMULA_NAME HouseConstruction-PT-00200-LTLFireability-13
FORMULA_NAME HouseConstruction-PT-00200-LTLFireability-14
FORMULA_NAME HouseConstruction-PT-00200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652803514966

Running Version 202205111006
[2022-05-17 16:05:16] [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 16:05:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 16:05:17] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2022-05-17 16:05:17] [INFO ] Transformed 26 places.
[2022-05-17 16:05:17] [INFO ] Transformed 18 transitions.
[2022-05-17 16:05:17] [INFO ] Parsed PT model containing 26 places and 18 transitions in 271 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA HouseConstruction-PT-00200-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 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
[2022-05-17 16:05:17] [INFO ] Computed 8 place invariants in 7 ms
[2022-05-17 16:05:17] [INFO ] Implicit Places using invariants in 204 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 253 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/26 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 25/26 places, 18/18 transitions.
Support contains 21 out of 25 places after structural reductions.
[2022-05-17 16:05:17] [INFO ] Flatten gal took : 24 ms
[2022-05-17 16:05:17] [INFO ] Flatten gal took : 7 ms
[2022-05-17 16:05:17] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10052 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=228 ) properties (out of 19) seen :18
Finished Best-First random walk after 272 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=54 )
Computed a total of 25 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!(!F(p0)&&(p1 U p2)) U p3))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 30 edges and 25 vertex of which 15 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 7 output transitions
Drop transitions removed 7 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 15 transition count 9
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 13 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 12 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 7 place count 12 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9 place count 11 transition count 7
Applied a total of 9 rules in 16 ms. Remains 11 /25 variables (removed 14) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 11 cols
[2022-05-17 16:05:18] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 16:05:18] [INFO ] Implicit Places using invariants in 51 ms returned [3, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/25 places, 7/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 9/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 609 ms :[true, (OR (NOT p2) p0), (OR (AND (NOT p2) p3) (AND p0 p3)), (AND p0 p3), p0, p3]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR p0 (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 4}], [{ cond=(OR (AND p0 p3) (AND (NOT p2) (NOT p1) p3)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1 p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=2 dest: 4}, { cond=(OR (AND p0 (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p3), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=p3, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(OR (AND p0 (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={} source=5 dest: 5}]], initial=5, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1)), p2:(GEQ s0 1), p1:(AND (GEQ s6 1) (GEQ s7 1)), p3:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, 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 13 steps with 0 reset in 2 ms.
FORMULA HouseConstruction-PT-00200-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00200-LTLFireability-00 finished in 792 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F(p0)))))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 30 edges and 25 vertex of which 6 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 5 transition count 3
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 2 transition count 2
Applied a total of 7 rules in 8 ms. Remains 2 /25 variables (removed 23) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:05:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 16:05:19] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:05:19] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 16:05:19] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-17 16:05:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:05:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 16:05:19] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/25 places, 2/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/25 places, 2/18 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-01 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:(LT s1 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 2386 reset in 263 ms.
Product exploration explored 100000 steps with 2486 reset in 175 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA HouseConstruction-PT-00200-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00200-LTLFireability-01 finished in 832 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(F(p2)&&p1)||p3)))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2022-05-17 16:05:20] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-17 16:05:20] [INFO ] Implicit Places using invariants in 48 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/25 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/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p0 p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(GEQ s4 1), p3:(AND (GEQ s13 1) (GEQ s8 1) (GEQ s11 1) (GEQ s12 1)), p0:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1)), p1:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00200-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00200-LTLFireability-02 finished in 346 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||X(p0)||p1))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 30 edges and 25 vertex of which 12 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 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 3 place count 11 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 9 place count 7 transition count 6
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 7 transition count 4
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 14 place count 4 transition count 4
Applied a total of 14 rules in 4 ms. Remains 4 /25 variables (removed 21) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-17 16:05:20] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 16:05:20] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-17 16:05:20] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-17 16:05:20] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-17 16:05:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-17 16:05:20] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-17 16:05:20] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/25 places, 4/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s1 1), p0:(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 5942 reset in 458 ms.
Product exploration explored 100000 steps with 6030 reset in 257 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 5 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA HouseConstruction-PT-00200-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00200-LTLFireability-03 finished in 1069 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 30 edges and 25 vertex of which 14 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 13 transition count 7
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 7
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 11 transition count 5
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 7 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 11 place count 7 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 16 place count 4 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 4 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 3 transition count 2
Applied a total of 18 rules in 10 ms. Remains 3 /25 variables (removed 22) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 3 cols
[2022-05-17 16:05:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:05:21] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 2 rows 3 cols
[2022-05-17 16:05:21] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 16:05:21] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-17 16:05:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 3 cols
[2022-05-17 16:05:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:05:21] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/25 places, 2/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/25 places, 2/18 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s2 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 57 ms.
Product exploration explored 100000 steps with 50000 reset in 62 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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 116 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA HouseConstruction-PT-00200-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00200-LTLFireability-05 finished in 400 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2022-05-17 16:05:21] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 16:05:21] [INFO ] Implicit Places using invariants in 71 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 73 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 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 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s13 1) (GEQ s14 1)) (GEQ s16 1)), p1:(AND (GEQ s13 1) (GEQ s14 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 2671 reset in 323 ms.
Product exploration explored 100000 steps with 2622 reset in 212 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 417 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2413 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=804 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 8 factoid took 391 ms. Reduced automaton from 2 states, 2 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 39 ms :[(NOT p0)]
// Phase 1: matrix 18 rows 22 cols
[2022-05-17 16:05:23] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 16:05:23] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-17 16:05:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:05:23] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-17 16:05:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:05:23] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-17 16:05:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:05:23] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-17 16:05:23] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 16:05:23] [INFO ] Added : 17 causal constraints over 4 iterations in 47 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Graph (complete) has 24 edges and 22 vertex of which 13 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 12 transition count 7
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 9 transition count 7
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 7 place count 9 transition count 4
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 14 place count 5 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 5 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 4 transition count 3
Applied a total of 16 rules in 13 ms. Remains 4 /22 variables (removed 18) and now considering 3/18 (removed 15) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 16:05:23] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 16:05:23] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 16:05:23] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:05:23] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-17 16:05:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 16:05:23] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-17 16:05:23] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/22 places, 3/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/22 places, 3/18 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 p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA HouseConstruction-PT-00200-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00200-LTLFireability-06 finished in 2151 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||p2)))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2022-05-17 16:05:24] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 16:05:24] [INFO ] Implicit Places using invariants in 38 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LT s15 1), p0:(LT s11 1), p2:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 61 ms.
Product exploration explored 100000 steps with 50000 reset in 74 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))
Knowledge based reduction with 9 factoid took 148 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA HouseConstruction-PT-00200-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00200-LTLFireability-07 finished in 503 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(X(G(X(F(p0))))))&&X(F(p1)))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2022-05-17 16:05:24] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 16:05:24] [INFO ] Implicit Places using invariants in 44 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 45 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s8 1) (LT s9 1)), p1:(GEQ s12 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]]
Product exploration explored 100000 steps with 3558 reset in 95 ms.
Product exploration explored 100000 steps with 3661 reset in 111 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), true, (X (X p0)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 400 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Finished random walk after 2011 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1005 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), true, (X (X p0)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 8 factoid took 294 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 16:05:25] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 16:05:25] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 16:05:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:05:25] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-17 16:05:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:05:26] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 16:05:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:05:26] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 16:05:26] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 16:05:26] [INFO ] Added : 17 causal constraints over 4 iterations in 24 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Graph (complete) has 22 edges and 21 vertex of which 9 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 6 transition count 5
Applied a total of 4 rules in 9 ms. Remains 6 /21 variables (removed 15) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 6 cols
[2022-05-17 16:05:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:05:26] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-17 16:05:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:05:26] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-17 16:05:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-17 16:05:26] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 16:05:26] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/21 places, 5/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/21 places, 5/18 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 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 p1)]
Finished random walk after 604 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=302 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 173 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 p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
// Phase 1: matrix 5 rows 6 cols
[2022-05-17 16:05:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:05:26] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-17 16:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:05:26] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 16:05:26] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 16:05:26] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Product exploration explored 100000 steps with 9516 reset in 105 ms.
Product exploration explored 100000 steps with 9484 reset in 96 ms.
Built C files in :
/tmp/ltsmin16442112854710035032
[2022-05-17 16:05:26] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-17 16:05:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 16:05:26] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-17 16:05:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 16:05:26] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-17 16:05:26] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 16:05:26] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16442112854710035032
Running compilation step : cd /tmp/ltsmin16442112854710035032;'/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 286 ms.
Running link step : cd /tmp/ltsmin16442112854710035032;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin16442112854710035032;'/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/stateBased3559949632887187976.hoa' '--buchi-type=spotba'
LTSmin run took 138 ms.
FORMULA HouseConstruction-PT-00200-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-00200-LTLFireability-08 finished in 2855 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&G((p1 U (X(p1)||G(p0)))))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2022-05-17 16:05:27] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 16:05:27] [INFO ] Implicit Places using invariants in 34 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 36 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=true, acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={1} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={1} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 2}, { cond=(NOT p0), acceptance={0} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={1} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={1} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s2 1), p1:(GEQ s15 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 6530 reset in 119 ms.
Product exploration explored 100000 steps with 6634 reset in 139 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 940 ms. Reduced automaton from 7 states, 28 edges and 2 AP to 6 states, 21 edges and 2 AP.
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Incomplete random walk after 10052 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=628 ) properties (out of 7) seen :6
Finished Best-First random walk after 90 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1))), (F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F p0), (F (OR p0 p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 922 ms. Reduced automaton from 6 states, 21 edges and 2 AP to 6 states, 21 edges and 2 AP.
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 16:05:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 16:05:30] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-17 16:05:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:05:30] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-17 16:05:30] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 16:05:30] [INFO ] Added : 0 causal constraints over 0 iterations in 28 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 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 5 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 16:05:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 16:05:30] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 16:05:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 16:05:30] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 16:05:30] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 16:05:30] [INFO ] Dead Transitions using invariants and state equation in 32 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 : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (OR p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 11 factoid took 790 ms. Reduced automaton from 6 states, 21 edges and 2 AP to 6 states, 21 edges and 2 AP.
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Incomplete random walk after 10052 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=773 ) properties (out of 7) seen :6
Finished Best-First random walk after 598 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=149 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (OR p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1))), (F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F p0), (F (OR p0 p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 882 ms. Reduced automaton from 6 states, 21 edges and 2 AP to 6 states, 21 edges and 2 AP.
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 16:05:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 16:05:33] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 16:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:05:33] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-17 16:05:33] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 16:05:33] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 335 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 15455 reset in 96 ms.
Product exploration explored 100000 steps with 14914 reset in 110 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Support contains 2 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 12 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 12 transition count 11
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 3 place count 12 transition count 12
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 12 transition count 12
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 11 transition count 11
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 11 transition count 11
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 9 rules in 4 ms. Remains 11 /21 variables (removed 10) and now considering 11/18 (removed 7) transitions.
[2022-05-17 16:05:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2022-05-17 16:05:34] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:05:34] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/21 places, 11/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/21 places, 11/18 transitions.
Product exploration explored 100000 steps with 18244 reset in 231 ms.
Product exploration explored 100000 steps with 17906 reset in 217 ms.
Built C files in :
/tmp/ltsmin12683941652144267023
[2022-05-17 16:05:34] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12683941652144267023
Running compilation step : cd /tmp/ltsmin12683941652144267023;'/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 99 ms.
Running link step : cd /tmp/ltsmin12683941652144267023;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin12683941652144267023;'/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/stateBased3075014305099135059.hoa' '--buchi-type=spotba'
LTSmin run took 1131 ms.
FORMULA HouseConstruction-PT-00200-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-00200-LTLFireability-09 finished in 8800 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(((!F(p0)||X(p0)) U p0)))))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2022-05-17 16:05:36] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 16:05:36] [INFO ] Implicit Places using invariants in 30 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2561 steps with 0 reset in 4 ms.
FORMULA HouseConstruction-PT-00200-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00200-LTLFireability-10 finished in 203 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2022-05-17 16:05:36] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 16:05:36] [INFO ] Implicit Places using invariants in 35 ms returned [3, 9, 13]
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 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 8 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s3 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00200-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00200-LTLFireability-11 finished in 138 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)||(F(p2) U G(!F(X(p3))))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2022-05-17 16:05:36] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 16:05:36] [INFO ] Implicit Places using invariants in 27 ms returned [9, 13]
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 : 22/25 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 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p1) p3), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p2) p3)), (OR (AND (NOT p0) p3) (AND (NOT p1) p3)), (NOT p2), (AND (NOT p2) p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), p3]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) p3), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0 p3), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=(NOT p3), acceptance={} source=6 dest: 6}, { cond=p3, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s2 1), p2:(GEQ s21 1), p0:(GEQ s16 1), p3:(AND (GEQ s3 1) (GEQ s7 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]]
Product exploration explored 100000 steps with 33508 reset in 85 ms.
Product exploration explored 100000 steps with 33215 reset in 111 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) (NOT p2) (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) p0 p3))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) p3))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (AND (NOT p2) (NOT p0))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 1278 ms. Reduced automaton from 7 states, 16 edges and 4 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 299 ms :[false, false, (NOT p2), (AND (NOT p2) p3), p3]
Finished random walk after 1412 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=706 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) p0 p3))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) p3))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (AND (NOT p2) (NOT p0))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p3)))]
False Knowledge obtained : [(F p3), (F (AND (NOT p2) p3)), (F p2)]
Knowledge based reduction with 22 factoid took 1195 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 271 ms :[false, false, (NOT p2), (AND (NOT p2) p3), p3]
Stuttering acceptance computed with spot in 209 ms :[false, false, (NOT p2), (AND (NOT p2) p3), p3]
Support contains 3 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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.
// Phase 1: matrix 18 rows 22 cols
[2022-05-17 16:05:40] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 16:05:40] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2022-05-17 16:05:40] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 16:05:40] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2022-05-17 16:05:40] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 16:05:40] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 p3) (NOT p2)), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT p2))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 324 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 214 ms :[p3, p3, (NOT p2), (AND (NOT p2) p3), p3]
Finished random walk after 2614 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=653 )
Knowledge obtained : [(AND (NOT p3) (NOT p2)), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT p2))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p2), (F p3), (F (AND p3 (NOT p2)))]
Knowledge based reduction with 6 factoid took 388 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 220 ms :[p3, p3, (NOT p2), (AND (NOT p2) p3), p3]
Stuttering acceptance computed with spot in 196 ms :[p3, p3, (NOT p2), (AND (NOT p2) p3), p3]
Stuttering acceptance computed with spot in 196 ms :[p3, p3, (NOT p2), (AND (NOT p2) p3), p3]
Product exploration explored 100000 steps with 19905 reset in 66 ms.
Product exploration explored 100000 steps with 19970 reset in 80 ms.
Applying partial POR strategy [false, false, true, true, false]
Stuttering acceptance computed with spot in 183 ms :[p3, p3, (NOT p2), (AND (NOT p2) p3), p3]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Graph (complete) has 24 edges and 22 vertex of which 9 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 9 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 9 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 9 transition count 8
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 7 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 7 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 9 rules in 2 ms. Remains 7 /22 variables (removed 15) and now considering 6/18 (removed 12) transitions.
[2022-05-17 16:05:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-17 16:05:42] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:05:42] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/22 places, 6/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/22 places, 6/18 transitions.
Product exploration explored 100000 steps with 19977 reset in 176 ms.
Product exploration explored 100000 steps with 19926 reset in 193 ms.
Built C files in :
/tmp/ltsmin11148434829959555617
[2022-05-17 16:05:43] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11148434829959555617
Running compilation step : cd /tmp/ltsmin11148434829959555617;'/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 110 ms.
Running link step : cd /tmp/ltsmin11148434829959555617;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11148434829959555617;'/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/stateBased6240157941314136330.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 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.
// Phase 1: matrix 18 rows 22 cols
[2022-05-17 16:05:58] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 16:05:58] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2022-05-17 16:05:58] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 16:05:58] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2022-05-17 16:05:58] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 16:05:58] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin15421553583268198757
[2022-05-17 16:05:58] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15421553583268198757
Running compilation step : cd /tmp/ltsmin15421553583268198757;'/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 100 ms.
Running link step : cd /tmp/ltsmin15421553583268198757;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin15421553583268198757;'/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/stateBased559973437939335073.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 16:06:13] [INFO ] Flatten gal took : 4 ms
[2022-05-17 16:06:13] [INFO ] Flatten gal took : 10 ms
[2022-05-17 16:06:13] [INFO ] Time to serialize gal into /tmp/LTL8289329203612778657.gal : 1 ms
[2022-05-17 16:06:13] [INFO ] Time to serialize properties into /tmp/LTL15025652884332886804.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8289329203612778657.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15025652884332886804.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8289329...267
Read 1 LTL properties
Checking formula 0 : !((((X("(p22>=1)"))U("(p3>=1)"))||((F("(p16>=1)"))U(G(!(F(X("((p4>=1)&&(p15>=1))"))))))))
Formula 0 simplified : !((X"(p22>=1)" U "(p3>=1)") | (F"(p16>=1)" U G!FX"((p4>=1)&&(p15>=1))"))
Detected timeout of ITS tools.
[2022-05-17 16:06:28] [INFO ] Flatten gal took : 9 ms
[2022-05-17 16:06:28] [INFO ] Applying decomposition
[2022-05-17 16:06:28] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1425606141588946938.txt' '-o' '/tmp/graph1425606141588946938.bin' '-w' '/tmp/graph1425606141588946938.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1425606141588946938.bin' '-l' '-1' '-v' '-w' '/tmp/graph1425606141588946938.weights' '-q' '0' '-e' '0.001'
[2022-05-17 16:06:28] [INFO ] Decomposing Gal with order
[2022-05-17 16:06:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 16:06:28] [INFO ] Flatten gal took : 45 ms
[2022-05-17 16:06:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-17 16:06:28] [INFO ] Time to serialize gal into /tmp/LTL3122062123277689608.gal : 1 ms
[2022-05-17 16:06:28] [INFO ] Time to serialize properties into /tmp/LTL709208320990258547.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3122062123277689608.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL709208320990258547.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3122062...244
Read 1 LTL properties
Checking formula 0 : !((((X("(u5.p22>=1)"))U("(u0.p3>=1)"))||((F("(u7.p16>=1)"))U(G(!(F(X("((u7.p4>=1)&&(i2.u2.p15>=1))"))))))))
Formula 0 simplified : !((X"(u5.p22>=1)" U "(u0.p3>=1)") | (F"(u7.p16>=1)" U G!FX"((u7.p4>=1)&&(i2.u2.p15>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin598962489906863607
[2022-05-17 16:06:43] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin598962489906863607
Running compilation step : cd /tmp/ltsmin598962489906863607;'/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 102 ms.
Running link step : cd /tmp/ltsmin598962489906863607;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin598962489906863607;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X((LTLAPp0==true)) U (LTLAPp1==true))||(<>((LTLAPp2==true)) U [](!<>(X((LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-00200-LTLFireability-12 finished in 82198 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||(X(p1)&&X(p2))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 2 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2022-05-17 16:06:58] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 16:06:58] [INFO ] Implicit Places using invariants in 38 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(GEQ s1 1), p2:(AND (GEQ s8 1) (GEQ s9 1)), p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 3600 steps with 0 reset in 7 ms.
FORMULA HouseConstruction-PT-00200-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00200-LTLFireability-13 finished in 194 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||p1)))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 2 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2022-05-17 16:06:58] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 16:06:59] [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 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s5 1), p0:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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-00200-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00200-LTLFireability-14 finished in 144 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(G(X(X((F(p0)||p1))))))&&F(!p1)))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 30 edges and 25 vertex of which 18 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 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 17 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 14 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 14 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 9 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 15 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 8 transition count 6
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 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 4 transition count 4
Applied a total of 22 rules in 11 ms. Remains 4 /25 variables (removed 21) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-17 16:06:59] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 16:06:59] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-17 16:06:59] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 16:06:59] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-17 16:06:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-17 16:06:59] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 16:06:59] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/25 places, 4/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) p1), p1, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s3 1), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1156 steps with 4 reset in 5 ms.
FORMULA HouseConstruction-PT-00200-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00200-LTLFireability-15 finished in 251 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)||(F(p2) U G(!F(X(p3))))))'
Found a SL insensitive property : HouseConstruction-PT-00200-LTLFireability-12
Stuttering acceptance computed with spot in 341 ms :[(AND (NOT p1) p3), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p2) p3)), (OR (AND (NOT p0) p3) (AND (NOT p1) p3)), (NOT p2), (AND (NOT p2) p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), p3]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Graph (complete) has 30 edges and 25 vertex of which 20 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 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 18 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 16 transition count 12
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 16 transition count 9
Deduced a syphon composed of 3 places in 1 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 11 transition count 9
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 11 transition count 8
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 10 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
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 18 place count 8 transition count 7
Applied a total of 18 rules in 6 ms. Remains 8 /25 variables (removed 17) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 8 cols
[2022-05-17 16:06:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:06:59] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2022-05-17 16:06:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 16:06:59] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 8 cols
[2022-05-17 16:06:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:06:59] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 8/25 places, 7/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/25 places, 7/18 transitions.
Running random walk in product with property : HouseConstruction-PT-00200-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) p3), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0 p3), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=(NOT p3), acceptance={} source=6 dest: 6}, { cond=p3, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s1 1), p2:(GEQ s7 1), p0:(GEQ s6 1), p3:(AND (GEQ s2 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 30700 reset in 72 ms.
Product exploration explored 100000 steps with 30455 reset in 81 ms.
Computed a total of 8 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 7
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 p2) (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) p0 p3))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) p3))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (AND (NOT p2) (NOT p0))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 1136 ms. Reduced automaton from 7 states, 16 edges and 4 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 203 ms :[false, false, (NOT p2), (AND (NOT p2) p3), p3]
Finished random walk after 604 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=302 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) p0 p3))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) p3))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (AND (NOT p2) (NOT p0))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p3)))]
False Knowledge obtained : [(F p3), (F (AND (NOT p2) p3)), (F p2)]
Knowledge based reduction with 22 factoid took 1185 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 198 ms :[false, false, (NOT p2), (AND (NOT p2) p3), p3]
Stuttering acceptance computed with spot in 202 ms :[false, false, (NOT p2), (AND (NOT p2) p3), p3]
Support contains 3 out of 8 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 8 cols
[2022-05-17 16:07:03] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:07:03] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2022-05-17 16:07:03] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 16:07:03] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 8 cols
[2022-05-17 16:07:03] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 16:07:03] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 7/7 transitions.
Computed a total of 8 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 7
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 p3) (NOT p2)), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT p2))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 317 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 208 ms :[p3, p3, (NOT p2), (AND (NOT p2) p3), p3]
Finished random walk after 1006 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=125 )
Knowledge obtained : [(AND (NOT p3) (NOT p2)), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT p2))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p2), (F p3), (F (AND p3 (NOT p2)))]
Knowledge based reduction with 6 factoid took 305 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 184 ms :[p3, p3, (NOT p2), (AND (NOT p2) p3), p3]
Stuttering acceptance computed with spot in 204 ms :[p3, p3, (NOT p2), (AND (NOT p2) p3), p3]
Stuttering acceptance computed with spot in 286 ms :[p3, p3, (NOT p2), (AND (NOT p2) p3), p3]
Product exploration explored 100000 steps with 16322 reset in 124 ms.
Product exploration explored 100000 steps with 16143 reset in 131 ms.
Applying partial POR strategy [false, false, true, true, false]
Stuttering acceptance computed with spot in 177 ms :[p3, p3, (NOT p2), (AND (NOT p2) p3), p3]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 7/7 transitions.
Graph (complete) has 8 edges and 8 vertex of which 6 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 6 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 3 ms. Remains 6 /8 variables (removed 2) and now considering 5/7 (removed 2) transitions.
[2022-05-17 16:07:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-17 16:07:05] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 16:07:05] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8 places, 5/7 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/8 places, 5/7 transitions.
Product exploration explored 100000 steps with 17022 reset in 125 ms.
Product exploration explored 100000 steps with 17095 reset in 112 ms.
Built C files in :
/tmp/ltsmin18190879314259530889
[2022-05-17 16:07:05] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18190879314259530889
Running compilation step : cd /tmp/ltsmin18190879314259530889;'/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 84 ms.
Running link step : cd /tmp/ltsmin18190879314259530889;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin18190879314259530889;'/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/stateBased13456558719206800889.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 8 cols
[2022-05-17 16:07:20] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:07:20] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2022-05-17 16:07:20] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:07:20] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 8 cols
[2022-05-17 16:07:20] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:07:20] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 7/7 transitions.
Built C files in :
/tmp/ltsmin14674965708808236305
[2022-05-17 16:07:20] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14674965708808236305
Running compilation step : cd /tmp/ltsmin14674965708808236305;'/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 84 ms.
Running link step : cd /tmp/ltsmin14674965708808236305;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin14674965708808236305;'/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/stateBased212439997205362771.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 16:07:35] [INFO ] Flatten gal took : 2 ms
[2022-05-17 16:07:35] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:07:35] [INFO ] Time to serialize gal into /tmp/LTL3166654995673147598.gal : 1 ms
[2022-05-17 16:07:35] [INFO ] Time to serialize properties into /tmp/LTL1794708588075877764.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3166654995673147598.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1794708588075877764.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3166654...266
Read 1 LTL properties
Checking formula 0 : !((((X("(p22>=1)"))U("(p3>=1)"))||((F("(p16>=1)"))U(G(!(F(X("((p4>=1)&&(p15>=1))"))))))))
Formula 0 simplified : !((X"(p22>=1)" U "(p3>=1)") | (F"(p16>=1)" U G!FX"((p4>=1)&&(p15>=1))"))
Detected timeout of ITS tools.
[2022-05-17 16:07:50] [INFO ] Flatten gal took : 2 ms
[2022-05-17 16:07:50] [INFO ] Applying decomposition
[2022-05-17 16:07:50] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12742372005758857415.txt' '-o' '/tmp/graph12742372005758857415.bin' '-w' '/tmp/graph12742372005758857415.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12742372005758857415.bin' '-l' '-1' '-v' '-w' '/tmp/graph12742372005758857415.weights' '-q' '0' '-e' '0.001'
[2022-05-17 16:07:50] [INFO ] Decomposing Gal with order
[2022-05-17 16:07:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 16:07:50] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:07:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-17 16:07:50] [INFO ] Time to serialize gal into /tmp/LTL12156450531589522735.gal : 0 ms
[2022-05-17 16:07:50] [INFO ] Time to serialize properties into /tmp/LTL9945989177554023089.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12156450531589522735.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9945989177554023089.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1215645...246
Read 1 LTL properties
Checking formula 0 : !((((X("(u2.p22>=1)"))U("(u0.p3>=1)"))||((F("(u3.p16>=1)"))U(G(!(F(X("((u3.p4>=1)&&(u1.p15>=1))"))))))))
Formula 0 simplified : !((X"(u2.p22>=1)" U "(u0.p3>=1)") | (F"(u3.p16>=1)" U G!FX"((u3.p4>=1)&&(u1.p15>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13256519278217828752
[2022-05-17 16:08:05] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13256519278217828752
Running compilation step : cd /tmp/ltsmin13256519278217828752;'/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 88 ms.
Running link step : cd /tmp/ltsmin13256519278217828752;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin13256519278217828752;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X((LTLAPp0==true)) U (LTLAPp1==true))||(<>((LTLAPp2==true)) U [](!<>(X((LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-00200-LTLFireability-12 finished in 81739 ms.
[2022-05-17 16:08:21] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
[2022-05-17 16:08:21] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin11768861159801777923
[2022-05-17 16:08:21] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2022-05-17 16:08:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 16:08:21] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2022-05-17 16:08:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 16:08:21] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2022-05-17 16:08:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 16:08:21] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11768861159801777923
Running compilation step : cd /tmp/ltsmin11768861159801777923;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
[2022-05-17 16:08:21] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18313684402939044749.txt' '-o' '/tmp/graph18313684402939044749.bin' '-w' '/tmp/graph18313684402939044749.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18313684402939044749.bin' '-l' '-1' '-v' '-w' '/tmp/graph18313684402939044749.weights' '-q' '0' '-e' '0.001'
[2022-05-17 16:08:21] [INFO ] Decomposing Gal with order
[2022-05-17 16:08:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 16:08:21] [INFO ] Flatten gal took : 5 ms
[2022-05-17 16:08:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-17 16:08:21] [INFO ] Time to serialize gal into /tmp/LTLFireability18025366640231305696.gal : 3 ms
[2022-05-17 16:08:21] [INFO ] Time to serialize properties into /tmp/LTLFireability1290114266952877102.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18025366640231305696.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1290114266952877102.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((((X("(u7.p22>=1)"))U("(u0.p3>=1)"))||((F("(u8.p16>=1)"))U(G(!(F(X("((u8.p4>=1)&&(u2.p15>=1))"))))))))
Formula 0 simplified : !((X"(u7.p22>=1)" U "(u0.p3>=1)") | (F"(u8.p16>=1)" U G!FX"((u8.p4>=1)&&(u2.p15>=1))"))
Compilation finished in 134 ms.
Running link step : cd /tmp/ltsmin11768861159801777923;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin11768861159801777923;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X((LTLAPp0==true)) U (LTLAPp1==true))||(<>((LTLAPp2==true)) U [](!<>(X((LTLAPp3==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: LTL layer: formula: ((X((LTLAPp0==true)) U (LTLAPp1==true))||(<>((LTLAPp2==true)) U [](!<>(X((LTLAPp3==true))))))
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: "((X((LTLAPp0==true)) U (LTLAPp1==true))||(<>((LTLAPp2==true)) U [](!<>(X((LTLAPp3==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.023: There are 23 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.023: State length is 26, there are 42 groups
pins2lts-mc-linux64( 0/ 8), 0.023: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.023: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.023: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.023: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.087: [Blue] ~105 levels ~960 states ~4184 transitions
pins2lts-mc-linux64( 3/ 8), 0.145: [Blue] ~208 levels ~1920 states ~7336 transitions
pins2lts-mc-linux64( 3/ 8), 0.266: [Blue] ~413 levels ~3840 states ~13624 transitions
pins2lts-mc-linux64( 3/ 8), 0.441: [Blue] ~825 levels ~7680 states ~26264 transitions
pins2lts-mc-linux64( 3/ 8), 0.667: [Blue] ~1592 levels ~15360 states ~47520 transitions
pins2lts-mc-linux64( 4/ 8), 0.951: [Blue] ~2545 levels ~30720 states ~102928 transitions
pins2lts-mc-linux64( 3/ 8), 1.221: [Blue] ~3002 levels ~61440 states ~153512 transitions
pins2lts-mc-linux64( 0/ 8), 1.635: [Blue] ~3602 levels ~122880 states ~299136 transitions
pins2lts-mc-linux64( 0/ 8), 2.176: [Blue] ~3602 levels ~245760 states ~602760 transitions
pins2lts-mc-linux64( 0/ 8), 3.136: [Blue] ~3602 levels ~491520 states ~1338472 transitions
pins2lts-mc-linux64( 4/ 8), 4.268: [Blue] ~3008 levels ~983040 states ~2995256 transitions
pins2lts-mc-linux64( 3/ 8), 5.769: [Blue] ~3002 levels ~1966080 states ~6199400 transitions
pins2lts-mc-linux64( 4/ 8), 8.736: [Blue] ~3008 levels ~3932160 states ~12934600 transitions
pins2lts-mc-linux64( 6/ 8), 14.277: [Blue] ~2995 levels ~7864320 states ~21231648 transitions
pins2lts-mc-linux64( 6/ 8), 26.559: [Blue] ~2995 levels ~15728640 states ~43088952 transitions
pins2lts-mc-linux64( 6/ 8), 51.883: [Blue] ~2995 levels ~31457280 states ~87152816 transitions
pins2lts-mc-linux64( 4/ 8), 83.798: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 83.854:
pins2lts-mc-linux64( 0/ 8), 83.854: Explored 39414931 states 158592705 transitions, fanout: 4.024
pins2lts-mc-linux64( 0/ 8), 83.854: Total exploration time 83.820 sec (83.760 sec minimum, 83.789 sec on average)
pins2lts-mc-linux64( 0/ 8), 83.854: States per second: 470233, Transitions per second: 1892063
pins2lts-mc-linux64( 0/ 8), 83.854:
pins2lts-mc-linux64( 0/ 8), 83.854: State space has 39512994 states, 28561106 are accepting
pins2lts-mc-linux64( 0/ 8), 83.854: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 83.854: blue states: 39414931 (99.75%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 83.854: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 83.854: all-red states: 31079858 (78.66%), bogus 7 (0.00%)
pins2lts-mc-linux64( 0/ 8), 83.854:
pins2lts-mc-linux64( 0/ 8), 83.854: Total memory used for local state coloring: 0.4MB
pins2lts-mc-linux64( 0/ 8), 83.854:
pins2lts-mc-linux64( 0/ 8), 83.854: Queue width: 8B, total height: 26397, memory: 0.20MB
pins2lts-mc-linux64( 0/ 8), 83.854: Tree memory: 557.5MB, 14.8 B/state, compr.: 14.0%
pins2lts-mc-linux64( 0/ 8), 83.854: Tree fill ratio (roots/leafs): 29.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 83.854: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 83.854: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 83.854: Est. total memory use: 557.7MB (~1024.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11768861159801777923;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X((LTLAPp0==true)) U (LTLAPp1==true))||(<>((LTLAPp2==true)) U [](!<>(X((LTLAPp3==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11768861159801777923;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X((LTLAPp0==true)) U (LTLAPp1==true))||(<>((LTLAPp2==true)) U [](!<>(X((LTLAPp3==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-17 16:29:22] [INFO ] Flatten gal took : 3 ms
[2022-05-17 16:29:22] [INFO ] Time to serialize gal into /tmp/LTLFireability17735762200806263134.gal : 1 ms
[2022-05-17 16:29:22] [INFO ] Time to serialize properties into /tmp/LTLFireability8029020653736418853.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17735762200806263134.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8029020653736418853.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 1 LTL properties
Checking formula 0 : !((((X("(p22>=1)"))U("(p3>=1)"))||((F("(p16>=1)"))U(G(!(F(X("((p4>=1)&&(p15>=1))"))))))))
Formula 0 simplified : !((X"(p22>=1)" U "(p3>=1)") | (F"(p16>=1)" U G!FX"((p4>=1)&&(p15>=1))"))
Detected timeout of ITS tools.
[2022-05-17 16:50:25] [INFO ] Flatten gal took : 718 ms
[2022-05-17 16:50:26] [INFO ] Input system was already deterministic with 18 transitions.
[2022-05-17 16:50:27] [INFO ] Transformed 25 places.
[2022-05-17 16:50:27] [INFO ] Transformed 18 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-17 16:50:27] [INFO ] Time to serialize gal into /tmp/LTLFireability16700243782195371899.gal : 11 ms
[2022-05-17 16:50:27] [INFO ] Time to serialize properties into /tmp/LTLFireability17471787957002290981.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16700243782195371899.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17471787957002290981.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((((X("(p22>=1)"))U("(p3>=1)"))||((F("(p16>=1)"))U(G(!(F(X("((p4>=1)&&(p15>=1))"))))))))
Formula 0 simplified : !((X"(p22>=1)" U "(p3>=1)") | (F"(p16>=1)" U G!FX"((p4>=1)&&(p15>=1))"))

BK_TIME_CONFINEMENT_REACHED

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-00200"
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-00200, 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-165264477600404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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