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-162075406700221.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-04000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406700221
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K 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.2K Mar 28 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 15K Mar 28 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 21:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 22 21:03 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-04000-00
FORMULA_NAME HouseConstruction-PT-04000-01
FORMULA_NAME HouseConstruction-PT-04000-02
FORMULA_NAME HouseConstruction-PT-04000-03
FORMULA_NAME HouseConstruction-PT-04000-04
FORMULA_NAME HouseConstruction-PT-04000-05
FORMULA_NAME HouseConstruction-PT-04000-06
FORMULA_NAME HouseConstruction-PT-04000-07
FORMULA_NAME HouseConstruction-PT-04000-08
FORMULA_NAME HouseConstruction-PT-04000-09
FORMULA_NAME HouseConstruction-PT-04000-10
FORMULA_NAME HouseConstruction-PT-04000-11
FORMULA_NAME HouseConstruction-PT-04000-12
FORMULA_NAME HouseConstruction-PT-04000-13
FORMULA_NAME HouseConstruction-PT-04000-14
FORMULA_NAME HouseConstruction-PT-04000-15

=== Now, execution of the tool begins

BK_START 1620810863167

Running Version 0
[2021-05-12 09:14:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-12 09:14:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 09:14:24] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-12 09:14:24] [INFO ] Transformed 26 places.
[2021-05-12 09:14:24] [INFO ] Transformed 18 transitions.
[2021-05-12 09:14:24] [INFO ] Parsed PT model containing 26 places and 18 transitions in 72 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 09:14:24] [INFO ] Initial state test concluded for 1 properties.
FORMULA HouseConstruction-PT-04000-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 8 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2021-05-12 09:14:24] [INFO ] Computed 8 place invariants in 5 ms
[2021-05-12 09:14:24] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 18 rows 26 cols
[2021-05-12 09:14:24] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-12 09:14:24] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 26 cols
[2021-05-12 09:14:24] [INFO ] Computed 8 place invariants in 9 ms
[2021-05-12 09:14:24] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 18/18 transitions.
[2021-05-12 09:14:25] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-12 09:14:25] [INFO ] Flatten gal took : 20 ms
FORMULA HouseConstruction-PT-04000-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-04000-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-04000-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 09:14:25] [INFO ] Flatten gal took : 4 ms
[2021-05-12 09:14:25] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 100027 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=2083 ) properties (out of 19) seen :12
Running SMT prover for 7 properties.
// Phase 1: matrix 18 rows 26 cols
[2021-05-12 09:14:25] [INFO ] Computed 8 place invariants in 7 ms
[2021-05-12 09:14:25] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-12 09:14:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 09:14:25] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-12 09:14:25] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 09:14:25] [INFO ] Added : 8 causal constraints over 2 iterations in 20 ms. Result :sat
[2021-05-12 09:14:25] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-12 09:14:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 09:14:25] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-12 09:14:25] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 09:14:25] [INFO ] Added : 10 causal constraints over 2 iterations in 11 ms. Result :sat
[2021-05-12 09:14:25] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-12 09:14:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 09:14:25] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 09:14:25] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 09:14:25] [INFO ] Added : 16 causal constraints over 4 iterations in 19 ms. Result :sat
[2021-05-12 09:14:25] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-12 09:14:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 09:14:25] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-12 09:14:25] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 09:14:25] [INFO ] Added : 11 causal constraints over 3 iterations in 19 ms. Result :sat
[2021-05-12 09:14:25] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-12 09:14:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 09:14:25] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-12 09:14:25] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 09:14:25] [INFO ] Added : 12 causal constraints over 3 iterations in 11 ms. Result :sat
[2021-05-12 09:14:25] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-12 09:14:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 09:14:25] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 09:14:25] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 09:14:25] [INFO ] Added : 7 causal constraints over 2 iterations in 9 ms. Result :sat
[2021-05-12 09:14:25] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-12 09:14:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 09:14:25] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 09:14:25] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 09:14:25] [INFO ] Added : 11 causal constraints over 3 iterations in 15 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X((p0 U G((G(p0) U X(p1)))))))))], workingDir=/home/mcc/execution]
Support contains 3 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 2 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 09:14:25] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 09:14:25] [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 09:14:25] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 09:14:25] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 21/26 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 09:14:25] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 09:14:25] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 497 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-04000-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}, { cond=p0, acceptance={} source=4 dest: 8}], [{ cond=(NOT p1), acceptance={} source=5 dest: 9}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}, { cond=p0, acceptance={} source=6 dest: 10}, { cond=p0, acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 8}], [{ cond=true, acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 13}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=11 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=11 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={0} source=11 dest: 11}], [{ cond=(NOT p0), acceptance={} source=12 dest: 5}, { cond=(NOT p0), acceptance={} source=12 dest: 6}, { cond=p0, acceptance={} source=12 dest: 12}], [{ cond=(NOT p0), acceptance={} source=13 dest: 9}, { cond=p0, acceptance={} source=13 dest: 13}]], initial=0, aps=[p0:(GEQ s3 1), p1:(AND (GEQ s8 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-04000-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-04000-00 finished in 608 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p0)||((p1&&F(p2)) U ((F(!p3)&&((p1&&F(p2))||G(p1))&&G(p4))||G(((p1&&F(p2))||G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Reduce places removed 1 places and 1 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 25 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 24 transition count 16
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 24 transition count 10
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 17 place count 15 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 17 place count 15 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 14 transition count 9
Applied a total of 19 rules in 170 ms. Remains 14 /26 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 14 cols
[2021-05-12 09:14:26] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 09:14:26] [INFO ] Implicit Places using invariants in 11 ms returned [3, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 12 ms to find 2 implicit places.
[2021-05-12 09:14:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2021-05-12 09:14:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 09:14:26] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 12/26 places, 9/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2021-05-12 09:14:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2021-05-12 09:14:26] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 09:14:26] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 2 iterations. Remains : 12/26 places, 9/18 transitions.
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p1)), true, (NOT p0), (AND (NOT p1) p3), (AND p0 (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1)), p3, (NOT p4), (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-04000-01 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p3 p1 p4), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1 p4), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) p4), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p4)), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND p0 p3 p1) (AND p3 p1 (NOT p4))), acceptance={} source=3 dest: 3}, { cond=(AND p3 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(AND p0 (NOT p1) (NOT p4)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1 p4), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p4)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) p4), acceptance={} source=4 dest: 8}], [{ cond=(OR (AND p0 p1 (NOT p2)) (AND p1 (NOT p2) (NOT p4))), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p0 p3 p1 p4), acceptance={} source=6 dest: 3}, { cond=(AND p0 p1 p4), acceptance={} source=6 dest: 4}, { cond=(AND p0 p1 (NOT p2) p4), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p4)), acceptance={} source=6 dest: 6}], [{ cond=p3, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p4), acceptance={} source=8 dest: 1}, { cond=p4, acceptance={} source=8 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s4 1)), p0:(GEQ s6 1), p3:(GEQ s2 1), p4:(OR (LT s7 1) (LT s8 1)), p2:(LT s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 28 steps with 7 reset in 1 ms.
FORMULA HouseConstruction-PT-04000-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-04000-01 finished in 610 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (X(p1)||G(p0)))))], workingDir=/home/mcc/execution]
Support contains 4 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 1 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 09:14:26] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 09:14:26] [INFO ] Implicit Places using invariants in 13 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 13 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 09:14:26] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 09:14:26] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 09:14:26] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 09:14:26] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-04000-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LT s2 1), p0:(OR (LT s16 1) (LT s17 1) (LT 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 91 steps with 4 reset in 1 ms.
FORMULA HouseConstruction-PT-04000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-04000-03 finished in 157 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||X(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 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 1 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 09:14:26] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 09:14:26] [INFO ] Implicit Places using invariants in 14 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 15 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 09:14:26] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 09:14:27] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 23/26 places, 18/18 transitions.
Applied a total of 0 rules in 2 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 09:14:27] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 09:14:27] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-04000-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1)), p1:(GEQ s13 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][false, false, false]]
Product exploration explored 100000 steps with 5615 reset in 233 ms.
Product exploration explored 100000 steps with 5500 reset in 155 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (F (G (NOT p1))), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5563 reset in 114 ms.
Product exploration explored 100000 steps with 5517 reset in 148 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 23 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 23/23 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 23 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 23 transition count 20
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 23 transition count 20
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 21 transition count 18
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 21 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 19 transition count 16
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 19 transition count 16
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 18 rules in 6 ms. Remains 19 /23 variables (removed 4) and now considering 16/18 (removed 2) transitions.
[2021-05-12 09:14:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2021-05-12 09:14:28] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 09:14:28] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/23 places, 16/18 transitions.
Product exploration explored 100000 steps with 7953 reset in 261 ms.
Product exploration explored 100000 steps with 8018 reset in 144 ms.
[2021-05-12 09:14:28] [INFO ] Flatten gal took : 3 ms
[2021-05-12 09:14:28] [INFO ] Flatten gal took : 2 ms
[2021-05-12 09:14:28] [INFO ] Time to serialize gal into /tmp/LTL18249294998689723895.gal : 1 ms
[2021-05-12 09:14:28] [INFO ] Time to serialize properties into /tmp/LTL130707715346006187.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/LTL18249294998689723895.gal, -t, CGAL, -LTL, /tmp/LTL130707715346006187.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/LTL18249294998689723895.gal -t CGAL -LTL /tmp/LTL130707715346006187.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((X(F("(p17>=1)")))||("(((p12>=1)&&(p10>=1))&&(p13>=1))")))))
Formula 0 simplified : !XF("(((p12>=1)&&(p10>=1))&&(p13>=1))" | XF"(p17>=1)")
Detected timeout of ITS tools.
[2021-05-12 09:14:43] [INFO ] Flatten gal took : 2 ms
[2021-05-12 09:14:43] [INFO ] Applying decomposition
[2021-05-12 09:14:43] [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/graph8389397648230613982.txt, -o, /tmp/graph8389397648230613982.bin, -w, /tmp/graph8389397648230613982.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/graph8389397648230613982.bin, -l, -1, -v, -w, /tmp/graph8389397648230613982.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 09:14:43] [INFO ] Decomposing Gal with order
[2021-05-12 09:14:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 09:14:43] [INFO ] Flatten gal took : 43 ms
[2021-05-12 09:14:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 09:14:43] [INFO ] Time to serialize gal into /tmp/LTL2770820554074013489.gal : 1 ms
[2021-05-12 09:14:43] [INFO ] Time to serialize properties into /tmp/LTL4095144513507852621.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/LTL2770820554074013489.gal, -t, CGAL, -LTL, /tmp/LTL4095144513507852621.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/LTL2770820554074013489.gal -t CGAL -LTL /tmp/LTL4095144513507852621.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((X(F("(i2.u4.p17>=1)")))||("(((i2.u4.p12>=1)&&(i2.u2.p10>=1))&&(i2.u3.p13>=1))")))))
Formula 0 simplified : !XF("(((i2.u4.p12>=1)&&(i2.u2.p10>=1))&&(i2.u3.p13>=1))" | XF"(i2.u4.p17>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15048581270579617282
[2021-05-12 09:14:58] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15048581270579617282
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/ltsmin15048581270579617282]
Compilation finished in 187 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15048581270579617282]
Link finished in 37 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)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15048581270579617282]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-04000-05 finished in 46847 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((X(p0)||G(!p0))) U (p1&&X(p2))))], workingDir=/home/mcc/execution]
Support contains 4 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 1 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 09:15:13] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 09:15:13] [INFO ] Implicit Places using invariants in 32 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 33 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 09:15:13] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 09:15:13] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 21/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 09:15:13] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 09:15:13] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p2)), false, (NOT p2), (NOT p0), false, true, p0]
Running random walk in product with property : HouseConstruction-PT-04000-06 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 5}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s5 1), p0:(GEQ s14 1), p2:(AND (GEQ s17 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 27 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-04000-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-04000-06 finished in 235 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(p0))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
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 25 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 22 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 21 transition count 14
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 8 place count 21 transition count 10
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 19 place count 14 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 19 place count 14 transition count 8
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 12 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 10 transition count 7
Applied a total of 26 rules in 3 ms. Remains 10 /26 variables (removed 16) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2021-05-12 09:15:14] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 09:15:14] [INFO ] Implicit Places using invariants in 19 ms returned [2, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 19 ms to find 2 implicit places.
[2021-05-12 09:15:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-12 09:15:14] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 09:15:14] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 8/26 places, 7/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-12 09:15:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-12 09:15:14] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 09:15:14] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/26 places, 7/18 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-04000-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s1 1) (AND (GEQ s4 1) (LT s6 1))), p0:(GEQ s6 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 28005 steps with 1 reset in 22 ms.
FORMULA HouseConstruction-PT-04000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-04000-07 finished in 124 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 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.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 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 8 place count 20 transition count 13
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 8 place count 20 transition count 7
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 15 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 3 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 3 with 3 rules applied. Total rules applied 26 place count 9 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 29 place count 7 transition count 5
Applied a total of 29 rules in 129 ms. Remains 7 /26 variables (removed 19) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2021-05-12 09:15:14] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-12 09:15:14] [INFO ] Implicit Places using invariants in 8 ms returned [2, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 9 ms to find 2 implicit places.
[2021-05-12 09:15:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-12 09:15:14] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 09:15:14] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Starting structural reductions, iteration 1 : 5/26 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 0 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 09:15:14] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 09:15:14] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-12 09:15:14] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 09:15:14] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 4/26 places, 4/18 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-04000-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 12090 reset in 79 ms.
Product exploration explored 100000 steps with 12135 reset in 100 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))), (NOT p0)]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Product exploration explored 100000 steps with 12009 reset in 78 ms.
Product exploration explored 100000 steps with 12115 reset in 59 ms.
[2021-05-12 09:15:14] [INFO ] Flatten gal took : 0 ms
[2021-05-12 09:15:14] [INFO ] Flatten gal took : 0 ms
[2021-05-12 09:15:14] [INFO ] Time to serialize gal into /tmp/LTL7012684250954745160.gal : 1 ms
[2021-05-12 09:15:14] [INFO ] Time to serialize properties into /tmp/LTL18177760685009831155.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/LTL7012684250954745160.gal, -t, CGAL, -LTL, /tmp/LTL18177760685009831155.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/LTL7012684250954745160.gal -t CGAL -LTL /tmp/LTL18177760685009831155.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("((p5>=1)&&(p14>=1))")))
Formula 0 simplified : !F"((p5>=1)&&(p14>=1))"
Detected timeout of ITS tools.
[2021-05-12 09:15:29] [INFO ] Flatten gal took : 1 ms
[2021-05-12 09:15:29] [INFO ] Applying decomposition
[2021-05-12 09:15:29] [INFO ] Flatten gal took : 0 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/graph13521943306427492562.txt, -o, /tmp/graph13521943306427492562.bin, -w, /tmp/graph13521943306427492562.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/graph13521943306427492562.bin, -l, -1, -v, -w, /tmp/graph13521943306427492562.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 09:15:29] [INFO ] Decomposing Gal with order
[2021-05-12 09:15:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 09:15:29] [INFO ] Flatten gal took : 1 ms
[2021-05-12 09:15:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 09:15:29] [INFO ] Time to serialize gal into /tmp/LTL6748505064339975400.gal : 0 ms
[2021-05-12 09:15:29] [INFO ] Time to serialize properties into /tmp/LTL2255528555151760202.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/LTL6748505064339975400.gal, -t, CGAL, -LTL, /tmp/LTL2255528555151760202.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/LTL6748505064339975400.gal -t CGAL -LTL /tmp/LTL2255528555151760202.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F("((u0.p5>=1)&&(u1.p14>=1))")))
Formula 0 simplified : !F"((u0.p5>=1)&&(u1.p14>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5566019506355019513
[2021-05-12 09:15:44] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5566019506355019513
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/ltsmin5566019506355019513]
Compilation finished in 83 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5566019506355019513]
Link finished in 36 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, <>((LTLAPp0==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin5566019506355019513]
LTSmin run took 441 ms.
FORMULA HouseConstruction-PT-04000-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-04000-09 finished in 31276 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((G(p1)&&p0))||G(p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 21 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 19 transition count 12
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 12 place count 19 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 21 place count 14 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 21 place count 14 transition count 7
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 24 place count 12 transition count 7
Applied a total of 24 rules in 2 ms. Remains 12 /26 variables (removed 14) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 12 cols
[2021-05-12 09:15:45] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 09:15:45] [INFO ] Implicit Places using invariants in 16 ms returned [2, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 17 ms to find 2 implicit places.
[2021-05-12 09:15:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 10 cols
[2021-05-12 09:15:45] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 09:15:45] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 10/26 places, 7/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 10 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 6
Applied a total of 2 rules in 1 ms. Remains 9 /10 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 9 cols
[2021-05-12 09:15:45] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 09:15:45] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 6 rows 9 cols
[2021-05-12 09:15:45] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 09:15:45] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 9/26 places, 6/18 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-04000-11 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s7 1) (GEQ s8 1)), p2:(GEQ s0 1), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 24000 steps with 0 reset in 22 ms.
FORMULA HouseConstruction-PT-04000-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-04000-11 finished in 198 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(!p0)||G(!p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 24 transition count 13
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 20 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 18 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12 place count 18 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 19 place count 14 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 14 transition count 7
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 12 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 11 transition count 6
Applied a total of 23 rules in 694 ms. Remains 11 /26 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 11 cols
[2021-05-12 09:15:46] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 09:15:46] [INFO ] Implicit Places using invariants in 13 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
[2021-05-12 09:15:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 10 cols
[2021-05-12 09:15:46] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 09:15:46] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 10/26 places, 6/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-12 09:15:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 10 cols
[2021-05-12 09:15:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 09:15:46] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 10/26 places, 6/18 transitions.
Stuttering acceptance computed with spot in 26 ms :[(AND p0 p1)]
Running random walk in product with property : HouseConstruction-PT-04000-12 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2 1), p1:(AND (GEQ s4 1) (GEQ s7 1) (GEQ s8 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 4 reset in 109 ms.
Product exploration explored 100000 steps with 4 reset in 171 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 6
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-04000-12 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-04000-12 finished in 1120 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((!p0||X((G((p1 U !p2)) U (G((p1 U !p2))&&p3)))))))], workingDir=/home/mcc/execution]
Support contains 4 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 1 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 09:15:46] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 09:15:46] [INFO ] Implicit Places using invariants in 27 ms returned [9, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 27 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 09:15:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 09:15:46] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 09:15:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 09:15:46] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (AND p0 (NOT p3)) (AND p0 p2)), (OR (AND p0 (NOT p3)) (AND p0 p2)), (OR (AND p0 (NOT p3)) (AND p0 p2)), (OR (NOT p3) p2), true, p2, p2]
Running random walk in product with property : HouseConstruction-PT-04000-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p3 p2 p1), acceptance={0} source=3 dest: 5}, { cond=(OR (AND p3 (NOT p2)) (AND p3 p1)), acceptance={0} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p2 p1), acceptance={} source=6 dest: 5}, { cond=(OR (NOT p2) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s7 1)), p3:(AND (GEQ s3 1) (GEQ s7 1)), p2:(LT s2 1), p1:(GEQ s16 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-04000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-04000-13 finished in 266 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 24 transition count 11
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 18 transition count 11
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 12 place count 18 transition count 7
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 21 place count 13 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 21 place count 13 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 24 place count 11 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 24 place count 11 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 27 place count 9 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 8 transition count 4
Applied a total of 28 rules in 710 ms. Remains 8 /26 variables (removed 18) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 8 cols
[2021-05-12 09:15:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 09:15:47] [INFO ] Implicit Places using invariants in 10 ms returned [0, 3, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 11 ms to find 3 implicit places.
[2021-05-12 09:15:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2021-05-12 09:15:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 09:15:47] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 5/26 places, 4/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 3
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 3
Applied a total of 2 rules in 1 ms. Remains 4 /5 variables (removed 1) and now considering 3/4 (removed 1) transitions.
// Phase 1: matrix 3 rows 4 cols
[2021-05-12 09:15:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 09:15:47] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2021-05-12 09:15:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 09:15:47] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 4/26 places, 3/18 transitions.
Stuttering acceptance computed with spot in 23 ms :[p0]
Running random walk in product with property : HouseConstruction-PT-04000-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 8 reset in 83 ms.
Product exploration explored 100000 steps with 8 reset in 117 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA HouseConstruction-PT-04000-14 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-04000-14 finished in 1044 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 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 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 21 transition count 9
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 19 place count 13 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 19 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 2 with 5 rules applied. Total rules applied 24 place count 10 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 24 place count 10 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 9 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 2 with 3 rules applied. Total rules applied 29 place count 7 transition count 5
Applied a total of 29 rules in 122 ms. Remains 7 /26 variables (removed 19) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2021-05-12 09:15:48] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-12 09:15:48] [INFO ] Implicit Places using invariants in 10 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 11 ms to find 1 implicit places.
[2021-05-12 09:15:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-12 09:15:48] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 09:15:48] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 6/26 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 6 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 5 transition count 4
Applied a total of 2 rules in 0 ms. Remains 5 /6 variables (removed 1) and now considering 4/5 (removed 1) transitions.
// Phase 1: matrix 4 rows 5 cols
[2021-05-12 09:15:48] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 09:15:48] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2021-05-12 09:15:48] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 09:15:48] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/26 places, 4/18 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-04000-15 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:(OR (LT s1 1) (LT s3 1)), p1:(LT s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2978 reset in 93 ms.
Product exploration explored 100000 steps with 3268 reset in 156 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (G p1)), p0, p1]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA HouseConstruction-PT-04000-15 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-04000-15 finished in 521 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9777079986706376577
[2021-05-12 09:15:48] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2021-05-12 09:15:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 09:15:48] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2021-05-12 09:15:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 09:15:48] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2021-05-12 09:15:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 09:15:48] [INFO ] Applying decomposition
[2021-05-12 09:15:48] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9777079986706376577
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/ltsmin9777079986706376577]
[2021-05-12 09:15:48] [INFO ] Flatten gal took : 4 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/graph3984357309228955315.txt, -o, /tmp/graph3984357309228955315.bin, -w, /tmp/graph3984357309228955315.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/graph3984357309228955315.bin, -l, -1, -v, -w, /tmp/graph3984357309228955315.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 09:15:48] [INFO ] Decomposing Gal with order
[2021-05-12 09:15:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 09:15:48] [INFO ] Flatten gal took : 3 ms
[2021-05-12 09:15:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 09:15:48] [INFO ] Time to serialize gal into /tmp/LTLFireability4043236366129482302.gal : 1 ms
[2021-05-12 09:15:48] [INFO ] Time to serialize properties into /tmp/LTLFireability9695122696497527845.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/LTLFireability4043236366129482302.gal, -t, CGAL, -LTL, /tmp/LTLFireability9695122696497527845.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/LTLFireability4043236366129482302.gal -t CGAL -LTL /tmp/LTLFireability9695122696497527845.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(("(((i1.u3.p12>=1)&&(i2.u4.p10>=1))&&(i2.u1.p13>=1))")||(X(F("(i3.u5.p17>=1)")))))))
Formula 0 simplified : !XF("(((i1.u3.p12>=1)&&(i2.u4.p10>=1))&&(i2.u1.p13>=1))" | XF"(i3.u5.p17>=1)")
Compilation finished in 168 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9777079986706376577]
Link finished in 42 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(<>(((LTLAPp0==true)||X(<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9777079986706376577]
WARNING : LTSmin timed out (>300 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(<>(((LTLAPp0==true)||X(<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9777079986706376577]
Retrying LTSmin with larger timeout 2400 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(<>(((LTLAPp0==true)||X(<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9777079986706376577]
Detected timeout of ITS tools.
[2021-05-12 09:36:15] [INFO ] Flatten gal took : 6 ms
[2021-05-12 09:36:15] [INFO ] Time to serialize gal into /tmp/LTLFireability16935102621414538537.gal : 0 ms
[2021-05-12 09:36:15] [INFO ] Time to serialize properties into /tmp/LTLFireability1183702334225016345.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/LTLFireability16935102621414538537.gal, -t, CGAL, -LTL, /tmp/LTLFireability1183702334225016345.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/LTLFireability16935102621414538537.gal -t CGAL -LTL /tmp/LTLFireability1183702334225016345.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(((p12>=1)&&(p10>=1))&&(p13>=1))")||(X(F("(p17>=1)")))))))
Formula 0 simplified : !XF("(((p12>=1)&&(p10>=1))&&(p13>=1))" | XF"(p17>=1)")
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( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: LTL layer: formula: X(<>(((LTLAPp0==true)||X(<>((LTLAPp1==true))))))
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: "X(<>(((LTLAPp0==true)||X(<>((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.065: DFS-FIFO for weak LTL, using special progress label 21
pins2lts-mc-linux64( 0/ 8), 0.065: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.065: State length is 27, there are 21 groups
pins2lts-mc-linux64( 0/ 8), 0.065: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.065: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.065: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.065: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.446: ~102 levels ~960 states ~5688 transitions
pins2lts-mc-linux64( 1/ 8), 0.524: ~207 levels ~1920 states ~12936 transitions
pins2lts-mc-linux64( 1/ 8), 0.542: ~418 levels ~3840 states ~28344 transitions
pins2lts-mc-linux64( 1/ 8), 0.546: ~839 levels ~7680 states ~59104 transitions
pins2lts-mc-linux64( 1/ 8), 0.557: ~1696 levels ~15360 states ~122048 transitions
pins2lts-mc-linux64( 1/ 8), 0.583: ~3460 levels ~30720 states ~255160 transitions
pins2lts-mc-linux64( 1/ 8), 0.645: ~6937 levels ~61440 states ~518856 transitions
pins2lts-mc-linux64( 1/ 8), 0.777: ~13908 levels ~122880 states ~1067040 transitions
pins2lts-mc-linux64( 1/ 8), 1.013: ~27835 levels ~245760 states ~2166312 transitions
pins2lts-mc-linux64( 1/ 8), 1.217: ~36001 levels ~491520 states ~3169232 transitions
pins2lts-mc-linux64( 1/ 8), 1.485: ~36001 levels ~983040 states ~4315536 transitions
pins2lts-mc-linux64( 1/ 8), 1.991: ~36001 levels ~1966080 states ~6626600 transitions
pins2lts-mc-linux64( 1/ 8), 3.063: ~36001 levels ~3932160 states ~11320000 transitions
pins2lts-mc-linux64( 1/ 8), 5.963: ~36001 levels ~7864320 states ~22075344 transitions
pins2lts-mc-linux64( 1/ 8), 12.053: ~36001 levels ~15728640 states ~44443200 transitions
pins2lts-mc-linux64( 1/ 8), 23.747: ~36001 levels ~31457280 states ~88684488 transitions
pins2lts-mc-linux64( 1/ 8), 47.161: ~36001 levels ~62914560 states ~178630728 transitions
pins2lts-mc-linux64( 1/ 8), 94.763: ~36001 levels ~125829120 states ~359888616 transitions
pins2lts-mc-linux64( 1/ 8), 201.908: ~36001 levels ~251658240 states ~760164096 transitions
pins2lts-mc-linux64( 1/ 8), 426.593: ~36001 levels ~503316480 states ~1603413752 transitions
pins2lts-mc-linux64( 1/ 8), 910.352: ~36001 levels ~1006632960 states ~3272870208 transitions
pins2lts-mc-linux64( 1/ 8), 1058.303: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1058.312:
pins2lts-mc-linux64( 0/ 8), 1058.312: mean standard work distribution: 264.6% (states) 264.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 1058.312:
pins2lts-mc-linux64( 0/ 8), 1058.312: Explored 133908605 states 435979287 transitions, fanout: 3.256
pins2lts-mc-linux64( 0/ 8), 1058.312: Total exploration time 1058.240 sec (1058.210 sec minimum, 1058.224 sec on average)
pins2lts-mc-linux64( 0/ 8), 1058.312: States per second: 126539, Transitions per second: 411985
pins2lts-mc-linux64( 0/ 8), 1058.312:
pins2lts-mc-linux64( 0/ 8), 1058.312: Progress states detected: 1
pins2lts-mc-linux64( 0/ 8), 1058.312: Redundant explorations: -0.2300
pins2lts-mc-linux64( 0/ 8), 1058.312:
pins2lts-mc-linux64( 0/ 8), 1058.312: Queue width: 8B, total height: 36012, memory: 0.27MB
pins2lts-mc-linux64( 0/ 8), 1058.312: Tree memory: 1106.3MB, 8.6 B/state, compr.: 7.9%
pins2lts-mc-linux64( 0/ 8), 1058.312: Tree fill ratio (roots/leafs): 99.0%/32.0%
pins2lts-mc-linux64( 0/ 8), 1058.312: Stored 19 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1058.312: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1058.312: Est. total memory use: 1106.6MB (~1024.3MB 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(<>(((LTLAPp0==true)||X(<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9777079986706376577]
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(<>(((LTLAPp0==true)||X(<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9777079986706376577]
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 09:56:43] [INFO ] Flatten gal took : 130 ms
[2021-05-12 09:56:44] [INFO ] Input system was already deterministic with 18 transitions.
[2021-05-12 09:56:44] [INFO ] Transformed 26 places.
[2021-05-12 09:56:44] [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 09:56:44] [INFO ] Time to serialize gal into /tmp/LTLFireability15218553317296184305.gal : 1 ms
[2021-05-12 09:56:44] [INFO ] Time to serialize properties into /tmp/LTLFireability7225966384846135949.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/LTLFireability15218553317296184305.gal, -t, CGAL, -LTL, /tmp/LTLFireability7225966384846135949.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/LTLFireability15218553317296184305.gal -t CGAL -LTL /tmp/LTLFireability7225966384846135949.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(F(("(((p12>=1)&&(p10>=1))&&(p13>=1))")||(X(F("(p17>=1)")))))))
Formula 0 simplified : !XF("(((p12>=1)&&(p10>=1))&&(p13>=1))" | XF"(p17>=1)")

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

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