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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 120K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 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 16K Mar 28 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 21:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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-02000-00
FORMULA_NAME HouseConstruction-PT-02000-01
FORMULA_NAME HouseConstruction-PT-02000-02
FORMULA_NAME HouseConstruction-PT-02000-03
FORMULA_NAME HouseConstruction-PT-02000-04
FORMULA_NAME HouseConstruction-PT-02000-05
FORMULA_NAME HouseConstruction-PT-02000-06
FORMULA_NAME HouseConstruction-PT-02000-07
FORMULA_NAME HouseConstruction-PT-02000-08
FORMULA_NAME HouseConstruction-PT-02000-09
FORMULA_NAME HouseConstruction-PT-02000-10
FORMULA_NAME HouseConstruction-PT-02000-11
FORMULA_NAME HouseConstruction-PT-02000-12
FORMULA_NAME HouseConstruction-PT-02000-13
FORMULA_NAME HouseConstruction-PT-02000-14
FORMULA_NAME HouseConstruction-PT-02000-15

=== Now, execution of the tool begins

BK_START 1620807411123

Running Version 0
[2021-05-12 08:16:52] [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 08:16:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 08:16:52] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-12 08:16:52] [INFO ] Transformed 26 places.
[2021-05-12 08:16:52] [INFO ] Transformed 18 transitions.
[2021-05-12 08:16:52] [INFO ] Parsed PT model containing 26 places and 18 transitions in 57 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 08:16:52] [INFO ] Initial state test concluded for 2 properties.
FORMULA HouseConstruction-PT-02000-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-02000-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-02000-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 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 08:16:52] [INFO ] Computed 8 place invariants in 5 ms
[2021-05-12 08:16:52] [INFO ] Implicit Places using invariants in 64 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 08:16:52] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-12 08:16:52] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 25/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 08:16:52] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 08:16:52] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 25/26 places, 18/18 transitions.
[2021-05-12 08:16:52] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-12 08:16:52] [INFO ] Flatten gal took : 17 ms
FORMULA HouseConstruction-PT-02000-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-02000-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 08:16:52] [INFO ] Flatten gal took : 4 ms
[2021-05-12 08:16:53] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 32016 steps, including 0 resets, run visited all 19 properties in 19 ms. (steps per millisecond=1685 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(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
Discarding 1 places :
Implicit places reduction 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 5 rules applied. Total rules applied 5 place count 23 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 19 transition count 11
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 15 place count 16 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 15 place count 16 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 24 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 3 with 3 rules applied. Total rules applied 27 place count 9 transition count 6
Applied a total of 27 rules in 10 ms. Remains 9 /25 variables (removed 16) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2021-05-12 08:16:53] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 08:16:53] [INFO ] Implicit Places using invariants in 19 ms returned [2, 3, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 20 ms to find 3 implicit places.
[2021-05-12 08:16:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-12 08:16:53] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 08:16:53] [INFO ] Dead Transitions using invariants and state equation in 9 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 08:16:53] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 08:16:53] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-12 08:16:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 08:16:53] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 14 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 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-02000-00 automaton TGBA [mat=[[{ cond=(NOT p0), 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}]], initial=0, aps=[p0:(LEQ 2 s2), p1:(LEQ s4 s0)], 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 7463 reset in 202 ms.
Product exploration explored 100000 steps with 7502 reset in 126 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-02000-00 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-02000-00 finished in 668 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U 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
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 2 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 08:16:53] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 08:16:53] [INFO ] Implicit Places using invariants in 28 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 08:16:53] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-12 08:16:53] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 4 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 08:16:53] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 08:16:53] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-02000-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT 1 s9), p0:(AND (LEQ 1 s9) (LEQ s10 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-02000-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-02000-02 finished in 186 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F((p0||G(p1)))) U G(p2)))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 14
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 19 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 18 transition count 13
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 9 place count 18 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 3 with 13 rules applied. Total rules applied 22 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 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 8 transition count 6
Applied a total of 26 rules in 96 ms. Remains 8 /25 variables (removed 17) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-12 08:16:54] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-12 08:16:54] [INFO ] Implicit Places using invariants in 9 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 10 ms to find 1 implicit places.
[2021-05-12 08:16:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-12 08:16:54] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 08:16:54] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 7/25 places, 6/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-12 08:16:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-12 08:16:54] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 08:16:54] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 2 iterations. Remains : 7/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p2), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-02000-04 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ 2 s6), p1:(LEQ 1 s1), p0:(GT 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 24894 reset in 114 ms.
Product exploration explored 100000 steps with 27756 reset in 252 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p2))), (F (G (NOT p1))), (F (G p0)), (NOT p2), (NOT p1), p0]
Adopting property with smaller alphabet thanks to knowledge :(F (G (NOT p2)))
Stuttering acceptance computed with spot in 39 ms :[(NOT p2), (NOT p2)]
Support contains 1 out of 7 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 7/7 places, 6/6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 5 transition count 3
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 4 place count 4 transition count 3
Applied a total of 4 rules in 74 ms. Remains 4 /7 variables (removed 3) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 4 cols
[2021-05-12 08:16:54] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 08:16:54] [INFO ] Implicit Places using invariants in 17 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
[2021-05-12 08:16:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-12 08:16:54] [INFO ] Computed 0 place invariants in 8 ms
[2021-05-12 08:16:54] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 3/7 places, 3/6 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 3 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2 transition count 2
Applied a total of 2 rules in 1 ms. Remains 2 /3 variables (removed 1) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 08:16:54] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 08:16:54] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 08:16:54] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 08:16:54] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2/7 places, 2/6 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p2), (NOT p2)]
Stuttering criterion allowed to conclude after 8934 steps with 388 reset in 4 ms.
FORMULA HouseConstruction-PT-02000-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-02000-04 finished in 1041 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&F(p1)&&(p1||X(!p0)))))], 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
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 08:16:54] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 08:16:54] [INFO ] Implicit Places using invariants in 13 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 15 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 08:16:54] [INFO ] Computed 4 place invariants in 5 ms
[2021-05-12 08:16:55] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 08:16:55] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 08:16:55] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 32 ms :[(OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : HouseConstruction-PT-02000-06 automaton TGBA [mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s16 s21), p1:(GT 2 s4)], 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][false, false]]
Entered a terminal (fully accepting) state of product in 67 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-02000-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-02000-06 finished in 108 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G(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.
Discarding 1 places :
Implicit places reduction 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 5 rules applied. Total rules applied 5 place count 22 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 10 place count 18 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 17 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 11 place count 17 transition count 6
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 3 with 13 rules applied. Total rules applied 24 place count 10 transition count 6
Applied a total of 24 rules in 38 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 08:16:55] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 08:16:55] [INFO ] Implicit Places using invariants in 11 ms returned [1, 4, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 12 ms to find 3 implicit places.
[2021-05-12 08:16:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-12 08:16:55] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 08:16:55] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Starting structural reductions, iteration 1 : 7/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 7 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 6 transition count 5
Applied a total of 2 rules in 1 ms. Remains 6 /7 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 6 cols
[2021-05-12 08:16:55] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 08:16:55] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-12 08:16:55] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 08:16:55] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 6/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-02000-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s5), p1:(LEQ s2 s1)], 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]]
Product exploration explored 100000 steps with 2065 reset in 94 ms.
Product exploration explored 100000 steps with 1765 reset in 132 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 6 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]
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1658 reset in 65 ms.
Product exploration explored 100000 steps with 2041 reset in 87 ms.
[2021-05-12 08:16:55] [INFO ] Flatten gal took : 1 ms
[2021-05-12 08:16:55] [INFO ] Flatten gal took : 1 ms
[2021-05-12 08:16:55] [INFO ] Time to serialize gal into /tmp/LTL9472763552418491381.gal : 1 ms
[2021-05-12 08:16:55] [INFO ] Time to serialize properties into /tmp/LTL4554642169830582962.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/LTL9472763552418491381.gal, -t, CGAL, -LTL, /tmp/LTL4554642169830582962.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/LTL9472763552418491381.gal -t CGAL -LTL /tmp/LTL4554642169830582962.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(p19>=2)"))&&(G(F("(p5<=p6)")))))
Formula 0 simplified : !(F"(p19>=2)" & GF"(p5<=p6)")
Detected timeout of ITS tools.
[2021-05-12 08:17:10] [INFO ] Flatten gal took : 1 ms
[2021-05-12 08:17:10] [INFO ] Applying decomposition
[2021-05-12 08:17:10] [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/graph1092588859166996752.txt, -o, /tmp/graph1092588859166996752.bin, -w, /tmp/graph1092588859166996752.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/graph1092588859166996752.bin, -l, -1, -v, -w, /tmp/graph1092588859166996752.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 08:17:10] [INFO ] Decomposing Gal with order
[2021-05-12 08:17:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 08:17:10] [INFO ] Flatten gal took : 43 ms
[2021-05-12 08:17:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 08:17:10] [INFO ] Time to serialize gal into /tmp/LTL14126325234198871557.gal : 0 ms
[2021-05-12 08:17:10] [INFO ] Time to serialize properties into /tmp/LTL9829479230418924278.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/LTL14126325234198871557.gal, -t, CGAL, -LTL, /tmp/LTL9829479230418924278.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/LTL14126325234198871557.gal -t CGAL -LTL /tmp/LTL9829479230418924278.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(gu1.p19>=2)"))&&(G(F("(gu0.p5<=gu0.p6)")))))
Formula 0 simplified : !(F"(gu1.p19>=2)" & GF"(gu0.p5<=gu0.p6)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin786132806785649807
[2021-05-12 08:17:26] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin786132806785649807
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/ltsmin786132806785649807]
Compilation finished in 153 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin786132806785649807]
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, (<>((LTLAPp0==true))&&[](<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin786132806785649807]
LTSmin run took 506 ms.
FORMULA HouseConstruction-PT-02000-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-02000-07 finished in 31650 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(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
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 08:17:26] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 08:17:26] [INFO ] Implicit Places using invariants in 14 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 14 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 08:17:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 08:17:26] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 4 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 08:17:26] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 08:17:26] [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 89 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-02000-08 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:(LEQ 3 s9)], 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 1164 reset in 117 ms.
Product exploration explored 100000 steps with 1124 reset in 121 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 1172 reset in 106 ms.
Product exploration explored 100000 steps with 1083 reset in 121 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 21/21 places, 18/18 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 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 6 place count 21 transition count 20
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 21 transition count 20
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 19 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 19 transition count 18
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 19 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 15 transition count 14
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 15 transition count 14
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 26 rules in 5 ms. Remains 15 /21 variables (removed 6) and now considering 14/18 (removed 4) transitions.
[2021-05-12 08:17:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 15 cols
[2021-05-12 08:17:27] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 08:17:27] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/21 places, 14/18 transitions.
Product exploration explored 100000 steps with 3609 reset in 245 ms.
Product exploration explored 100000 steps with 3603 reset in 130 ms.
[2021-05-12 08:17:28] [INFO ] Flatten gal took : 2 ms
[2021-05-12 08:17:28] [INFO ] Flatten gal took : 2 ms
[2021-05-12 08:17:28] [INFO ] Time to serialize gal into /tmp/LTL12855939509107524126.gal : 1 ms
[2021-05-12 08:17:28] [INFO ] Time to serialize properties into /tmp/LTL13826895500180752220.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/LTL12855939509107524126.gal, -t, CGAL, -LTL, /tmp/LTL13826895500180752220.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/LTL12855939509107524126.gal -t CGAL -LTL /tmp/LTL13826895500180752220.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(p9>=3)"))))))
Formula 0 simplified : !XXXF"(p9>=3)"
Detected timeout of ITS tools.
[2021-05-12 08:17:43] [INFO ] Flatten gal took : 2 ms
[2021-05-12 08:17:43] [INFO ] Applying decomposition
[2021-05-12 08:17:43] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1755434114368078436.txt, -o, /tmp/graph1755434114368078436.bin, -w, /tmp/graph1755434114368078436.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/graph1755434114368078436.bin, -l, -1, -v, -w, /tmp/graph1755434114368078436.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 08:17:43] [INFO ] Decomposing Gal with order
[2021-05-12 08:17:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 08:17:43] [INFO ] Flatten gal took : 2 ms
[2021-05-12 08:17:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 08:17:43] [INFO ] Time to serialize gal into /tmp/LTL15037971423483656880.gal : 1 ms
[2021-05-12 08:17:43] [INFO ] Time to serialize properties into /tmp/LTL122003053010603160.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/LTL15037971423483656880.gal, -t, CGAL, -LTL, /tmp/LTL122003053010603160.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/LTL15037971423483656880.gal -t CGAL -LTL /tmp/LTL122003053010603160.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(i0.u3.p9>=3)"))))))
Formula 0 simplified : !XXXF"(i0.u3.p9>=3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3647982488022924379
[2021-05-12 08:17:58] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3647982488022924379
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/ltsmin3647982488022924379]
Compilation finished in 120 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3647982488022924379]
Link finished in 30 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/ltsmin3647982488022924379]
LTSmin run took 1154 ms.
FORMULA HouseConstruction-PT-02000-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-02000-08 finished in 32758 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X((X(G(p0))||(p0 U (p1||G(p0))))))))], 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
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 08:17:59] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 08:17:59] [INFO ] Implicit Places using invariants in 25 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 08:17:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 08:17:59] [INFO ] Dead Transitions using invariants and state equation in 13 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 08:17:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 08:17:59] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-02000-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(GT s18 s16), p1:(AND (GT s18 s16) (GT 3 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-02000-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-02000-10 finished in 184 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F(G(!p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 6 rules applied. Total rules applied 6 place count 22 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 12 place count 17 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 16 transition count 11
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 13 place count 16 transition count 5
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 3 with 13 rules applied. Total rules applied 26 place count 9 transition count 5
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 30 place count 6 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 5 transition count 3
Applied a total of 31 rules in 109 ms. Remains 5 /25 variables (removed 20) and now considering 3/18 (removed 15) transitions.
// Phase 1: matrix 3 rows 5 cols
[2021-05-12 08:17:59] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 08:17:59] [INFO ] Implicit Places using invariants in 12 ms returned [0, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 13 ms to find 2 implicit places.
[2021-05-12 08:17:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-12 08:17:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 08:17:59] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 3/25 places, 3/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 3 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2 transition count 2
Applied a total of 2 rules in 1 ms. Remains 2 /3 variables (removed 1) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 08:17:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 08:17:59] [INFO ] Implicit Places using invariants in 4 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 08:17:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 08:17:59] [INFO ] Implicit Places using invariants and state equation in 6 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 : 2/25 places, 2/18 transitions.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), p0]
Running random walk in product with property : HouseConstruction-PT-02000-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s1)], 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 4000 steps with 0 reset in 3 ms.
FORMULA HouseConstruction-PT-02000-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-02000-11 finished in 223 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 20 transition count 15
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 20 transition count 9
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 14 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 13 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 21 place count 11 transition count 8
Applied a total of 21 rules in 41 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 08:17:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 08:17:59] [INFO ] Implicit Places using invariants in 9 ms returned [3, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 10 ms to find 2 implicit places.
[2021-05-12 08:17:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-12 08:17:59] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 08:17:59] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 9/25 places, 8/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2021-05-12 08:17:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-12 08:17:59] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 08:17:59] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-02000-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT s8 s4) (LEQ s1 s7))], 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 16000 steps with 0 reset in 19 ms.
FORMULA HouseConstruction-PT-02000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-02000-13 finished in 129 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(G(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
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 08:18:00] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 08:18:00] [INFO ] Implicit Places using invariants in 13 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 14 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 08:18:00] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 08:18:00] [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 08:18:00] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 08:18:00] [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 79 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : HouseConstruction-PT-02000-14 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GT s19 s8), p0:(LEQ 1 s1)], 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 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-02000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-02000-14 finished in 139 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction 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 5 rules applied. Total rules applied 5 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 10 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 11 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 11 place count 18 transition count 6
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 3 with 13 rules applied. Total rules applied 24 place count 11 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 28 place count 8 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 7 transition count 4
Applied a total of 29 rules in 117 ms. Remains 7 /25 variables (removed 18) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 7 cols
[2021-05-12 08:18:00] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 08:18:00] [INFO ] Implicit Places using invariants in 7 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 7 ms to find 1 implicit places.
[2021-05-12 08:18:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-12 08:18:00] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 08:18:00] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 6/25 places, 4/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2021-05-12 08:18:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-12 08:18:00] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 08:18:00] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 2 iterations. Remains : 6/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-02000-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT s2 s5) (GT 2 s3)), p1:(LEQ 3 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 858 reset in 71 ms.
Product exploration explored 100000 steps with 578 reset in 166 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 6 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)))), (F (OR (G p1) (G (NOT p1)))), p0, (NOT p1)]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 566 reset in 168 ms.
Product exploration explored 100000 steps with 540 reset in 85 ms.
[2021-05-12 08:18:01] [INFO ] Flatten gal took : 2 ms
[2021-05-12 08:18:01] [INFO ] Flatten gal took : 1 ms
[2021-05-12 08:18:01] [INFO ] Time to serialize gal into /tmp/LTL11605438406834808944.gal : 1 ms
[2021-05-12 08:18:01] [INFO ] Time to serialize properties into /tmp/LTL15692739627370676290.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/LTL11605438406834808944.gal, -t, CGAL, -LTL, /tmp/LTL15692739627370676290.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/LTL11605438406834808944.gal -t CGAL -LTL /tmp/LTL15692739627370676290.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("((p19>p25)||(p20<2))"))||(G(F("(p19>=3)"))))))
Formula 0 simplified : !F(G"((p19>p25)||(p20<2))" | GF"(p19>=3)")
Detected timeout of ITS tools.
[2021-05-12 08:18:16] [INFO ] Flatten gal took : 1 ms
[2021-05-12 08:18:16] [INFO ] Applying decomposition
[2021-05-12 08:18:16] [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/graph7138256054327161311.txt, -o, /tmp/graph7138256054327161311.bin, -w, /tmp/graph7138256054327161311.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/graph7138256054327161311.bin, -l, -1, -v, -w, /tmp/graph7138256054327161311.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 08:18:16] [INFO ] Decomposing Gal with order
[2021-05-12 08:18:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 08:18:16] [INFO ] Flatten gal took : 1 ms
[2021-05-12 08:18:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 08:18:16] [INFO ] Time to serialize gal into /tmp/LTL675291444184065275.gal : 0 ms
[2021-05-12 08:18:16] [INFO ] Time to serialize properties into /tmp/LTL12060684442362447178.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/LTL675291444184065275.gal, -t, CGAL, -LTL, /tmp/LTL12060684442362447178.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/LTL675291444184065275.gal -t CGAL -LTL /tmp/LTL12060684442362447178.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("((gu0.p19>gu0.p25)||(gu1.p20<2))"))||(G(F("(gu0.p19>=3)"))))))
Formula 0 simplified : !F(G"((gu0.p19>gu0.p25)||(gu1.p20<2))" | GF"(gu0.p19>=3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2620272191163538502
[2021-05-12 08:18:31] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2620272191163538502
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/ltsmin2620272191163538502]
Compilation finished in 86 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2620272191163538502]
Link finished in 30 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/ltsmin2620272191163538502]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HouseConstruction-PT-02000-15 finished in 45952 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16318926863611295929
[2021-05-12 08:18:46] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2021-05-12 08:18:46] [INFO ] Applying decomposition
[2021-05-12 08:18:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 08:18:46] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2021-05-12 08:18:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 08:18:46] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2021-05-12 08:18:46] [INFO ] Flatten gal took : 2 ms
[2021-05-12 08:18:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph13553296948179645594.txt, -o, /tmp/graph13553296948179645594.bin, -w, /tmp/graph13553296948179645594.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/graph13553296948179645594.bin, -l, -1, -v, -w, /tmp/graph13553296948179645594.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 08:18:46] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16318926863611295929
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/ltsmin16318926863611295929]
[2021-05-12 08:18:46] [INFO ] Decomposing Gal with order
[2021-05-12 08:18:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 08:18:46] [INFO ] Flatten gal took : 3 ms
[2021-05-12 08:18:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 08:18:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality9765764568920975266.gal : 1 ms
[2021-05-12 08:18:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality6300174867105190859.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/LTLCardinality9765764568920975266.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6300174867105190859.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/LTLCardinality9765764568920975266.gal -t CGAL -LTL /tmp/LTLCardinality6300174867105190859.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(!("((gu9.p19<=gu9.p25)&&(gi1.gi1.gu7.p20>=2))")))||(G(F("(gu9.p19>=3)"))))))
Formula 0 simplified : !F(G!"((gu9.p19<=gu9.p25)&&(gi1.gi1.gu7.p20>=2))" | GF"(gu9.p19>=3)")
Compilation finished in 151 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16318926863611295929]
Link finished in 30 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, -p, --pins-guards, --when, --ltl, <>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin16318926863611295929]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Initializing POR dependencies: labels 20, guards 18
pins2lts-mc-linux64( 4/ 8), 0.001: LTL layer: formula: <>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true)))))
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: "<>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed 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( 3/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.018: There are 21 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.018: State length is 26, there are 24 groups
pins2lts-mc-linux64( 0/ 8), 0.018: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.018: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.018: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.018: Visible groups: 4 / 24, labels: 2 / 21
pins2lts-mc-linux64( 0/ 8), 0.018: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.018: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.091: [Blue] ~120 levels ~960 states ~960 transitions
pins2lts-mc-linux64( 6/ 8), 0.090: [Blue] ~120 levels ~1920 states ~960 transitions
pins2lts-mc-linux64( 6/ 8), 0.136: [Blue] ~480 levels ~3840 states ~3840 transitions
pins2lts-mc-linux64( 2/ 8), 0.166: [Blue] ~960 levels ~7680 states ~7680 transitions
pins2lts-mc-linux64( 7/ 8), 0.189: [Blue] ~1920 levels ~15360 states ~15360 transitions
pins2lts-mc-linux64( 7/ 8), 0.198: [Blue] ~3840 levels ~30720 states ~30720 transitions
pins2lts-mc-linux64( 2/ 8), 0.221: [Blue] ~7680 levels ~61440 states ~61440 transitions
pins2lts-mc-linux64( 1/ 8), 0.261: [Blue] ~15360 levels ~122880 states ~122880 transitions
pins2lts-mc-linux64( 5/ 8), 0.353: [Blue] ~26586 levels ~245760 states ~383696 transitions
pins2lts-mc-linux64( 5/ 8), 0.467: [Blue] ~36001 levels ~491520 states ~888448 transitions
pins2lts-mc-linux64( 5/ 8), 0.947: [Blue] ~36001 levels ~983040 states ~2241104 transitions
pins2lts-mc-linux64( 0/ 8), 1.794: [Blue] ~35890 levels ~1966080 states ~3865848 transitions
pins2lts-mc-linux64( 0/ 8), 3.437: [Blue] ~35890 levels ~3932160 states ~7796528 transitions
pins2lts-mc-linux64( 0/ 8), 7.022: [Blue] ~35890 levels ~7864320 states ~15659040 transitions
pins2lts-mc-linux64( 0/ 8), 16.305: [Blue] ~35930 levels ~15728640 states ~36760968 transitions
pins2lts-mc-linux64( 1/ 8), 21.030: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 21.065:
pins2lts-mc-linux64( 0/ 8), 21.065: Explored 14428790 states 39942678 transitions, fanout: 2.768
pins2lts-mc-linux64( 0/ 8), 21.065: Total exploration time 21.010 sec (20.980 sec minimum, 20.991 sec on average)
pins2lts-mc-linux64( 0/ 8), 21.065: States per second: 686758, Transitions per second: 1901127
pins2lts-mc-linux64( 0/ 8), 21.065:
pins2lts-mc-linux64( 0/ 8), 21.065: State space has 11578241 states, 812982 are accepting
pins2lts-mc-linux64( 0/ 8), 21.065: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 21.065: blue states: 14428790 (124.62%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 21.065: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 21.065: all-red states: 1230205 (10.63%), bogus 1 (0.00%)
pins2lts-mc-linux64( 0/ 8), 21.065:
pins2lts-mc-linux64( 0/ 8), 21.065: Total memory used for local state coloring: 4.4MB
pins2lts-mc-linux64( 0/ 8), 21.065:
pins2lts-mc-linux64( 0/ 8), 21.066: Queue width: 8B, total height: 287897, memory: 2.20MB
pins2lts-mc-linux64( 0/ 8), 21.066: Tree memory: 344.3MB, 31.2 B/state, compr.: 29.4%
pins2lts-mc-linux64( 0/ 8), 21.066: Tree fill ratio (roots/leafs): 8.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 21.066: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 21.066: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 21.066: Est. total memory use: 346.5MB (~1026.2MB 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, -p, --pins-guards, --when, --ltl, <>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin16318926863611295929]
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, -p, --pins-guards, --when, --ltl, <>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin16318926863611295929]
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 08:39:36] [INFO ] Flatten gal took : 197 ms
[2021-05-12 08:39:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality6720271628774138173.gal : 59 ms
[2021-05-12 08:39:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality15810974170372634193.ltl : 8 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/LTLCardinality6720271628774138173.gal, -t, CGAL, -LTL, /tmp/LTLCardinality15810974170372634193.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/LTLCardinality6720271628774138173.gal -t CGAL -LTL /tmp/LTLCardinality15810974170372634193.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(!("((p19<=p25)&&(p20>=2))")))||(G(F("(p19>=3)"))))))
Formula 0 simplified : !F(G!"((p19<=p25)&&(p20>=2))" | GF"(p19>=3)")
Detected timeout of ITS tools.
[2021-05-12 09:00:27] [INFO ] Flatten gal took : 76 ms
[2021-05-12 09:00:27] [INFO ] Input system was already deterministic with 18 transitions.
[2021-05-12 09:00:27] [INFO ] Transformed 25 places.
[2021-05-12 09:00:27] [INFO ] Transformed 18 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-12 09:00:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality16216280630538983404.gal : 3 ms
[2021-05-12 09:00:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality5788243996428042834.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/LTLCardinality16216280630538983404.gal, -t, CGAL, -LTL, /tmp/LTLCardinality5788243996428042834.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/LTLCardinality16216280630538983404.gal -t CGAL -LTL /tmp/LTLCardinality5788243996428042834.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G(!("((p19<=p25)&&(p20>=2))")))||(G(F("(p19>=3)"))))))
Formula 0 simplified : !F(G!"((p19<=p25)&&(p20>=2))" | GF"(p19>=3)")

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

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