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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K 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.5K Mar 28 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 11:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 21:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 21:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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-16000-00
FORMULA_NAME HouseConstruction-PT-16000-01
FORMULA_NAME HouseConstruction-PT-16000-02
FORMULA_NAME HouseConstruction-PT-16000-03
FORMULA_NAME HouseConstruction-PT-16000-04
FORMULA_NAME HouseConstruction-PT-16000-05
FORMULA_NAME HouseConstruction-PT-16000-06
FORMULA_NAME HouseConstruction-PT-16000-07
FORMULA_NAME HouseConstruction-PT-16000-08
FORMULA_NAME HouseConstruction-PT-16000-09
FORMULA_NAME HouseConstruction-PT-16000-10
FORMULA_NAME HouseConstruction-PT-16000-11
FORMULA_NAME HouseConstruction-PT-16000-12
FORMULA_NAME HouseConstruction-PT-16000-13
FORMULA_NAME HouseConstruction-PT-16000-14
FORMULA_NAME HouseConstruction-PT-16000-15

=== Now, execution of the tool begins

BK_START 1620815058060

Running Version 0
[2021-05-12 10:24:19] [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 10:24:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 10:24:19] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-12 10:24:19] [INFO ] Transformed 26 places.
[2021-05-12 10:24:19] [INFO ] Transformed 18 transitions.
[2021-05-12 10:24:19] [INFO ] Parsed PT model containing 26 places and 18 transitions in 60 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 10:24:19] [INFO ] Initial state test concluded for 2 properties.
Support contains 25 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 12 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 10:24:19] [INFO ] Computed 8 place invariants in 6 ms
[2021-05-12 10:24:19] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 18 rows 26 cols
[2021-05-12 10:24:19] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-12 10:24:19] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 26 cols
[2021-05-12 10:24:19] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-12 10:24:19] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 18/18 transitions.
[2021-05-12 10:24:20] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-12 10:24:20] [INFO ] Flatten gal took : 19 ms
FORMULA HouseConstruction-PT-16000-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-16000-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-16000-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-16000-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 10:24:20] [INFO ] Flatten gal took : 4 ms
[2021-05-12 10:24:20] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 112009 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=2947 ) properties (out of 18) seen :4
Running SMT prover for 14 properties.
// Phase 1: matrix 18 rows 26 cols
[2021-05-12 10:24:20] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-12 10:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-12 10:24:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 10:24:20] [INFO ] Added : 5 causal constraints over 1 iterations in 14 ms. Result :sat
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-12 10:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 10:24:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 10:24:20] [INFO ] Added : 8 causal constraints over 2 iterations in 11 ms. Result :sat
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-12 10:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-12 10:24:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 10:24:20] [INFO ] Added : 7 causal constraints over 2 iterations in 11 ms. Result :sat
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-12 10:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 10:24:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 10:24:20] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-12 10:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-12 10:24:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 10:24:20] [INFO ] Added : 8 causal constraints over 2 iterations in 25 ms. Result :sat
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-12 10:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 10:24:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 10:24:20] [INFO ] Added : 11 causal constraints over 3 iterations in 16 ms. Result :sat
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-12 10:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 10:24:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 10:24:20] [INFO ] Added : 8 causal constraints over 2 iterations in 11 ms. Result :sat
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-12 10:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 10:24:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 10:24:20] [INFO ] Added : 10 causal constraints over 2 iterations in 12 ms. Result :sat
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-12 10:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-12 10:24:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 10:24:20] [INFO ] Added : 6 causal constraints over 2 iterations in 12 ms. Result :sat
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-12 10:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-12 10:24:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 10:24:20] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-12 10:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-12 10:24:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 10:24:20] [INFO ] Added : 6 causal constraints over 2 iterations in 12 ms. Result :sat
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-12 10:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 10:24:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 10:24:20] [INFO ] Added : 12 causal constraints over 3 iterations in 10 ms. Result :sat
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-12 10:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 10:24:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 10:24:20] [INFO ] Added : 9 causal constraints over 2 iterations in 8 ms. Result :sat
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-12 10:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:24:20] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 10:24:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 10:24:20] [INFO ] Added : 7 causal constraints over 2 iterations in 12 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(((G(p0) U p1) U 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 10:24:20] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-12 10:24:20] [INFO ] Implicit Places using invariants in 17 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 18 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 10:24:20] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 10:24:20] [INFO ] Dead Transitions using invariants and state equation in 21 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 10:24:20] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 10:24:20] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 311 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-16000-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s8 1) (GEQ s9 1)), p1:(GEQ s1 1), p0:(GEQ s3 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 1 reset in 2 ms.
FORMULA HouseConstruction-PT-16000-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-16000-00 finished in 425 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G((X(X(p1))||p0))&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 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 0 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 10:24:21] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 10:24:21] [INFO ] Implicit Places using invariants in 16 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 17 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 10:24:21] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 10:24:21] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 23/26 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 10:24:21] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 10:24:21] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), true]
Running random walk in product with property : HouseConstruction-PT-16000-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (GEQ s7 1) (AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1))), p2:(GEQ s2 1), p1:(GEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-16000-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-16000-02 finished in 278 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(F((F(p1)&&X(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
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 10:24:21] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 10:24:21] [INFO ] Implicit Places using invariants in 17 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 10:24:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 10:24:21] [INFO ] Dead Transitions using invariants and state equation in 18 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 10:24:21] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 10:24:21] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-16000-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s2 1), p1:(GEQ s4 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 14291 reset in 228 ms.
Product exploration explored 100000 steps with 14324 reset in 134 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (F (G (NOT p1))), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 14290 reset in 161 ms.
Product exploration explored 100000 steps with 14267 reset in 115 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 21/21 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 18
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 5 place count 21 transition count 20
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 10 place count 21 transition count 20
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 18 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 18 transition count 17
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 18 transition count 17
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 16 transition count 15
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 16 transition count 15
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 23 rules in 10 ms. Remains 16 /21 variables (removed 5) and now considering 15/18 (removed 3) transitions.
[2021-05-12 10:24:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 16 cols
[2021-05-12 10:24:22] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 10:24:22] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/21 places, 15/18 transitions.
Product exploration explored 100000 steps with 17295 reset in 247 ms.
Product exploration explored 100000 steps with 17278 reset in 135 ms.
[2021-05-12 10:24:23] [INFO ] Flatten gal took : 6 ms
[2021-05-12 10:24:23] [INFO ] Flatten gal took : 2 ms
[2021-05-12 10:24:23] [INFO ] Time to serialize gal into /tmp/LTL10420702881990892723.gal : 0 ms
[2021-05-12 10:24:23] [INFO ] Time to serialize properties into /tmp/LTL8730218668257207096.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/LTL10420702881990892723.gal, -t, CGAL, -LTL, /tmp/LTL8730218668257207096.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/LTL10420702881990892723.gal -t CGAL -LTL /tmp/LTL8730218668257207096.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(p3>=1)")||(X(F((F("(p5>=1)"))&&(X("(p3>=1)"))))))))
Formula 0 simplified : !X("(p3>=1)" | XF(F"(p5>=1)" & X"(p3>=1)"))
Detected timeout of ITS tools.
[2021-05-12 10:24:38] [INFO ] Flatten gal took : 1 ms
[2021-05-12 10:24:38] [INFO ] Applying decomposition
[2021-05-12 10:24:38] [INFO ] Flatten gal took : 1 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/graph3337901888961221983.txt, -o, /tmp/graph3337901888961221983.bin, -w, /tmp/graph3337901888961221983.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/graph3337901888961221983.bin, -l, -1, -v, -w, /tmp/graph3337901888961221983.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 10:24:38] [INFO ] Decomposing Gal with order
[2021-05-12 10:24:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 10:24:38] [INFO ] Flatten gal took : 21 ms
[2021-05-12 10:24:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 10:24:38] [INFO ] Time to serialize gal into /tmp/LTL8432322959094846280.gal : 1 ms
[2021-05-12 10:24:38] [INFO ] Time to serialize properties into /tmp/LTL14564289421269780425.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/LTL8432322959094846280.gal, -t, CGAL, -LTL, /tmp/LTL14564289421269780425.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/LTL8432322959094846280.gal -t CGAL -LTL /tmp/LTL14564289421269780425.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i0.u0.p3>=1)")||(X(F((F("(i0.u3.p5>=1)"))&&(X("(i0.u0.p3>=1)"))))))))
Formula 0 simplified : !X("(i0.u0.p3>=1)" | XF(F"(i0.u3.p5>=1)" & X"(i0.u0.p3>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17564538701575205499
[2021-05-12 10:24:53] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17564538701575205499
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/ltsmin17564538701575205499]
Compilation finished in 222 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17564538701575205499]
Link finished in 44 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))&&X((LTLAPp0==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17564538701575205499]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-16000-04 finished in 47075 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(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 10:25:08] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 10:25:08] [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 10:25:08] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 10:25:08] [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 10:25:08] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 10:25:08] [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 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-16000-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s3 1) (GEQ s7 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][false, false]]
Product exploration explored 100000 steps with 2948 reset in 119 ms.
Product exploration explored 100000 steps with 3018 reset in 253 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2956 reset in 199 ms.
Product exploration explored 100000 steps with 2951 reset in 247 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 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 5 place count 22 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 22 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 21 transition count 17
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 21 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 21 transition count 17
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 18 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 18 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 19 rules in 7 ms. Remains 18 /22 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2021-05-12 10:25:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2021-05-12 10:25:09] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 10:25:09] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/22 places, 14/18 transitions.
Product exploration explored 100000 steps with 7209 reset in 213 ms.
Product exploration explored 100000 steps with 7223 reset in 259 ms.
[2021-05-12 10:25:10] [INFO ] Flatten gal took : 1 ms
[2021-05-12 10:25:10] [INFO ] Flatten gal took : 1 ms
[2021-05-12 10:25:10] [INFO ] Time to serialize gal into /tmp/LTL4526407787353407733.gal : 1 ms
[2021-05-12 10:25:10] [INFO ] Time to serialize properties into /tmp/LTL11029597214259620535.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/LTL4526407787353407733.gal, -t, CGAL, -LTL, /tmp/LTL11029597214259620535.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/LTL4526407787353407733.gal -t CGAL -LTL /tmp/LTL11029597214259620535.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((((p8>=1)&&(p9>=1))&&(p4>=1))&&(p15>=1))"))))
Formula 0 simplified : !XF"((((p8>=1)&&(p9>=1))&&(p4>=1))&&(p15>=1))"
Detected timeout of ITS tools.
[2021-05-12 10:25:25] [INFO ] Flatten gal took : 1 ms
[2021-05-12 10:25:25] [INFO ] Applying decomposition
[2021-05-12 10:25:25] [INFO ] Flatten gal took : 1 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/graph12526603729733729271.txt, -o, /tmp/graph12526603729733729271.bin, -w, /tmp/graph12526603729733729271.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/graph12526603729733729271.bin, -l, -1, -v, -w, /tmp/graph12526603729733729271.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 10:25:25] [INFO ] Decomposing Gal with order
[2021-05-12 10:25:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 10:25:25] [INFO ] Flatten gal took : 2 ms
[2021-05-12 10:25:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 10:25:25] [INFO ] Time to serialize gal into /tmp/LTL280418854899013337.gal : 1 ms
[2021-05-12 10:25:25] [INFO ] Time to serialize properties into /tmp/LTL18202922971171818762.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/LTL280418854899013337.gal, -t, CGAL, -LTL, /tmp/LTL18202922971171818762.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/LTL280418854899013337.gal -t CGAL -LTL /tmp/LTL18202922971171818762.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((((i3.u1.p8>=1)&&(u2.p9>=1))&&(u7.p4>=1))&&(i3.u3.p15>=1))"))))
Formula 0 simplified : !XF"((((i3.u1.p8>=1)&&(u2.p9>=1))&&(u7.p4>=1))&&(i3.u3.p15>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7365263148439910787
[2021-05-12 10:25:40] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7365263148439910787
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/ltsmin7365263148439910787]
Compilation finished in 126 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7365263148439910787]
Link finished in 38 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin7365263148439910787]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.025: LTL layer: formula: X(<>((LTLAPp0==true)))
pins2lts-mc-linux64( 2/ 8), 0.025: "X(<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.025: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.027: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.083: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.285: DFS-FIFO for weak LTL, using special progress label 20
pins2lts-mc-linux64( 0/ 8), 0.287: There are 21 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.287: State length is 23, there are 20 groups
pins2lts-mc-linux64( 0/ 8), 0.287: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.287: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.287: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.287: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.369: ~106 levels ~960 states ~5832 transitions
pins2lts-mc-linux64( 2/ 8), 0.388: ~223 levels ~1920 states ~16840 transitions
pins2lts-mc-linux64( 2/ 8), 0.390: ~450 levels ~3840 states ~37376 transitions
pins2lts-mc-linux64( 1/ 8), 0.395: ~881 levels ~7680 states ~78368 transitions
pins2lts-mc-linux64( 1/ 8), 0.414: ~1754 levels ~15360 states ~140392 transitions
pins2lts-mc-linux64( 1/ 8), 0.445: ~3539 levels ~30720 states ~338808 transitions
pins2lts-mc-linux64( 5/ 8), 0.503: ~6994 levels ~61440 states ~601096 transitions
pins2lts-mc-linux64( 1/ 8), 0.667: ~14163 levels ~122880 states ~1415208 transitions
pins2lts-mc-linux64( 1/ 8), 0.877: ~27977 levels ~245760 states ~2403096 transitions
pins2lts-mc-linux64( 1/ 8), 1.354: ~55798 levels ~491520 states ~4645616 transitions
pins2lts-mc-linux64( 1/ 8), 2.299: ~111041 levels ~983040 states ~8607888 transitions
pins2lts-mc-linux64( 4/ 8), 7.189: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 7.483:
pins2lts-mc-linux64( 0/ 8), 7.483: mean standard work distribution: 13.9% (states) 8.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 7.483:
pins2lts-mc-linux64( 0/ 8), 7.483: Explored 1554065 states 18069217 transitions, fanout: 11.627
pins2lts-mc-linux64( 0/ 8), 7.483: Total exploration time 7.170 sec (7.030 sec minimum, 7.105 sec on average)
pins2lts-mc-linux64( 0/ 8), 7.483: States per second: 216745, Transitions per second: 2520114
pins2lts-mc-linux64( 0/ 8), 7.483:
pins2lts-mc-linux64( 0/ 8), 7.483: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 7.483: Redundant explorations: -91.3993
pins2lts-mc-linux64( 0/ 8), 7.483:
pins2lts-mc-linux64( 0/ 8), 7.483: Queue width: 8B, total height: 1445408, memory: 11.03MB
pins2lts-mc-linux64( 0/ 8), 7.483: Tree memory: 393.9MB, 22.9 B/state, compr.: 24.3%
pins2lts-mc-linux64( 0/ 8), 7.483: Tree fill ratio (roots/leafs): 13.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 7.483: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 7.483: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 7.483: Est. total memory use: 404.9MB (~1035.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7365263148439910787]
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))), --buchi-type=spotba], workingDir=/tmp/ltsmin7365263148439910787]
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:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property HouseConstruction-PT-16000-05 finished in 39449 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||(p0&&F(p1))))], 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 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.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 20 transition count 13
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 20 transition count 8
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 21 place count 12 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 21 place count 12 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 10 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 7 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 6 transition count 4
Applied a total of 30 rules in 5763 ms. Remains 6 /26 variables (removed 20) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-12 10:25:53] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 10:25:53] [INFO ] Implicit Places using invariants in 8 ms returned [0, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 10 ms to find 2 implicit places.
[2021-05-12 10:25:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-12 10:25:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 10:25:53] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 4/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 4 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 3 transition count 3
Applied a total of 2 rules in 1 ms. Remains 3 /4 variables (removed 1) and now considering 3/4 (removed 1) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-12 10:25:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 10:25:53] [INFO ] Implicit Places using invariants in 4 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-12 10:25:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 10:25:53] [INFO ] Implicit Places using invariants and state equation in 10 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 : 3/26 places, 3/18 transitions.
[2021-05-12 10:25:53] [INFO ] Initial state test concluded for 1 properties.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-16000-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(GEQ s2 1), p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 25000 reset in 65 ms.
Product exploration explored 100000 steps with 24982 reset in 58 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p1))), (F (G p0)), (NOT p1), p0]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25021 reset in 50 ms.
Product exploration explored 100000 steps with 24991 reset in 58 ms.
[2021-05-12 10:25:54] [INFO ] Flatten gal took : 1 ms
[2021-05-12 10:25:54] [INFO ] Flatten gal took : 0 ms
[2021-05-12 10:25:54] [INFO ] Time to serialize gal into /tmp/LTL17419286863935981901.gal : 0 ms
[2021-05-12 10:25:54] [INFO ] Time to serialize properties into /tmp/LTL737984405786296613.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/LTL17419286863935981901.gal, -t, CGAL, -LTL, /tmp/LTL737984405786296613.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/LTL17419286863935981901.gal -t CGAL -LTL /tmp/LTL737984405786296613.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(p17<1)"))||(F("(p18>=1)"))))
Formula 0 simplified : !(G"(p17<1)" | F"(p18>=1)")
Detected timeout of ITS tools.
[2021-05-12 10:26:09] [INFO ] Flatten gal took : 1 ms
[2021-05-12 10:26:09] [INFO ] Applying decomposition
[2021-05-12 10:26:09] [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/graph5092562001511924709.txt, -o, /tmp/graph5092562001511924709.bin, -w, /tmp/graph5092562001511924709.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/graph5092562001511924709.bin, -l, -1, -v, -w, /tmp/graph5092562001511924709.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 10:26:09] [INFO ] Decomposing Gal with order
[2021-05-12 10:26:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 10:26:09] [INFO ] Flatten gal took : 0 ms
[2021-05-12 10:26:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 10:26:09] [INFO ] Time to serialize gal into /tmp/LTL4852061893103059153.gal : 0 ms
[2021-05-12 10:26:09] [INFO ] Time to serialize properties into /tmp/LTL9809777020844288377.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/LTL4852061893103059153.gal, -t, CGAL, -LTL, /tmp/LTL9809777020844288377.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/LTL4852061893103059153.gal -t CGAL -LTL /tmp/LTL9809777020844288377.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("(u0.p17<1)"))||(F("(u0.p18>=1)"))))
Formula 0 simplified : !(G"(u0.p17<1)" | F"(u0.p18>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5050914630584880978
[2021-05-12 10:26:24] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5050914630584880978
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/ltsmin5050914630584880978]
Compilation finished in 86 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5050914630584880978]
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, ([]((LTLAPp0==true))||<>((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin5050914630584880978]
LTSmin run took 990 ms.
FORMULA HouseConstruction-PT-16000-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-16000-06 finished in 37590 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], 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 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.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 20 transition count 13
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 20 transition count 9
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 11 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
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 11 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 26 place count 9 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 8 transition count 5
Applied a total of 27 rules in 11192 ms. Remains 8 /26 variables (removed 18) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 8 cols
[2021-05-12 10:26:36] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 10:26:36] [INFO ] Implicit Places using invariants in 10 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 10 ms to find 2 implicit places.
[2021-05-12 10:26:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-12 10:26:36] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 10:26:36] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 6/26 places, 5/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2021-05-12 10:26:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-12 10:26:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 10:26:37] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Finished structural reductions, in 2 iterations. Remains : 6/26 places, 5/18 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-16000-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:(GEQ s4 1), p0:(GEQ s2 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 82046 steps with 2 reset in 52 ms.
FORMULA HouseConstruction-PT-16000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-16000-07 finished in 11489 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(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.
Applied a total of 0 rules in 0 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 10:26:37] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-12 10:26:37] [INFO ] Implicit Places using invariants in 25 ms returned [3, 9, 13, 20]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 27 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 10:26:37] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 10:26:37] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 10:26:37] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 10:26:37] [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 128 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-16000-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (LT s13 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-16000-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-16000-08 finished in 231 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 24 transition count 12
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 19 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 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 3 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 3 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 3 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 3 with 3 rules applied. Total rules applied 24 place count 11 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 10 transition count 5
Applied a total of 25 rules in 11472 ms. Remains 10 /26 variables (removed 16) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 10 cols
[2021-05-12 10:26:48] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 10:26:48] [INFO ] Implicit Places using invariants in 21 ms returned [0, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
[2021-05-12 10:26:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 8 cols
[2021-05-12 10:26:48] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 10:26:48] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 8/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 8 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 7 transition count 4
Applied a total of 2 rules in 7 ms. Remains 7 /8 variables (removed 1) and now considering 4/5 (removed 1) transitions.
// Phase 1: matrix 4 rows 7 cols
[2021-05-12 10:26:48] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 10:26:48] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 4 rows 7 cols
[2021-05-12 10:26:48] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 10:26:48] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 7/26 places, 4/18 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-16000-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s5 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 64000 steps with 0 reset in 55 ms.
FORMULA HouseConstruction-PT-16000-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-16000-11 finished in 11663 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F((G(p1)&&F(p2)&&p0))))))], workingDir=/home/mcc/execution]
Support contains 6 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 0 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 10:26:49] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 10:26:49] [INFO ] Implicit Places using invariants in 13 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 14 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 10:26:49] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 10:26:49] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 23/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 10:26:49] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 10:26:49] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-16000-12 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=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1)), p1:(AND (GEQ s7 1) (GEQ s8 1) (GEQ s11 1) (GEQ s12 1)), p2:(AND (GEQ s19 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 866 reset in 171 ms.
Product exploration explored 100000 steps with 820 reset in 170 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))), (F (G (NOT p2))), (NOT p0), (NOT p1), (NOT p2)]
Adopting property with smaller alphabet thanks to knowledge :(F (G (NOT p1)))
Stuttering acceptance computed with spot in 44 ms :[(NOT p1), (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.
Applied a total of 0 rules in 0 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 10:26:49] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 10:26:49] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 10:26:49] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 10:26:49] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 10:26:49] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 10:26:49] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3348 reset in 101 ms.
Product exploration explored 100000 steps with 3251 reset in 113 ms.
Applying partial POR strategy [true, true]
Stuttering acceptance computed with spot in 51 ms :[(NOT p1), (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 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 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 5 place count 23 transition count 20
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 23 transition count 20
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 21 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 21 transition count 18
Performed 1 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 1 rules applied. Total rules applied 14 place count 21 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 20 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 20 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 16 rules in 3 ms. Remains 20 /23 variables (removed 3) and now considering 17/18 (removed 1) transitions.
[2021-05-12 10:26:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 17 rows 20 cols
[2021-05-12 10:26:50] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 10:26:50] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/23 places, 17/18 transitions.
Product exploration explored 100000 steps with 5778 reset in 185 ms.
Product exploration explored 100000 steps with 5788 reset in 151 ms.
Starting structural reductions, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 10:26:50] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 10:26:50] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 10:26:50] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 10:26:50] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 10:26:50] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 10:26:50] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 18/18 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:789)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:835)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:825)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)

BK_STOP 1620815212066

--------------------
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
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ 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-16000"
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-16000, 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-162075406700237"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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