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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K 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.3K Mar 28 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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.6K Mar 23 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K 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.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-08000-00
FORMULA_NAME HouseConstruction-PT-08000-01
FORMULA_NAME HouseConstruction-PT-08000-02
FORMULA_NAME HouseConstruction-PT-08000-03
FORMULA_NAME HouseConstruction-PT-08000-04
FORMULA_NAME HouseConstruction-PT-08000-05
FORMULA_NAME HouseConstruction-PT-08000-06
FORMULA_NAME HouseConstruction-PT-08000-07
FORMULA_NAME HouseConstruction-PT-08000-08
FORMULA_NAME HouseConstruction-PT-08000-09
FORMULA_NAME HouseConstruction-PT-08000-10
FORMULA_NAME HouseConstruction-PT-08000-11
FORMULA_NAME HouseConstruction-PT-08000-12
FORMULA_NAME HouseConstruction-PT-08000-13
FORMULA_NAME HouseConstruction-PT-08000-14
FORMULA_NAME HouseConstruction-PT-08000-15

=== Now, execution of the tool begins

BK_START 1620813927973

Running Version 0
[2021-05-12 10:05:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:05:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 10:05:29] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-12 10:05:29] [INFO ] Transformed 26 places.
[2021-05-12 10:05:29] [INFO ] Transformed 18 transitions.
[2021-05-12 10:05:29] [INFO ] Parsed PT model containing 26 places and 18 transitions in 58 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 10:05:29] [INFO ] Initial state test concluded for 5 properties.
FORMULA HouseConstruction-PT-08000-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-08000-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-08000-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-08000-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-08000-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 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 10:05:29] [INFO ] Computed 8 place invariants in 9 ms
[2021-05-12 10:05:29] [INFO ] Implicit Places using invariants in 87 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 10:05:29] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-12 10:05:29] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 25/26 places, 18/18 transitions.
Applied a total of 0 rules in 10 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 10:05:29] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 10:05:29] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 25/26 places, 18/18 transitions.
[2021-05-12 10:05:30] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-12 10:05:30] [INFO ] Flatten gal took : 19 ms
FORMULA HouseConstruction-PT-08000-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-08000-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 10:05:30] [INFO ] Flatten gal took : 20 ms
[2021-05-12 10:05:30] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 104016 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=1625 ) properties (out of 16) seen :7
Running SMT prover for 9 properties.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 10:05:30] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-12 10:05:30] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-12 10:05:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:05:30] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 10:05:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 10:05:30] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-12 10:05:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 10:05:30] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-12 10:05:30] [INFO ] Computed and/alt/rep : 17/24/17 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-12 10:05:30] [INFO ] Added : 7 causal constraints over 2 iterations in 20 ms. Result :sat
[2021-05-12 10:05:30] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-12 10:05:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:05:30] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 10:05:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 10:05:30] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-12 10:05:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 10:05:30] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-12 10:05:30] [INFO ] Computed and/alt/rep : 17/24/17 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-12 10:05:30] [INFO ] Added : 10 causal constraints over 2 iterations in 24 ms. Result :sat
[2021-05-12 10:05:30] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-12 10:05:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:05:30] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 10:05:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 10:05:30] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-12 10:05:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 10:05:30] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-12 10:05:30] [INFO ] Computed and/alt/rep : 17/24/17 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 10:05:30] [INFO ] Added : 15 causal constraints over 3 iterations in 16 ms. Result :sat
[2021-05-12 10:05:30] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-12 10:05:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:05:30] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 10:05:30] [INFO ] Computed and/alt/rep : 17/24/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 10:05:30] [INFO ] Added : 7 causal constraints over 2 iterations in 19 ms. Result :sat
[2021-05-12 10:05:30] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-12 10:05:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:05:30] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 10:05:30] [INFO ] Computed and/alt/rep : 17/24/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 10:05:30] [INFO ] Added : 12 causal constraints over 3 iterations in 11 ms. Result :sat
[2021-05-12 10:05:30] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-12 10:05:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:05:30] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 10:05:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 10:05:30] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-12 10:05:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 10:05:30] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-12 10:05:30] [INFO ] Computed and/alt/rep : 17/24/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 10:05:30] [INFO ] Added : 8 causal constraints over 2 iterations in 24 ms. Result :sat
[2021-05-12 10:05:30] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-12 10:05:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:05:30] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 10:05:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 10:05:30] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-12 10:05:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 10:05:30] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-12 10:05:30] [INFO ] Computed and/alt/rep : 17/24/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 10:05:30] [INFO ] Added : 10 causal constraints over 2 iterations in 14 ms. Result :sat
[2021-05-12 10:05:30] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-12 10:05:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:05:30] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-12 10:05:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 10:05:30] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-12 10:05:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 10:05:30] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-12 10:05:30] [INFO ] Computed and/alt/rep : 17/24/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 10:05:30] [INFO ] Added : 11 causal constraints over 3 iterations in 11 ms. Result :sat
[2021-05-12 10:05:30] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-12 10:05:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 10:05:30] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-12 10:05:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 10:05:30] [INFO ] [Nat]Absence check using 0 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-12 10:05:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 10:05:30] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-12 10:05:30] [INFO ] Computed and/alt/rep : 17/24/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 10:05:30] [INFO ] Added : 10 causal constraints over 2 iterations in 11 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
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 23 transition count 13
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 19 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 18 transition count 12
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 10 place count 18 transition count 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 24 place count 10 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24 place count 10 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 3 with 3 rules applied. Total rules applied 27 place count 8 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 27 place count 8 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 7 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 33 place count 4 transition count 3
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 35 place count 3 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 36 place count 2 transition count 2
Applied a total of 36 rules in 542 ms. Remains 2 /25 variables (removed 23) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 10:05:31] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 10:05:31] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 10:05:31] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 10:05:31] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-12 10:05:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 10:05:31] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 10:05:31] [INFO ] Dead Transitions using invariants and state equation in 5 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/25 places, 2/18 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-08000-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 514 reset in 165 ms.
Product exploration explored 100000 steps with 334 reset in 137 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA HouseConstruction-PT-08000-00 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-08000-00 finished in 1158 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (G(p0)||X(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 0 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-12 10:05:32] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 10:05:32] [INFO ] Implicit Places using invariants in 15 ms returned [3, 9, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 16 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 10:05:32] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 10:05:32] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 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:05:32] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-12 10:05:32] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-08000-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(GT s17 s9), p0:(LEQ s11 s6)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-08000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-08000-03 finished in 154 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
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 23 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 19 transition count 13
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 8 place count 19 transition count 7
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 21 place count 12 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 24 place count 10 transition count 6
Applied a total of 24 rules in 535 ms. Remains 10 /25 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 10 cols
[2021-05-12 10:05:32] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 10:05:32] [INFO ] Implicit Places using invariants in 10 ms returned [2, 3, 4, 8]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 11 ms to find 4 implicit places.
[2021-05-12 10:05:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-12 10:05:32] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 10:05:32] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 6/25 places, 6/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 5
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 5
Applied a total of 2 rules in 1 ms. Remains 5 /6 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-12 10:05:32] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 10:05:32] [INFO ] Implicit Places using invariants in 4 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-12 10:05:32] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 10:05:32] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 11 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/25 places, 5/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-08000-04 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:(LEQ 2 s1), p1:(LEQ s4 s2)], 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 50 reset in 96 ms.
Product exploration explored 100000 steps with 22 reset in 135 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
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 p1)), (NOT p0), p1]
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA HouseConstruction-PT-08000-04 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-08000-04 finished in 1030 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||(p1&&G(F(p1)))) U p2))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
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 24 transition count 14
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 14
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 10
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 14 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 18 place count 14 transition count 9
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 21 place count 12 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 21 place count 12 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 11 transition count 8
Applied a total of 23 rules in 16 ms. Remains 11 /25 variables (removed 14) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2021-05-12 10:05:33] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 10:05:33] [INFO ] Implicit Places using invariants in 11 ms returned [3, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 15 ms to find 2 implicit places.
[2021-05-12 10:05:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-12 10:05:33] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 10:05:33] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 9/25 places, 8/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2021-05-12 10:05:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-12 10:05:33] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 10:05:33] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p2), true, (NOT p1), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-08000-07 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ 3 s1), p0:(LEQ 2 s7), p1:(LEQ s4 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1805 steps with 42 reset in 4 ms.
FORMULA HouseConstruction-PT-08000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-08000-07 finished in 172 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-12 10:05:33] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 10:05:33] [INFO ] Implicit Places using invariants in 20 ms returned [3, 9, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 20 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 10:05:33] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 10:05:33] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 10:05:33] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 10:05:33] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-08000-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT s8 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9565 reset in 69 ms.
Product exploration explored 100000 steps with 9604 reset in 75 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9628 reset in 66 ms.
Product exploration explored 100000 steps with 9567 reset in 79 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
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 18
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 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 20 transition count 17
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 20 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 20 transition count 17
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 17 transition count 14
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 17 transition count 14
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 20 rules in 4 ms. Remains 17 /21 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2021-05-12 10:05:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 17 cols
[2021-05-12 10:05:34] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-12 10:05:34] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17/21 places, 14/18 transitions.
Product exploration explored 100000 steps with 13778 reset in 186 ms.
Product exploration explored 100000 steps with 13750 reset in 134 ms.
[2021-05-12 10:05:34] [INFO ] Flatten gal took : 2 ms
[2021-05-12 10:05:34] [INFO ] Flatten gal took : 2 ms
[2021-05-12 10:05:34] [INFO ] Time to serialize gal into /tmp/LTL11150626695939713855.gal : 79 ms
[2021-05-12 10:05:34] [INFO ] Time to serialize properties into /tmp/LTL15339233799785995990.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/LTL11150626695939713855.gal, -t, CGAL, -LTL, /tmp/LTL15339233799785995990.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/LTL11150626695939713855.gal -t CGAL -LTL /tmp/LTL15339233799785995990.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(p8>p15)"))))))
Formula 0 simplified : !XXXF"(p8>p15)"
Detected timeout of ITS tools.
[2021-05-12 10:05:49] [INFO ] Flatten gal took : 2 ms
[2021-05-12 10:05:49] [INFO ] Applying decomposition
[2021-05-12 10:05:49] [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/graph10835699212636224040.txt, -o, /tmp/graph10835699212636224040.bin, -w, /tmp/graph10835699212636224040.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/graph10835699212636224040.bin, -l, -1, -v, -w, /tmp/graph10835699212636224040.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 10:05:49] [INFO ] Decomposing Gal with order
[2021-05-12 10:05:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 10:05:49] [INFO ] Flatten gal took : 52 ms
[2021-05-12 10:05:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 10:05:49] [INFO ] Time to serialize gal into /tmp/LTL3294796698263487911.gal : 1 ms
[2021-05-12 10:05:49] [INFO ] Time to serialize properties into /tmp/LTL10940526026465919706.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/LTL3294796698263487911.gal, -t, CGAL, -LTL, /tmp/LTL10940526026465919706.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/LTL3294796698263487911.gal -t CGAL -LTL /tmp/LTL10940526026465919706.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(gu2.p8>gu2.p15)"))))))
Formula 0 simplified : !XXXF"(gu2.p8>gu2.p15)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5627295086387542830
[2021-05-12 10:06:04] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5627295086387542830
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/ltsmin5627295086387542830]
Compilation finished in 244 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5627295086387542830]
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(X(<>((LTLAPp0==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5627295086387542830]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-08000-09 finished in 46487 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-12 10:06:19] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 10:06:19] [INFO ] Implicit Places using invariants in 20 ms returned [3, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 20 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 10:06:19] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-12 10:06:19] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 10:06:19] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 10:06:19] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-08000-11 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(GT 1 s14), p0:(OR (LEQ 1 s8) (LEQ 1 s14))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 139 ms.
Product exploration explored 100000 steps with 0 reset in 184 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 p1)), (F (OR (G p0) (G (NOT p0)))), p1, (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 140 ms.
Product exploration explored 100000 steps with 0 reset in 231 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 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 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 5 place count 22 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 22 transition count 20
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 20 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 20 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 20 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 19 transition count 17
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 19 transition count 17
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 17 rules in 4 ms. Remains 19 /22 variables (removed 3) and now considering 17/18 (removed 1) transitions.
[2021-05-12 10:06:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 19 cols
[2021-05-12 10:06:21] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 10:06:21] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/22 places, 17/18 transitions.
Stuttering criterion allowed to conclude after 56001 steps with 0 reset in 51 ms.
FORMULA HouseConstruction-PT-08000-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-08000-11 finished in 1238 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-12 10:06:21] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 10:06:21] [INFO ] Implicit Places using invariants in 26 ms returned [3, 9, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 27 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 10:06:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 10:06:21] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 10:06:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 10:06:21] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-08000-12 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s13 s17), p1:(LEQ s13 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-08000-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-08000-12 finished in 149 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
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 23 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 18 transition count 12
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 18 transition count 7
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 21 place count 12 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 12 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 10 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 10 transition count 5
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 5
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 4
Applied a total of 27 rules in 3132 ms. Remains 8 /25 variables (removed 17) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 8 cols
[2021-05-12 10:06:24] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 10:06:24] [INFO ] Implicit Places using invariants in 9 ms returned [0, 2, 4]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 10 ms to find 3 implicit places.
[2021-05-12 10:06:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2021-05-12 10:06:24] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 10:06:24] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 5/25 places, 4/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2021-05-12 10:06:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2021-05-12 10:06:24] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 10:06:24] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 5/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-08000-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s4 s2)], 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 4554 reset in 65 ms.
Product exploration explored 100000 steps with 3600 reset in 90 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 (OR (G p0) (G (NOT p0)))), (NOT p0)]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5359 reset in 56 ms.
Product exploration explored 100000 steps with 5021 reset in 82 ms.
[2021-05-12 10:06:24] [INFO ] Flatten gal took : 0 ms
[2021-05-12 10:06:24] [INFO ] Flatten gal took : 8 ms
[2021-05-12 10:06:24] [INFO ] Time to serialize gal into /tmp/LTL12717710393414238102.gal : 1 ms
[2021-05-12 10:06:24] [INFO ] Time to serialize properties into /tmp/LTL1011685874876827762.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/LTL12717710393414238102.gal, -t, CGAL, -LTL, /tmp/LTL1011685874876827762.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/LTL12717710393414238102.gal -t CGAL -LTL /tmp/LTL1011685874876827762.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(p25>p8)")))
Formula 0 simplified : !F"(p25>p8)"
Detected timeout of ITS tools.
[2021-05-12 10:06:39] [INFO ] Flatten gal took : 0 ms
[2021-05-12 10:06:39] [INFO ] Applying decomposition
[2021-05-12 10:06:39] [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/graph7085350565773895367.txt, -o, /tmp/graph7085350565773895367.bin, -w, /tmp/graph7085350565773895367.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/graph7085350565773895367.bin, -l, -1, -v, -w, /tmp/graph7085350565773895367.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 10:06:39] [INFO ] Decomposing Gal with order
[2021-05-12 10:06:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 10:06:39] [INFO ] Flatten gal took : 1 ms
[2021-05-12 10:06:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 10:06:39] [INFO ] Time to serialize gal into /tmp/LTL17879732221572068563.gal : 0 ms
[2021-05-12 10:06:39] [INFO ] Time to serialize properties into /tmp/LTL1887365325164561061.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/LTL17879732221572068563.gal, -t, CGAL, -LTL, /tmp/LTL1887365325164561061.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/LTL17879732221572068563.gal -t CGAL -LTL /tmp/LTL1887365325164561061.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(gu1.p25>gu1.p8)")))
Formula 0 simplified : !F"(gu1.p25>gu1.p8)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16687200558716319894
[2021-05-12 10:06:54] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16687200558716319894
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/ltsmin16687200558716319894]
Compilation finished in 84 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16687200558716319894]
Link finished in 41 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/ltsmin16687200558716319894]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-08000-14 finished in 48708 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 16
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 22 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 20 transition count 14
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 6 place count 20 transition count 8
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 20 place count 12 transition count 8
Applied a total of 20 rules in 525 ms. Remains 12 /25 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-12 10:07:10] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 10:07:10] [INFO ] Implicit Places using invariants in 15 ms returned [1, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 16 ms to find 2 implicit places.
[2021-05-12 10:07:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-12 10:07:10] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-12 10:07:10] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 10/25 places, 8/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2021-05-12 10:07:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-12 10:07:10] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-12 10:07:10] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 2 iterations. Remains : 10/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-08000-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT s7 s9), p1:(GT s2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 65023 steps with 5 reset in 52 ms.
FORMULA HouseConstruction-PT-08000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-08000-15 finished in 756 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-12 10:07:10] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin7573475415961968101
[2021-05-12 10:07:10] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2021-05-12 10:07:10] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 10:07:10] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2021-05-12 10:07:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 10:07:10] [INFO ] Flatten gal took : 2 ms
[2021-05-12 10:07:10] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2021-05-12 10:07:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 10:07:10] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7573475415961968101
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/ltsmin7573475415961968101]
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/graph9344236689646734277.txt, -o, /tmp/graph9344236689646734277.bin, -w, /tmp/graph9344236689646734277.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/graph9344236689646734277.bin, -l, -1, -v, -w, /tmp/graph9344236689646734277.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 10:07:10] [INFO ] Decomposing Gal with order
[2021-05-12 10:07:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 10:07:10] [INFO ] Flatten gal took : 2 ms
[2021-05-12 10:07:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 10:07:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality2919812631501232149.gal : 1 ms
[2021-05-12 10:07:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality9076027158476445739.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/LTLCardinality2919812631501232149.gal, -t, CGAL, -LTL, /tmp/LTLCardinality9076027158476445739.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/LTLCardinality2919812631501232149.gal -t CGAL -LTL /tmp/LTLCardinality9076027158476445739.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((X(X(X(F("(gu4.p8>gu4.p15)"))))))
Formula 0 simplified : !XXXF"(gu4.p8>gu4.p15)"
Compilation finished in 158 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7573475415961968101]
Link finished in 32 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(X(<>((LTLAPp0==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7573475415961968101]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: LTL layer: formula: X(X(X(<>((LTLAPp0==true)))))
pins2lts-mc-linux64( 1/ 8), 0.003: "X(X(X(<>((LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: 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.060: DFS-FIFO for weak LTL, using special progress label 21
pins2lts-mc-linux64( 0/ 8), 0.060: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.060: State length is 26, there are 22 groups
pins2lts-mc-linux64( 0/ 8), 0.060: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.060: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.060: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.060: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.305: ~105 levels ~960 states ~3824 transitions
pins2lts-mc-linux64( 3/ 8), 0.337: ~206 levels ~1920 states ~7648 transitions
pins2lts-mc-linux64( 3/ 8), 0.357: ~404 levels ~3840 states ~14976 transitions
pins2lts-mc-linux64( 3/ 8), 0.360: ~800 levels ~7680 states ~30128 transitions
pins2lts-mc-linux64( 0/ 8), 0.373: ~1603 levels ~15360 states ~62536 transitions
pins2lts-mc-linux64( 3/ 8), 0.382: ~3197 levels ~30720 states ~124648 transitions
pins2lts-mc-linux64( 3/ 8), 0.408: ~6380 levels ~61440 states ~251880 transitions
pins2lts-mc-linux64( 3/ 8), 0.475: ~12763 levels ~122880 states ~506848 transitions
pins2lts-mc-linux64( 3/ 8), 0.597: ~25532 levels ~245760 states ~1016336 transitions
pins2lts-mc-linux64( 3/ 8), 0.756: ~32000 levels ~491520 states ~1612888 transitions
pins2lts-mc-linux64( 3/ 8), 1.002: ~32000 levels ~983040 states ~2569240 transitions
pins2lts-mc-linux64( 3/ 8), 1.492: ~32000 levels ~1966080 states ~4506112 transitions
pins2lts-mc-linux64( 3/ 8), 2.415: ~32000 levels ~3932160 states ~8388968 transitions
pins2lts-mc-linux64( 3/ 8), 4.357: ~32000 levels ~7864320 states ~16172256 transitions
pins2lts-mc-linux64( 3/ 8), 8.285: ~32000 levels ~15728640 states ~31780184 transitions
pins2lts-mc-linux64( 3/ 8), 17.220: ~32000 levels ~31457280 states ~64970416 transitions
pins2lts-mc-linux64( 0/ 8), 37.402: ~31996 levels ~62914560 states ~154876576 transitions
pins2lts-mc-linux64( 0/ 8), 78.286: ~31996 levels ~125829120 states ~310140696 transitions
pins2lts-mc-linux64( 0/ 8), 165.592: ~31996 levels ~251658240 states ~620888512 transitions
pins2lts-mc-linux64( 3/ 8), 340.196: ~32000 levels ~503316480 states ~1233686216 transitions
pins2lts-mc-linux64( 3/ 8), 395.197: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 395.203:
pins2lts-mc-linux64( 0/ 8), 395.203: mean standard work distribution: 173.2% (states) 173.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 395.204:
pins2lts-mc-linux64( 0/ 8), 395.204: Explored 133979398 states 329836244 transitions, fanout: 2.462
pins2lts-mc-linux64( 0/ 8), 395.204: Total exploration time 395.130 sec (395.100 sec minimum, 395.111 sec on average)
pins2lts-mc-linux64( 0/ 8), 395.204: States per second: 339077, Transitions per second: 834754
pins2lts-mc-linux64( 0/ 8), 395.204:
pins2lts-mc-linux64( 0/ 8), 395.204: Progress states detected: 3
pins2lts-mc-linux64( 0/ 8), 395.204: Redundant explorations: -0.1767
pins2lts-mc-linux64( 0/ 8), 395.204:
pins2lts-mc-linux64( 0/ 8), 395.204: Queue width: 8B, total height: 64007, memory: 0.49MB
pins2lts-mc-linux64( 0/ 8), 395.204: Tree memory: 1050.8MB, 8.2 B/state, compr.: 7.7%
pins2lts-mc-linux64( 0/ 8), 395.204: Tree fill ratio (roots/leafs): 99.0%/10.0%
pins2lts-mc-linux64( 0/ 8), 395.204: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 395.204: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 395.204: Est. total memory use: 1051.3MB (~1024.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X(<>((LTLAPp0==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7573475415961968101]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X(<>((LTLAPp0==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7573475415961968101]
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)
Detected timeout of ITS tools.
[2021-05-12 10:27:44] [INFO ] Flatten gal took : 56 ms
[2021-05-12 10:27:44] [INFO ] Time to serialize gal into /tmp/LTLCardinality9568438416209265843.gal : 20 ms
[2021-05-12 10:27:44] [INFO ] Time to serialize properties into /tmp/LTLCardinality13117483567722058212.ltl : 5 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/LTLCardinality9568438416209265843.gal, -t, CGAL, -LTL, /tmp/LTLCardinality13117483567722058212.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/LTLCardinality9568438416209265843.gal -t CGAL -LTL /tmp/LTLCardinality13117483567722058212.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((X(X(X(F("(p8>p15)"))))))
Formula 0 simplified : !XXXF"(p8>p15)"
Detected timeout of ITS tools.
[2021-05-12 10:48:18] [INFO ] Flatten gal took : 53 ms
[2021-05-12 10:48:18] [INFO ] Input system was already deterministic with 18 transitions.
[2021-05-12 10:48:18] [INFO ] Transformed 25 places.
[2021-05-12 10:48:18] [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 10:48:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality2817941972624771684.gal : 3 ms
[2021-05-12 10:48:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality5557269128211321271.ltl : 2 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/LTLCardinality2817941972624771684.gal, -t, CGAL, -LTL, /tmp/LTLCardinality5557269128211321271.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/LTLCardinality2817941972624771684.gal -t CGAL -LTL /tmp/LTLCardinality5557269128211321271.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(X(F("(p8>p15)"))))))
Formula 0 simplified : !XXXF"(p8>p15)"

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-08000"
export BK_EXAMINATION="LTLCardinality"
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-08000, examination is LTLCardinality"
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-162075406700228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-08000.tgz
mv HouseConstruction-PT-08000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;