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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K 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 82K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 21:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 22 21:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 13K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HouseConstruction-PT-00005-00
FORMULA_NAME HouseConstruction-PT-00005-01
FORMULA_NAME HouseConstruction-PT-00005-02
FORMULA_NAME HouseConstruction-PT-00005-03
FORMULA_NAME HouseConstruction-PT-00005-04
FORMULA_NAME HouseConstruction-PT-00005-05
FORMULA_NAME HouseConstruction-PT-00005-06
FORMULA_NAME HouseConstruction-PT-00005-07
FORMULA_NAME HouseConstruction-PT-00005-08
FORMULA_NAME HouseConstruction-PT-00005-09
FORMULA_NAME HouseConstruction-PT-00005-10
FORMULA_NAME HouseConstruction-PT-00005-11
FORMULA_NAME HouseConstruction-PT-00005-12
FORMULA_NAME HouseConstruction-PT-00005-13
FORMULA_NAME HouseConstruction-PT-00005-14
FORMULA_NAME HouseConstruction-PT-00005-15

=== Now, execution of the tool begins

BK_START 1620794578117

Running Version 0
[2021-05-12 04:43:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-12 04:43:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 04:43:10] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-12 04:43:10] [INFO ] Transformed 26 places.
[2021-05-12 04:43:10] [INFO ] Transformed 18 transitions.
[2021-05-12 04:43:10] [INFO ] Parsed PT model containing 26 places and 18 transitions in 61 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 04:43:10] [INFO ] Initial state test concluded for 1 properties.
Support contains 20 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 9 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 04:43:10] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-12 04:43:10] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 04:43:10] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-12 04:43:10] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 04:43:10] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 04:43:10] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/26 places, 18/18 transitions.
[2021-05-12 04:43:10] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-12 04:43:10] [INFO ] Flatten gal took : 18 ms
FORMULA HouseConstruction-PT-00005-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00005-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 04:43:10] [INFO ] Flatten gal took : 4 ms
[2021-05-12 04:43:10] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 100002 steps, including 917 resets, run finished after 148 ms. (steps per millisecond=675 ) properties (out of 18) seen :17
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 04:43:10] [INFO ] Computed 7 place invariants in 6 ms
[2021-05-12 04:43:10] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-12 04:43:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 04:43:10] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-12 04:43:10] [INFO ] Computed and/alt/rep : 17/24/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 04:43:10] [INFO ] Added : 8 causal constraints over 2 iterations in 19 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(p0) U (p1||X((p2 U p3))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 04:43:11] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-12 04:43:11] [INFO ] Implicit Places using invariants in 25 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 27 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 04:43:11] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 04:43:11] [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 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 04:43:11] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 04:43:11] [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 234 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), true, (NOT p3)]
Running random walk in product with property : HouseConstruction-PT-00005-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s1 1), p0:(GEQ s3 1), p3:(AND (GEQ s11 1) (GEQ s1 1)), p2:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA HouseConstruction-PT-00005-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00005-00 finished in 353 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U (p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 14
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 21 transition count 14
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 21 transition count 9
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 19 place count 13 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 19 place count 13 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 10 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 7 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 6 transition count 5
Applied a total of 29 rules in 12 ms. Remains 6 /25 variables (removed 19) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 6 cols
[2021-05-12 04:43:11] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 04:43:11] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-12 04:43:11] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 04:43:11] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-12 04:43:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-12 04:43:11] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 04:43:11] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00005-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s5 1), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 29910 reset in 198 ms.
Product exploration explored 100000 steps with 30076 reset in 117 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 (NOT p1))), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 29997 reset in 66 ms.
Product exploration explored 100000 steps with 29790 reset in 66 ms.
[2021-05-12 04:43:12] [INFO ] Flatten gal took : 2 ms
[2021-05-12 04:43:12] [INFO ] Flatten gal took : 1 ms
[2021-05-12 04:43:12] [INFO ] Time to serialize gal into /tmp/LTL15988076962458413983.gal : 0 ms
[2021-05-12 04:43:12] [INFO ] Time to serialize properties into /tmp/LTL13247129057072028688.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/LTL15988076962458413983.gal, -t, CGAL, -LTL, /tmp/LTL13247129057072028688.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/LTL15988076962458413983.gal -t CGAL -LTL /tmp/LTL13247129057072028688.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(p16>=1)"))U(("(p16>=1)")||(G("(p17>=1)")))))
Formula 0 simplified : !(F"(p16>=1)" U ("(p16>=1)" | G"(p17>=1)"))
Reverse transition relation is NOT exact ! Due to transitions t14.t12.t15.t16.t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/4/1/5
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.027864,17028,1,0,68,1776,43,40,162,2276,124
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HouseConstruction-PT-00005-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property HouseConstruction-PT-00005-01 finished in 834 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X((G(p1) U p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
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 04:43:12] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 04:43:12] [INFO ] Implicit Places using invariants in 17 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 17 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 04:43:12] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 04:43:12] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 23/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 04:43:12] [INFO ] Computed 5 place invariants in 8 ms
[2021-05-12 04:43:12] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00005-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s14 1), p2:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1)), p1:(LT s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00005-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00005-02 finished in 297 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 24 transition count 13
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 20 transition count 13
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 20 transition count 8
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 13 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 12 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 12 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 10 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 29 place count 7 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 6 transition count 4
Applied a total of 30 rules in 6 ms. Remains 6 /25 variables (removed 19) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-12 04:43:12] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 04:43:12] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-12 04:43:12] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-12 04:43:12] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-12 04:43:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-12 04:43:12] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-12 04:43:12] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00005-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s2 1) (LT s3 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00005-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00005-03 finished in 178 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X((X(F(p2))||p1)))||p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
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 04:43:12] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 04:43:12] [INFO ] Implicit Places using invariants in 26 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 27 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 04:43:12] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 04:43:12] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 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 04:43:12] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 04:43:12] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HouseConstruction-PT-00005-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(OR (LT s2 1) (LT s4 1)), p1:(OR (LT s4 1) (LT s2 1)), p2:(LT s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 66 ms.
Product exploration explored 100000 steps with 50000 reset in 64 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (G p1)), (F (G p2)), p0, p1, p2]
Property proved to be true thanks to knowledge :(F (G p2))
FORMULA HouseConstruction-PT-00005-04 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-00005-04 finished in 457 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&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.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 04:43:13] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 04:43:13] [INFO ] Implicit Places using invariants in 39 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 40 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 04:43:13] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 04:43:13] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 04:43:13] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 04:43:13] [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 83 ms :[p0, true, true, true]
Running random walk in product with property : HouseConstruction-PT-00005-05 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LT s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3166 reset in 90 ms.
Product exploration explored 100000 steps with 3172 reset in 143 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), p0]
Stuttering acceptance computed with spot in 75 ms :[p0, true, true, true]
Product exploration explored 100000 steps with 3168 reset in 105 ms.
Product exploration explored 100000 steps with 3171 reset in 94 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 76 ms :[p0, true, true, true]
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 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 18
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 5 place count 21 transition count 21
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 21 transition count 21
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 18 transition count 17
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 18 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 18 transition count 17
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 17 transition count 16
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 17 transition count 16
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 21 rules in 6 ms. Remains 17 /21 variables (removed 4) and now considering 16/18 (removed 2) transitions.
[2021-05-12 04:43:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 17 cols
[2021-05-12 04:43:14] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 04:43:14] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17/21 places, 16/18 transitions.
Product exploration explored 100000 steps with 13025 reset in 237 ms.
Product exploration explored 100000 steps with 13010 reset in 131 ms.
[2021-05-12 04:43:14] [INFO ] Flatten gal took : 2 ms
[2021-05-12 04:43:14] [INFO ] Flatten gal took : 1 ms
[2021-05-12 04:43:14] [INFO ] Time to serialize gal into /tmp/LTL16353193496089891503.gal : 1 ms
[2021-05-12 04:43:14] [INFO ] Time to serialize properties into /tmp/LTL6588122279282419306.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/LTL16353193496089891503.gal, -t, CGAL, -LTL, /tmp/LTL6588122279282419306.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/LTL16353193496089891503.gal -t CGAL -LTL /tmp/LTL6588122279282419306.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(p18<1)")&&(X(F("(p18>=1)"))))))
Formula 0 simplified : !X("(p18<1)" & XF"(p18>=1)")
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
44 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.447203,31676,1,0,326,92505,61,201,607,92090,642
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HouseConstruction-PT-00005-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property HouseConstruction-PT-00005-05 finished in 1834 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(!p0)&&X(G((!p1&&X(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 14 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 04:43:14] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 04:43:14] [INFO ] Implicit Places using invariants in 20 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 27 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 04:43:15] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 04:43:15] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 04:43:15] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 04:43:15] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut11484979855577851343.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 10565 ms :[false, p0, (OR (NOT p2) p1), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HouseConstruction-PT-00005-06 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}]], initial=0, aps=[p0:(LT s4 1), p1:(LT s14 1), p2:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00005-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00005-06 finished in 10661 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G((F(p1)||(p0&&F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 24 transition count 13
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 20 transition count 13
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 20 transition count 9
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 19 place count 13 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 19 place count 13 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 11 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 26 place count 9 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 8 transition count 5
Applied a total of 27 rules in 3 ms. Remains 8 /25 variables (removed 17) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 8 cols
[2021-05-12 04:43:25] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 04:43:25] [INFO ] Implicit Places using invariants in 14 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 15 ms to find 2 implicit places.
[2021-05-12 04:43:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-12 04:43:25] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 04:43:25] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Starting structural reductions, iteration 1 : 6/25 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2021-05-12 04:43:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-12 04:43:25] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 04:43:25] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 2 iterations. Remains : 6/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00005-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LT s4 1), p1:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6329 reset in 187 ms.
Product exploration explored 100000 steps with 6272 reset in 157 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 p0)), (F (G p1)), p0, p1]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA HouseConstruction-PT-00005-07 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-00005-07 finished in 519 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(!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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 24 transition count 13
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 20 transition count 13
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 20 transition count 8
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 13 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 12 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 12 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 10 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 29 place count 7 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 6 transition count 4
Applied a total of 30 rules in 4 ms. Remains 6 /25 variables (removed 19) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-12 04:43:26] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 04:43:26] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-12 04:43:26] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-12 04:43:26] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2021-05-12 04:43:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-12 04:43:26] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-12 04:43:26] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 39 ms :[p0]
Running random walk in product with property : HouseConstruction-PT-00005-09 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s3 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15646 reset in 64 ms.
Product exploration explored 100000 steps with 15614 reset in 69 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 (G p0)), p0]
Stuttering acceptance computed with spot in 19 ms :[p0]
Product exploration explored 100000 steps with 15665 reset in 63 ms.
Product exploration explored 100000 steps with 15670 reset in 72 ms.
[2021-05-12 04:43:26] [INFO ] Flatten gal took : 1 ms
[2021-05-12 04:43:26] [INFO ] Flatten gal took : 1 ms
[2021-05-12 04:43:26] [INFO ] Time to serialize gal into /tmp/LTL763083989464275199.gal : 1 ms
[2021-05-12 04:43:26] [INFO ] Time to serialize properties into /tmp/LTL14295658630316059820.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/LTL763083989464275199.gal, -t, CGAL, -LTL, /tmp/LTL14295658630316059820.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/LTL763083989464275199.gal -t CGAL -LTL /tmp/LTL14295658630316059820.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(((p27>=1)&&(p26>=1))&&(p25>=1))")))
Formula 0 simplified : !F"(((p27>=1)&&(p26>=1))&&(p25>=1))"
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/3/1/4
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.014779,16252,1,0,68,1273,32,41,164,1708,124
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HouseConstruction-PT-00005-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property HouseConstruction-PT-00005-09 finished in 503 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 25 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 21 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 19 transition count 12
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 12 place count 19 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 21 place count 14 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 21 place count 14 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 24 place count 12 transition count 7
Applied a total of 24 rules in 3 ms. Remains 12 /25 variables (removed 13) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 12 cols
[2021-05-12 04:43:26] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 04:43:26] [INFO ] Implicit Places using invariants in 25 ms returned [2, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
[2021-05-12 04:43:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 10 cols
[2021-05-12 04:43:26] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 04:43:26] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 10/25 places, 7/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 6
Applied a total of 2 rules in 1 ms. Remains 9 /10 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 9 cols
[2021-05-12 04:43:26] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 04:43:26] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 6 rows 9 cols
[2021-05-12 04:43:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 04:43:26] [INFO ] Implicit Places using invariants and state equation in 9 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 : 9/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00005-11 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s1 1) (GEQ s0 1)), p0:(AND (GEQ s4 1) (GEQ s7 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00005-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00005-11 finished in 124 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 24 transition count 12
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 19 transition count 12
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 19 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 21 place count 12 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 21 place count 12 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 9 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 9 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 29 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 5 transition count 4
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 35 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 35 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 37 place count 2 transition count 2
Applied a total of 37 rules in 2 ms. Remains 2 /25 variables (removed 23) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 04:43:26] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 04:43:26] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 04:43:26] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 04:43:26] [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.
[2021-05-12 04:43:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-12 04:43:26] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 04:43:26] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/25 places, 2/18 transitions.
Stuttering acceptance computed with spot in 24 ms :[p0]
Running random walk in product with property : HouseConstruction-PT-00005-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00005-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00005-12 finished in 57 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 04:43:26] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 04:43:26] [INFO ] Implicit Places using invariants in 18 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 18 ms to find 4 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-12 04:43:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-12 04:43:26] [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 04:43:26] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-12 04:43:26] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00005-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s2 1), p1:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00005-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00005-13 finished in 135 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(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.
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 04:43:26] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 04:43:26] [INFO ] Implicit Places using invariants in 14 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 14 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 04:43:26] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 04:43:26] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 23/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-12 04:43:26] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 04:43:26] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 23/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 66 ms :[false, p0, false]
Running random walk in product with property : HouseConstruction-PT-00005-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1098 reset in 209 ms.
Product exploration explored 100000 steps with 1098 reset in 266 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA HouseConstruction-PT-00005-14 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property HouseConstruction-PT-00005-14 finished in 640 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&X(G((F(!p2)&&p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-12 04:43:27] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 04:43:27] [INFO ] Implicit Places using invariants in 15 ms returned [9, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 16 ms to find 3 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 04:43:27] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 04:43:27] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-12 04:43:27] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 04:43:27] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) (NOT p0) p2), (OR (NOT p1) (NOT p0) p2), (OR (NOT p1) p2), p2]
Running random walk in product with property : HouseConstruction-PT-00005-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s21 1), p1:(AND (GEQ s3 1) (GEQ s7 1)), p2:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00005-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00005-15 finished in 189 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620794609085

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HouseConstruction-PT-00005"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is HouseConstruction-PT-00005, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-162075406600149"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-00005.tgz
mv HouseConstruction-PT-00005 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;