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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 7.2K Apr 29 18:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 18:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 18:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 18:57 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.6K May 9 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K May 9 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 13K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652784862558

Running Version 202205111006
[2022-05-17 10:54:24] [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 10:54:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 10:54:24] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2022-05-17 10:54:24] [INFO ] Transformed 26 places.
[2022-05-17 10:54:24] [INFO ] Transformed 18 transitions.
[2022-05-17 10:54:24] [INFO ] Parsed PT model containing 26 places and 18 transitions in 226 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HouseConstruction-PT-00002-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00002-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00002-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 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 10:54:25] [INFO ] Computed 8 place invariants in 8 ms
[2022-05-17 10:54:25] [INFO ] Implicit Places using invariants in 188 ms returned [3, 9, 13, 20]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 235 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 22/26 places, 18/18 transitions.
Support contains 17 out of 22 places after structural reductions.
[2022-05-17 10:54:25] [INFO ] Flatten gal took : 35 ms
[2022-05-17 10:54:25] [INFO ] Flatten gal took : 12 ms
[2022-05-17 10:54:25] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 4931 steps, including 91 resets, run visited all 17 properties in 108 ms. (steps per millisecond=45 )
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).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0) U (!X(F(p1))&&p1)))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 6 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:26] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:26] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:26] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-17 10:54:26] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:26] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-17 10:54:26] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 576 ms :[true, true, true, (NOT p0), p1, (AND (NOT p0) p1)]
Running random walk in product with property : HouseConstruction-PT-00002-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 3}]], initial=0, aps=[p1:(GEQ s5 1), p0:(LT s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8547 reset in 482 ms.
Product exploration explored 100000 steps with 8622 reset in 285 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 p1) p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 391 ms. Reduced automaton from 6 states, 11 edges and 2 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 218 ms :[true, true, true, p1]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 384 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:29] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:29] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-17 10:54:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:54:29] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-17 10:54:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:54:29] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-17 10:54:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:54:29] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-17 10:54:29] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 16 ms.
[2022-05-17 10:54:29] [INFO ] Added : 17 causal constraints over 4 iterations in 78 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 LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:29] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-17 10:54:29] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:29] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-17 10:54:29] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:29] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-17 10:54:29] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 18/18 transitions.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p1), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:30] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-17 10:54:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:54:30] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-17 10:54:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:54:30] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-17 10:54:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:54:30] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-17 10:54:30] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 10:54:30] [INFO ] Added : 17 causal constraints over 4 iterations in 39 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 255 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 13491 reset in 129 ms.
Product exploration explored 100000 steps with 13479 reset in 406 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Graph (complete) has 22 edges and 21 vertex of which 5 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 5
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 5 transition count 5
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 5 transition count 5
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 8 rules in 10 ms. Remains 3 /21 variables (removed 18) and now considering 3/18 (removed 15) transitions.
[2022-05-17 10:54:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-17 10:54:32] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 10:54:32] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/21 places, 3/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/21 places, 3/18 transitions.
Product exploration explored 100000 steps with 25000 reset in 324 ms.
Product exploration explored 100000 steps with 25000 reset in 316 ms.
Built C files in :
/tmp/ltsmin16226391125038446053
[2022-05-17 10:54:32] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16226391125038446053
Running compilation step : cd /tmp/ltsmin16226391125038446053;'/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 391 ms.
Running link step : cd /tmp/ltsmin16226391125038446053;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin16226391125038446053;'/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/stateBased2289793587178442331.hoa' '--buchi-type=spotba'
LTSmin run took 221 ms.
FORMULA HouseConstruction-PT-00002-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-00002-LTLFireability-00 finished in 7340 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!X(G((G(X(p0)) U p1))) U p2))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:33] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 10:54:33] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:33] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:33] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-17 10:54:33] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 316 ms :[(NOT p2), (NOT p2), (OR (NOT p2) p1), p1, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : HouseConstruction-PT-00002-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s2 1), p1:(GEQ s11 1), p0:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 1 reset in 0 ms.
FORMULA HouseConstruction-PT-00002-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00002-LTLFireability-01 finished in 491 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U X(X(!(G(!G(p1))||F(p2))))))'
Support contains 5 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 2 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 10:54:34] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 10:54:34] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2022-05-17 10:54:34] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 10:54:34] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2022-05-17 10:54:34] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-17 10:54:34] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), true, (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00002-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s16 1), p2:(AND (GEQ s18 1) (GEQ s19 1)), p1:(AND (GEQ s13 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 2 ms.
FORMULA HouseConstruction-PT-00002-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00002-LTLFireability-02 finished in 521 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:34] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:34] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:34] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:34] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:34] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:34] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00002-LTLFireability-04 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:(AND (GEQ s17 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00002-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00002-LTLFireability-04 finished in 258 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 1 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:34] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:34] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:34] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-17 10:54:34] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:34] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-17 10:54:34] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00002-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GEQ s20 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7660 reset in 131 ms.
Product exploration explored 100000 steps with 7662 reset in 159 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 301 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:36] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:36] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 10:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:54:36] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 10:54:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:54:36] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-17 10:54:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:54:36] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-17 10:54:36] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 10:54:36] [INFO ] Added : 9 causal constraints over 2 iterations in 36 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 1 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 10:54:36] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:36] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:36] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:36] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:36] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:36] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 18/18 transitions.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:37] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:37] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-17 10:54:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:54:37] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-17 10:54:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:54:37] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-17 10:54:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:54:37] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-17 10:54:37] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 10:54:37] [INFO ] Added : 9 causal constraints over 2 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7647 reset in 139 ms.
Product exploration explored 100000 steps with 7670 reset in 159 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
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 13 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 6 output transitions
Drop transitions removed 6 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 13 transition count 12
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 13 transition count 12
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 13 transition count 12
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 11 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 11 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 11 rules in 9 ms. Remains 11 /21 variables (removed 10) and now considering 10/18 (removed 8) transitions.
[2022-05-17 10:54:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2022-05-17 10:54:38] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 10:54:38] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/21 places, 10/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/21 places, 10/18 transitions.
Product exploration explored 100000 steps with 16553 reset in 260 ms.
Product exploration explored 100000 steps with 16542 reset in 346 ms.
Built C files in :
/tmp/ltsmin18117425584518986211
[2022-05-17 10:54:39] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18117425584518986211
Running compilation step : cd /tmp/ltsmin18117425584518986211;'/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 168 ms.
Running link step : cd /tmp/ltsmin18117425584518986211;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin18117425584518986211;'/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/stateBased5713575249760212856.hoa' '--buchi-type=spotba'
LTSmin run took 185 ms.
FORMULA HouseConstruction-PT-00002-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-00002-LTLFireability-06 finished in 4902 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!G(p0)||G(p1)||p2) U (X(p3)||p4)))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 1 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:39] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:39] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:39] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 386 ms :[(AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND p0 (NOT p3)), (AND p0 (NOT p1) (NOT p3)), p0, (AND p0 (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00002-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p4), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p4) (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p4) (NOT p2) p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p4) (NOT p2) p0 (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p4) (NOT p2) p0 p1 (NOT p3)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p4:(AND (GEQ s8 1) (GEQ s9 1) (GEQ s14 1)), p2:(GEQ s14 1), p0:(GEQ s11 1), p1:(AND (GEQ s8 1) (GEQ s9 1)), p3:(GEQ s1 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Product exploration explored 100000 steps with 50000 reset in 200 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 p4) (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p4) (NOT p2) p0 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p4) (NOT p2) p0 p1 (NOT p3)))), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND (NOT p4) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p4) (NOT p2) p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p4) (NOT p2) p0 p1 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p0))), (F (G (NOT p4))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p3)))]
False Knowledge obtained : [(X (X (AND (NOT p4) (NOT p3)))), (X (X (NOT (AND (NOT p4) (NOT p3)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p4) (NOT p3))))
Knowledge based reduction with 20 factoid took 846 ms. Reduced automaton from 6 states, 12 edges and 5 AP to 1 states, 0 edges and 0 AP.
FORMULA HouseConstruction-PT-00002-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00002-LTLFireability-07 finished in 1877 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p1)||p0))))))'
Support contains 2 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 10:54:41] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 10:54:41] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2022-05-17 10:54:41] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 10:54:41] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2022-05-17 10:54:41] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-17 10:54:41] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00002-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (LT s13 1) (LT s14 1)), p0:(OR (LT s13 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 99 ms.
Product exploration explored 100000 steps with 25000 reset in 119 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 p1 p0), true, (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA HouseConstruction-PT-00002-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00002-LTLFireability-08 finished in 765 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||G(F(p1))))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 1 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:42] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:42] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:42] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:42] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:42] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:42] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00002-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s4 1), p1:(GEQ s15 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 4211 reset in 144 ms.
Product exploration explored 100000 steps with 4235 reset in 166 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 (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 312 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 41 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 405 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
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 1 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 10:54:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:44] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 10:54:44] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 10:54:44] [INFO ] Dead Transitions using invariants and state equation in 42 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 p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 302 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 37 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 397 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 329 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 330 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 4235 reset in 142 ms.
Product exploration explored 100000 steps with 4240 reset in 145 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
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 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 12 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 4 place count 12 transition count 11
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 12 transition count 11
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 10 transition count 9
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 10 transition count 9
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 11 rules in 4 ms. Remains 10 /21 variables (removed 11) and now considering 9/18 (removed 9) transitions.
[2022-05-17 10:54:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-17 10:54:47] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 10:54:47] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/21 places, 9/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/21 places, 9/18 transitions.
Stuttering criterion allowed to conclude after 31 steps with 2 reset in 0 ms.
FORMULA HouseConstruction-PT-00002-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00002-LTLFireability-09 finished in 5070 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(!(G(p0) U !(F(X(F(p0)))&&F(p1))))))'
Support contains 2 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 11 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 10 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 8 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 8 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 6 transition count 5
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 4 transition count 4
Applied a total of 12 rules in 5 ms. Remains 4 /22 variables (removed 18) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-17 10:54:47] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 10:54:47] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-17 10:54:47] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 10:54:47] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-17 10:54:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-17 10:54:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 10:54:47] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/22 places, 4/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/22 places, 4/18 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00002-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s3 1), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 16 steps with 2 reset in 0 ms.
FORMULA HouseConstruction-PT-00002-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00002-LTLFireability-10 finished in 251 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(p0))&&p1)))'
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 12 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
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.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 8 transition count 6
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 9 place count 8 transition count 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 16 place count 4 transition count 3
Applied a total of 16 rules in 3 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 10:54:47] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 10:54:47] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 10:54:47] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 10:54:47] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-17 10:54:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-17 10:54:47] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 10:54:47] [INFO ] Dead Transitions using invariants and state equation in 26 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.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00002-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s0 1) (AND (GEQ s2 1) (GEQ s3 1))), p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00002-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00002-LTLFireability-11 finished in 213 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:47] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 10:54:47] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:47] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 10:54:48] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:48] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:48] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00002-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(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][false, false]]
Product exploration explored 100000 steps with 4871 reset in 133 ms.
Product exploration explored 100000 steps with 4878 reset in 167 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 198 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 47 ms :[(NOT p0)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 225 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 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:49] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 10:54:49] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-17 10:54:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 10:54:49] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 10:54:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 10:54:49] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-17 10:54:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 10:54:49] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-17 10:54:49] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 10:54:49] [INFO ] Added : 17 causal constraints over 4 iterations in 35 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Graph (complete) has 22 edges and 21 vertex of which 11 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 10 transition count 6
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 7 transition count 6
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 7 place count 7 transition count 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 14 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 14 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 16 place count 2 transition count 2
Applied a total of 16 rules in 9 ms. Remains 2 /21 variables (removed 19) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 10:54:49] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 10:54:49] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 10:54:49] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 10:54:49] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2022-05-17 10:54:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 10:54:49] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 10:54:49] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/21 places, 2/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/21 places, 2/18 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA HouseConstruction-PT-00002-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00002-LTLFireability-13 finished in 1619 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(F(F(F(!(p0 U p1))))))))'
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 12 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 11 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 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 5 place count 9 transition count 4
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 11 place count 6 transition count 4
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 5 transition count 4
Applied a total of 12 rules in 5 ms. Remains 5 /22 variables (removed 17) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 5 cols
[2022-05-17 10:54:49] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 10:54:49] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2022-05-17 10:54:49] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 10:54:49] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-17 10:54:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2022-05-17 10:54:49] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 10:54:49] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/22 places, 4/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/22 places, 4/18 transitions.
Stuttering acceptance computed with spot in 103 ms :[p1, p1]
Running random walk in product with property : HouseConstruction-PT-00002-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s4 1)), p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12363 reset in 185 ms.
Product exploration explored 100000 steps with 12344 reset in 117 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 6 factoid took 271 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA HouseConstruction-PT-00002-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00002-LTLFireability-14 finished in 847 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&F(p1))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:50] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:50] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:50] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 10:54:50] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2022-05-17 10:54:50] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 10:54:50] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 18/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00002-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(GEQ s12 1), p1:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00002-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00002-LTLFireability-15 finished in 428 ms.
All properties solved by simple procedures.
Total runtime 26286 ms.

BK_STOP 1652784891391

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HouseConstruction-PT-00002"
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-00002, 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-165264477600356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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