Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 7.3K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 21:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 21:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 13K May 5 16:51 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-00050-00
FORMULA_NAME HouseConstruction-PT-00050-01
FORMULA_NAME HouseConstruction-PT-00050-02
FORMULA_NAME HouseConstruction-PT-00050-03
FORMULA_NAME HouseConstruction-PT-00050-04
FORMULA_NAME HouseConstruction-PT-00050-05
FORMULA_NAME HouseConstruction-PT-00050-06
FORMULA_NAME HouseConstruction-PT-00050-07
FORMULA_NAME HouseConstruction-PT-00050-08
FORMULA_NAME HouseConstruction-PT-00050-09
FORMULA_NAME HouseConstruction-PT-00050-10
FORMULA_NAME HouseConstruction-PT-00050-11
FORMULA_NAME HouseConstruction-PT-00050-12
FORMULA_NAME HouseConstruction-PT-00050-13
FORMULA_NAME HouseConstruction-PT-00050-14
FORMULA_NAME HouseConstruction-PT-00050-15

=== Now, execution of the tool begins

BK_START 1620796924346

Running Version 0
[2021-05-12 05:22:06] [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]
[2021-05-12 05:22:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 05:22:06] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-12 05:22:06] [INFO ] Transformed 26 places.
[2021-05-12 05:22:06] [INFO ] Transformed 18 transitions.
[2021-05-12 05:22:06] [INFO ] Parsed PT model containing 26 places and 18 transitions in 61 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 05:22:06] [INFO ] Initial state test concluded for 2 properties.
Support contains 23 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 14 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 05:22:06] [INFO ] Computed 7 place invariants in 10 ms
[2021-05-12 05:22:06] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 05:22:06] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 05:22:06] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 05:22:06] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 05:22:06] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/26 places, 18/18 transitions.
[2021-05-12 05:22:06] [INFO ] Flatten gal took : 19 ms
[2021-05-12 05:22:06] [INFO ] Flatten gal took : 5 ms
[2021-05-12 05:22:06] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 54482 steps, including 59 resets, run visited all 21 properties in 40 ms. (steps per millisecond=1362 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((X(p1)&&p0) U X(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-12 05:22:07] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-12 05:22:07] [INFO ] Implicit Places using invariants in 33 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 35 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:22:07] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 05:22:07] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:22:07] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-12 05:22:07] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Running random walk in product with property : HouseConstruction-PT-00050-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s9 1)), p2:(GEQ s1 1), p1:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 1 reset in 2 ms.
FORMULA HouseConstruction-PT-00050-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00050-00 finished in 349 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G((p0&&X(p1)))||(p2 U p3))))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-12 05:22:07] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 05:22:07] [INFO ] Implicit Places using invariants in 23 ms returned [9, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 26 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 05:22:07] [INFO ] Computed 4 place invariants in 7 ms
[2021-05-12 05:22:07] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 22/25 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
[2021-05-12 05:22:07] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 05:22:07] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), true, (NOT p3)]
Running random walk in product with property : HouseConstruction-PT-00050-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p3) p2 p1), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={} source=3 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p3) p2 (NOT p1))), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s12 1), p3:(AND (GEQ s3 1) (GEQ s7 1) (GEQ s4 1)), p2:(AND (GEQ s3 1) (GEQ s7 1)), p1:(GEQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00050-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00050-01 finished in 282 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U (X(X(p1))&&(p1||X(p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-12 05:22:07] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 05:22:07] [INFO ] Implicit Places using invariants in 30 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 05:22:07] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 05:22:07] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 05:22:07] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 05:22:07] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1), true, (NOT p1), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00050-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1)), p1:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00050-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00050-02 finished in 276 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-12 05:22:07] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 05:22:07] [INFO ] Implicit Places using invariants in 15 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 16 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:22:07] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 05:22:07] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:22:07] [INFO ] Computed 3 place invariants in 6 ms
[2021-05-12 05:22:07] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00050-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GEQ s2 1), p0:(GEQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00050-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00050-03 finished in 196 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 24 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 19 transition count 12
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 19 transition count 7
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 23 place count 11 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 23 place count 11 transition count 6
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 26 place count 9 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 9 transition count 5
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 29 place count 7 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 29 place count 7 transition count 4
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 32 place count 5 transition count 4
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 35 place count 3 transition count 3
Applied a total of 35 rules in 9 ms. Remains 3 /25 variables (removed 22) and now considering 3/18 (removed 15) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-12 05:22:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 05:22:08] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-12 05:22:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 05:22:08] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-12 05:22:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-12 05:22:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 05:22:08] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/25 places, 3/18 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00050-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (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 172 ms.
Product exploration explored 100000 steps with 50000 reset in 112 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
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 : [(F (G (NOT p0))), (NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 75 ms.
Product exploration explored 100000 steps with 50000 reset in 57 ms.
[2021-05-12 05:22:08] [INFO ] Flatten gal took : 1 ms
[2021-05-12 05:22:08] [INFO ] Flatten gal took : 3 ms
[2021-05-12 05:22:08] [INFO ] Time to serialize gal into /tmp/LTL16167280421202590919.gal : 0 ms
[2021-05-12 05:22:08] [INFO ] Time to serialize properties into /tmp/LTL15340475320478931163.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16167280421202590919.gal, -t, CGAL, -LTL, /tmp/LTL15340475320478931163.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16167280421202590919.gal -t CGAL -LTL /tmp/LTL15340475320478931163.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("((p3>=1)||(p5>=1))")))
Formula 0 simplified : !F"((p3>=1)||(p5>=1))"
Reverse transition relation is NOT exact ! Due to transitions t4.t3.t8.t9.t10.t11.t14.t12.t5.t7.t6.t17.t15.t16.t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/2/1/3
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
26 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.284998,21528,1,0,17,31770,30,10,215,37795,22
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HouseConstruction-PT-00050-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property HouseConstruction-PT-00050-04 finished in 939 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&(p1||F(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-12 05:22:09] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 05:22:09] [INFO ] Implicit Places using invariants in 14 ms returned [9, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 15 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 05:22:09] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 05:22:09] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 22/25 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
[2021-05-12 05:22:09] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 05:22:09] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : HouseConstruction-PT-00050-05 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p2:(OR (AND (GEQ s3 1) (GEQ s7 1)) (GEQ s15 1)), p0:(OR (LT s3 1) (LT s7 1) (LT s15 1)), p1:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4982 reset in 127 ms.
Product exploration explored 100000 steps with 4954 reset in 138 ms.
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 : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p2))), (F (G p0)), (F (G (NOT p1))), (NOT p2), p0, (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 4978 reset in 90 ms.
Product exploration explored 100000 steps with 4924 reset in 102 ms.
Applying partial POR strategy [true, true, false, true, false]
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
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, iteration 0 : 22/22 places, 18/18 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 18
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 4 place count 22 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 22 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 20 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 20 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 20 transition count 16
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 15 rules in 11 ms. Remains 20 /22 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2021-05-12 05:22:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 20 cols
[2021-05-12 05:22:10] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 05:22:10] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/22 places, 16/18 transitions.
Product exploration explored 100000 steps with 14756 reset in 241 ms.
Product exploration explored 100000 steps with 14700 reset in 140 ms.
[2021-05-12 05:22:10] [INFO ] Flatten gal took : 2 ms
[2021-05-12 05:22:10] [INFO ] Flatten gal took : 2 ms
[2021-05-12 05:22:10] [INFO ] Time to serialize gal into /tmp/LTL4445507875190271619.gal : 1 ms
[2021-05-12 05:22:10] [INFO ] Time to serialize properties into /tmp/LTL10676449020442636716.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4445507875190271619.gal, -t, CGAL, -LTL, /tmp/LTL10676449020442636716.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4445507875190271619.gal -t CGAL -LTL /tmp/LTL10676449020442636716.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("(((p4<1)||(p15<1))||(p18<1))")&&(("(p18>=1)")||(F("(((p4>=1)&&(p15>=1))||(p18>=1))")))))))
Formula 0 simplified : !XX("(((p4<1)||(p15<1))||(p18<1))" & ("(p18>=1)" | F"(((p4>=1)&&(p15>=1))||(p18>=1))"))
Detected timeout of ITS tools.
[2021-05-12 05:22:25] [INFO ] Flatten gal took : 33 ms
[2021-05-12 05:22:25] [INFO ] Applying decomposition
[2021-05-12 05:22:25] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12902527730212490405.txt, -o, /tmp/graph12902527730212490405.bin, -w, /tmp/graph12902527730212490405.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12902527730212490405.bin, -l, -1, -v, -w, /tmp/graph12902527730212490405.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 05:22:25] [INFO ] Decomposing Gal with order
[2021-05-12 05:22:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 05:22:26] [INFO ] Flatten gal took : 41 ms
[2021-05-12 05:22:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 05:22:26] [INFO ] Time to serialize gal into /tmp/LTL16763413172109144805.gal : 1 ms
[2021-05-12 05:22:26] [INFO ] Time to serialize properties into /tmp/LTL18065276019883748800.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16763413172109144805.gal, -t, CGAL, -LTL, /tmp/LTL18065276019883748800.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16763413172109144805.gal -t CGAL -LTL /tmp/LTL18065276019883748800.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(("(((u7.p4<1)||(i3.u3.p15<1))||(u6.p18<1))")&&(("(u6.p18>=1)")||(F("(((u7.p4>=1)&&(i3.u3.p15>=1))||(u6.p18>=1))")))))))
Formula 0 simplified : !XX("(((u7.p4<1)||(i3.u3.p15<1))||(u6.p18<1))" & ("(u6.p18>=1)" | F"(((u7.p4>=1)&&(i3.u3.p15>=1))||(u6.p18>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2503961062828250649
[2021-05-12 05:22:41] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2503961062828250649
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin2503961062828250649]
Compilation finished in 193 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2503961062828250649]
Link finished in 45 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(((LTLAPp0==true)&&((LTLAPp1==true)||<>((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin2503961062828250649]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-00050-05 finished in 47042 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0)&&(G(p1) U X(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-12 05:22:56] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 05:22:56] [INFO ] Implicit Places using invariants in 15 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 16 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:22:56] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 05:22:56] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:22:56] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 05:22:56] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), true]
Running random walk in product with property : HouseConstruction-PT-00050-06 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 6}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p1:(GEQ s14 1), p2:(AND (GEQ s17 1) (GEQ s18 1)), p0:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00050-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00050-06 finished in 269 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||G((p0||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 25 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 21 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 20 transition count 13
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 10 place count 20 transition count 8
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 23 place count 12 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 23 place count 12 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 27 place count 10 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 3 with 4 rules applied. Total rules applied 31 place count 7 transition count 5
Applied a total of 31 rules in 3 ms. Remains 7 /25 variables (removed 18) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2021-05-12 05:22:56] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-12 05:22:56] [INFO ] Implicit Places using invariants in 13 ms returned [2, 4]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 13 ms to find 2 implicit places.
[2021-05-12 05:22:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-12 05:22:56] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 05:22:56] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Starting structural reductions, iteration 1 : 5/25 places, 5/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Applied a total of 2 rules in 1 ms. Remains 4 /5 variables (removed 1) and now considering 4/5 (removed 1) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-12 05:22:56] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 05:22:56] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-12 05:22:56] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 05:22:56] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 4/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00050-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], 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], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 210 steps with 2 reset in 1 ms.
FORMULA HouseConstruction-PT-00050-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00050-07 finished in 107 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||(p0 U p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 05:22:56] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 05:22:56] [INFO ] Implicit Places using invariants in 19 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 20 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:22:56] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 05:22:56] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:22:56] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 05:22:56] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00050-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(OR p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s5 1) (GEQ s20 1)), p1:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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-00050-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00050-08 finished in 120 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((p0||X(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 05:22:56] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 05:22:56] [INFO ] Implicit Places using invariants in 16 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 17 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:22:56] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 05:22:56] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:22:56] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-12 05:22:56] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 99 ms :[(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-00050-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(LT s3 1), p1:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 67 ms.
Product exploration explored 100000 steps with 33333 reset in 75 ms.
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 : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (G (NOT p1))), p0, (NOT p1)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA HouseConstruction-PT-00050-09 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-00050-09 finished in 355 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-12 05:22:56] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 05:22:56] [INFO ] Implicit Places using invariants in 15 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 16 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:22:56] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 05:22:56] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:22:56] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-12 05:22:57] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00050-10 automaton TGBA [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, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00050-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00050-10 finished in 136 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||G(p1)) U X(G(!p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 05:22:57] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 05:22:57] [INFO ] Implicit Places using invariants in 19 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 20 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 05:22:57] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 05:22:57] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 05:22:57] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 05:22:57] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 109 ms :[p1, p1, false, true, (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00050-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1)), p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 425 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00050-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00050-11 finished in 205 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 05:22:57] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 05:22:57] [INFO ] Implicit Places using invariants in 15 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 15 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:22:57] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-12 05:22:57] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 05:22:57] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-12 05:22:57] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00050-12 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LT s3 1), p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 9557 reset in 73 ms.
Product exploration explored 100000 steps with 9606 reset in 79 ms.
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 : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p1)), (F (G (NOT p0))), p1, (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA HouseConstruction-PT-00050-12 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-00050-12 finished in 325 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(!p0))&&(!p1 U p2)))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 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 1 place count 24 transition count 16
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 23 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 22 transition count 15
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 4 place count 22 transition count 10
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 17 place count 14 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 17 place count 14 transition count 9
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 19 place count 13 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 11 transition count 8
Applied a total of 22 rules in 4 ms. Remains 11 /25 variables (removed 14) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2021-05-12 05:22:57] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 05:22:57] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 11 cols
[2021-05-12 05:22:57] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 05:22:57] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-12 05:22:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 11 cols
[2021-05-12 05:22:57] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-12 05:22:57] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p2) p0), true, p0, p0, (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-00050-13 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=0 dest: 2}, { cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s7 1), p1:(AND (GEQ s1 1) (GEQ s3 1)), p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00050-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00050-13 finished in 156 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(!p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 25 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 21 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 20 transition count 13
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 10 place count 20 transition count 9
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 21 place count 13 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 13 transition count 7
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 3 with 5 rules applied. Total rules applied 26 place count 10 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 26 place count 10 transition count 6
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 3 with 3 rules applied. Total rules applied 29 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 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 32 place count 6 transition count 5
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 34 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 35 place count 4 transition count 4
Applied a total of 35 rules in 3 ms. Remains 4 /25 variables (removed 21) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-12 05:22:57] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 05:22:57] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-12 05:22:57] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 05:22:57] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-12 05:22:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-12 05:22:57] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 05:22:57] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 25 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00050-14 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1), p1:(GEQ s3 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 497 reset in 82 ms.
Product exploration explored 100000 steps with 497 reset in 148 ms.
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 : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (F (G (NOT p1))), (NOT p0), (NOT p1)]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA HouseConstruction-PT-00050-14 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-00050-14 finished in 343 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1)&&F(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 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 3 place count 24 transition count 14
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 21 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 21 transition count 11
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 14 place count 16 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 15 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 15 place count 15 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 13 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 11 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 10 transition count 7
Applied a total of 23 rules in 3 ms. Remains 10 /25 variables (removed 15) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2021-05-12 05:22:58] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 05:22:58] [INFO ] Implicit Places using invariants in 8 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 9 ms to find 1 implicit places.
[2021-05-12 05:22:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-12 05:22:58] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 05:22:58] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 9/25 places, 7/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-12 05:22:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-12 05:22:58] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 05:22:58] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-00050-15 automaton TGBA [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 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s2 1), p1:(GEQ s8 1), p2:(AND (GEQ s4 1) (GEQ s5 1) (GEQ s7 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 350 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00050-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00050-15 finished in 160 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-12 05:22:58] [INFO ] Applying decomposition
[2021-05-12 05:22:58] [INFO ] Flatten gal took : 2 ms
Built C files in :
/tmp/ltsmin5798015020584227406
[2021-05-12 05:22:58] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2021-05-12 05:22:58] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 05:22:58] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2021-05-12 05:22:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 05:22:58] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2021-05-12 05:22:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 05:22:58] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5798015020584227406
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5798015020584227406]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7066114702117222939.txt, -o, /tmp/graph7066114702117222939.bin, -w, /tmp/graph7066114702117222939.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7066114702117222939.bin, -l, -1, -v, -w, /tmp/graph7066114702117222939.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 05:22:58] [INFO ] Decomposing Gal with order
[2021-05-12 05:22:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 05:22:58] [INFO ] Flatten gal took : 3 ms
[2021-05-12 05:22:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 05:22:58] [INFO ] Time to serialize gal into /tmp/LTLFireability12395870106017135689.gal : 1 ms
[2021-05-12 05:22:58] [INFO ] Time to serialize properties into /tmp/LTLFireability7890603114254308528.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability12395870106017135689.gal, -t, CGAL, -LTL, /tmp/LTLFireability7890603114254308528.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability12395870106017135689.gal -t CGAL -LTL /tmp/LTLFireability7890603114254308528.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(("(((u9.p4<1)||(u2.p15<1))||(i3.u6.p18<1))")&&(("(i3.u6.p18>=1)")||(F("(((u9.p4>=1)&&(u2.p15>=1))||(i3.u6.p18>=1))")))))))
Formula 0 simplified : !XX("(((u9.p4<1)||(u2.p15<1))||(i3.u6.p18<1))" & ("(i3.u6.p18>=1)" | F"(((u9.p4>=1)&&(u2.p15>=1))||(i3.u6.p18>=1))"))
Compilation finished in 164 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5798015020584227406]
Link finished in 43 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(((LTLAPp0==true)&&((LTLAPp1==true)||<>((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5798015020584227406]
WARNING : LTSmin timed out (>225 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(((LTLAPp0==true)&&((LTLAPp1==true)||<>((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5798015020584227406]
Retrying LTSmin with larger timeout 1800 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(((LTLAPp0==true)&&((LTLAPp1==true)||<>((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5798015020584227406]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: LTL layer: formula: X(X(((LTLAPp0==true)&&((LTLAPp1==true)||<>((LTLAPp2==true))))))
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: "X(X(((LTLAPp0==true)&&((LTLAPp1==true)||<>((LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.077: DFS-FIFO for weak LTL, using special progress label 22
pins2lts-mc-linux64( 0/ 8), 0.078: There are 23 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.078: State length is 26, there are 24 groups
pins2lts-mc-linux64( 0/ 8), 0.078: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.078: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.078: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.078: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.423: ~96 levels ~960 states ~4928 transitions
pins2lts-mc-linux64( 2/ 8), 0.452: ~187 levels ~1920 states ~12232 transitions
pins2lts-mc-linux64( 2/ 8), 0.455: ~387 levels ~3840 states ~27224 transitions
pins2lts-mc-linux64( 2/ 8), 0.456: ~450 levels ~7680 states ~34072 transitions
pins2lts-mc-linux64( 2/ 8), 0.470: ~450 levels ~15360 states ~45800 transitions
pins2lts-mc-linux64( 2/ 8), 0.473: ~450 levels ~30720 states ~70024 transitions
pins2lts-mc-linux64( 2/ 8), 0.496: ~450 levels ~61440 states ~126272 transitions
pins2lts-mc-linux64( 1/ 8), 0.525: ~447 levels ~122880 states ~256592 transitions
pins2lts-mc-linux64( 1/ 8), 0.607: ~447 levels ~245760 states ~528672 transitions
pins2lts-mc-linux64( 2/ 8), 0.746: ~450 levels ~491520 states ~989224 transitions
pins2lts-mc-linux64( 2/ 8), 1.029: ~450 levels ~983040 states ~1999616 transitions
pins2lts-mc-linux64( 1/ 8), 1.640: ~447 levels ~1966080 states ~4632992 transitions
pins2lts-mc-linux64( 1/ 8), 2.981: ~447 levels ~3932160 states ~9631728 transitions
pins2lts-mc-linux64( 1/ 8), 5.790: ~447 levels ~7864320 states ~19779608 transitions
pins2lts-mc-linux64( 1/ 8), 10.555: ~447 levels ~15728640 states ~40827816 transitions
pins2lts-mc-linux64( 1/ 8), 21.788: ~447 levels ~31457280 states ~85132776 transitions
pins2lts-mc-linux64( 1/ 8), 44.621: ~447 levels ~62914560 states ~174475248 transitions
pins2lts-mc-linux64( 1/ 8), 92.375: ~447 levels ~125829120 states ~356348432 transitions
pins2lts-mc-linux64( 2/ 8), 201.359: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 201.387:
pins2lts-mc-linux64( 0/ 8), 201.387: mean standard work distribution: 173.4% (states) 174.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 201.387:
pins2lts-mc-linux64( 0/ 8), 201.387: Explored 58800778 states 163471442 transitions, fanout: 2.780
pins2lts-mc-linux64( 0/ 8), 201.387: Total exploration time 201.300 sec (201.260 sec minimum, 201.271 sec on average)
pins2lts-mc-linux64( 0/ 8), 201.387: States per second: 292105, Transitions per second: 812079
pins2lts-mc-linux64( 0/ 8), 201.387:
pins2lts-mc-linux64( 0/ 8), 201.387: Progress states detected: 3
pins2lts-mc-linux64( 0/ 8), 201.387: Redundant explorations: -0.0094
pins2lts-mc-linux64( 0/ 8), 201.387:
pins2lts-mc-linux64( 0/ 8), 201.387: Queue width: 8B, total height: 909, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 201.387: Tree memory: 704.7MB, 12.6 B/state, compr.: 11.9%
pins2lts-mc-linux64( 0/ 8), 201.387: Tree fill ratio (roots/leafs): 43.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 201.387: Stored 19 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 201.387: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 201.387: Est. total memory use: 704.7MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(((LTLAPp0==true)&&((LTLAPp1==true)||<>((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5798015020584227406]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(((LTLAPp0==true)&&((LTLAPp1==true)||<>((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5798015020584227406]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-12 05:43:15] [INFO ] Flatten gal took : 2 ms
[2021-05-12 05:43:15] [INFO ] Time to serialize gal into /tmp/LTLFireability8089296670012671111.gal : 0 ms
[2021-05-12 05:43:15] [INFO ] Time to serialize properties into /tmp/LTLFireability2695127429849155226.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability8089296670012671111.gal, -t, CGAL, -LTL, /tmp/LTLFireability2695127429849155226.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability8089296670012671111.gal -t CGAL -LTL /tmp/LTLFireability2695127429849155226.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("(((p4<1)||(p15<1))||(p18<1))")&&(("(p18>=1)")||(F("(((p4>=1)&&(p15>=1))||(p18>=1))")))))))
Formula 0 simplified : !XX("(((p4<1)||(p15<1))||(p18<1))" & ("(p18>=1)" | F"(((p4>=1)&&(p15>=1))||(p18>=1))"))
Detected timeout of ITS tools.
[2021-05-12 06:03:33] [INFO ] Flatten gal took : 141 ms
[2021-05-12 06:03:33] [INFO ] Input system was already deterministic with 18 transitions.
[2021-05-12 06:03:33] [INFO ] Transformed 25 places.
[2021-05-12 06:03:33] [INFO ] Transformed 18 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-12 06:03:36] [INFO ] Time to serialize gal into /tmp/LTLFireability15884956599734139431.gal : 6 ms
[2021-05-12 06:03:36] [INFO ] Time to serialize properties into /tmp/LTLFireability7135700485651221917.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability15884956599734139431.gal, -t, CGAL, -LTL, /tmp/LTLFireability7135700485651221917.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability15884956599734139431.gal -t CGAL -LTL /tmp/LTLFireability7135700485651221917.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(("(((p4<1)||(p15<1))||(p18<1))")&&(("(p18>=1)")||(F("(((p4>=1)&&(p15>=1))||(p18>=1))")))))))
Formula 0 simplified : !XX("(((p4<1)||(p15<1))||(p18<1))" & ("(p18>=1)" | F"(((p4>=1)&&(p15>=1))||(p18>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-00050"
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-00050, 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 r121-tall-162075406600173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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