Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r453-smll-167912645300300.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is SmartHome-PT-19, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912645300300
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 6.0K Feb 26 05:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 05:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 05:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 05:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 05:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 05:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 05:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 05:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 181K Mar 5 18:23 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 SmartHome-PT-19-LTLFireability-00
FORMULA_NAME SmartHome-PT-19-LTLFireability-01
FORMULA_NAME SmartHome-PT-19-LTLFireability-02
FORMULA_NAME SmartHome-PT-19-LTLFireability-03
FORMULA_NAME SmartHome-PT-19-LTLFireability-04
FORMULA_NAME SmartHome-PT-19-LTLFireability-05
FORMULA_NAME SmartHome-PT-19-LTLFireability-06
FORMULA_NAME SmartHome-PT-19-LTLFireability-07
FORMULA_NAME SmartHome-PT-19-LTLFireability-08
FORMULA_NAME SmartHome-PT-19-LTLFireability-09
FORMULA_NAME SmartHome-PT-19-LTLFireability-10
FORMULA_NAME SmartHome-PT-19-LTLFireability-11
FORMULA_NAME SmartHome-PT-19-LTLFireability-12
FORMULA_NAME SmartHome-PT-19-LTLFireability-13
FORMULA_NAME SmartHome-PT-19-LTLFireability-14
FORMULA_NAME SmartHome-PT-19-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679254371761

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-19
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 19:32:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 19:32:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:32:54] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2023-03-19 19:32:54] [INFO ] Transformed 741 places.
[2023-03-19 19:32:54] [INFO ] Transformed 809 transitions.
[2023-03-19 19:32:54] [INFO ] Found NUPN structural information;
[2023-03-19 19:32:54] [INFO ] Parsed PT model containing 741 places and 809 transitions and 1844 arcs in 335 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 227 places in 13 ms
Reduce places removed 227 places and 198 transitions.
FORMULA SmartHome-PT-19-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 611/611 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 495 transition count 611
Discarding 138 places :
Symmetric choice reduction at 1 with 138 rule applications. Total rules 157 place count 357 transition count 473
Iterating global reduction 1 with 138 rules applied. Total rules applied 295 place count 357 transition count 473
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 306 place count 357 transition count 462
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 333 place count 330 transition count 435
Iterating global reduction 2 with 27 rules applied. Total rules applied 360 place count 330 transition count 435
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 386 place count 304 transition count 409
Iterating global reduction 2 with 26 rules applied. Total rules applied 412 place count 304 transition count 409
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 414 place count 304 transition count 407
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 426 place count 292 transition count 395
Iterating global reduction 3 with 12 rules applied. Total rules applied 438 place count 292 transition count 395
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 440 place count 290 transition count 393
Iterating global reduction 3 with 2 rules applied. Total rules applied 442 place count 290 transition count 393
Applied a total of 442 rules in 138 ms. Remains 290 /514 variables (removed 224) and now considering 393/611 (removed 218) transitions.
// Phase 1: matrix 393 rows 290 cols
[2023-03-19 19:32:55] [INFO ] Computed 3 place invariants in 27 ms
[2023-03-19 19:32:55] [INFO ] Implicit Places using invariants in 701 ms returned []
[2023-03-19 19:32:55] [INFO ] Invariant cache hit.
[2023-03-19 19:32:56] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
[2023-03-19 19:32:56] [INFO ] Invariant cache hit.
[2023-03-19 19:32:56] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 290/514 places, 393/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1795 ms. Remains : 290/514 places, 393/611 transitions.
Support contains 27 out of 290 places after structural reductions.
[2023-03-19 19:32:57] [INFO ] Flatten gal took : 91 ms
[2023-03-19 19:32:57] [INFO ] Flatten gal took : 33 ms
[2023-03-19 19:32:57] [INFO ] Input system was already deterministic with 393 transitions.
Support contains 25 out of 290 places (down from 27) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 560 ms. (steps per millisecond=17 ) properties (out of 22) seen :21
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 19:32:57] [INFO ] Invariant cache hit.
[2023-03-19 19:32:57] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 48 stabilizing places and 47 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(p0))&&F(p1)))))'
Support contains 3 out of 290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 393/393 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 283 transition count 386
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 283 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 283 transition count 385
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 278 transition count 380
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 278 transition count 380
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 273 transition count 375
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 273 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 273 transition count 374
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 272 transition count 373
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 272 transition count 373
Applied a total of 38 rules in 77 ms. Remains 272 /290 variables (removed 18) and now considering 373/393 (removed 20) transitions.
// Phase 1: matrix 373 rows 272 cols
[2023-03-19 19:32:58] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-19 19:32:58] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-19 19:32:58] [INFO ] Invariant cache hit.
[2023-03-19 19:32:58] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-19 19:32:58] [INFO ] Invariant cache hit.
[2023-03-19 19:32:59] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/290 places, 373/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 753 ms. Remains : 272/290 places, 373/393 transitions.
Stuttering acceptance computed with spot in 546 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}]], initial=0, aps=[p1:(EQ s4 0), p0:(OR (EQ s140 0) (EQ s235 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 543 ms.
Product exploration explored 100000 steps with 25000 reset in 333 ms.
Computed a total of 37 stabilizing places and 36 stable transitions
Computed a total of 37 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 211 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 29 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 19:33:01] [INFO ] Invariant cache hit.
[2023-03-19 19:33:01] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 19:33:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-19 19:33:01] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:33:01] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 19:33:01] [INFO ] After 269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-19 19:33:01] [INFO ] After 454ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 373/373 transitions.
Graph (trivial) has 292 edges and 272 vertex of which 170 / 272 are part of one of the 15 SCC in 4 ms
Free SCC test removed 155 places
Drop transitions removed 234 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 243 transitions.
Graph (complete) has 187 edges and 117 vertex of which 108 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 108 transition count 83
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 44 rules applied. Total rules applied 89 place count 67 transition count 80
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 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 2 with 4 rules applied. Total rules applied 93 place count 65 transition count 78
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 95 place count 64 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 96 place count 63 transition count 77
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 96 place count 63 transition count 73
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 104 place count 59 transition count 73
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 107 place count 56 transition count 70
Iterating global reduction 5 with 3 rules applied. Total rules applied 110 place count 56 transition count 70
Performed 30 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 170 place count 26 transition count 37
Drop transitions removed 18 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 46 edges and 26 vertex of which 19 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 20 rules applied. Total rules applied 190 place count 19 transition count 18
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 192 place count 19 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 193 place count 18 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 194 place count 17 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 196 place count 15 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 196 place count 15 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 200 place count 13 transition count 13
Applied a total of 200 rules in 41 ms. Remains 13 /272 variables (removed 259) and now considering 13/373 (removed 360) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 13/272 places, 13/373 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 273 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 293 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 373/373 transitions.
Applied a total of 0 rules in 5 ms. Remains 272 /272 variables (removed 0) and now considering 373/373 (removed 0) transitions.
[2023-03-19 19:33:02] [INFO ] Invariant cache hit.
[2023-03-19 19:33:02] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-19 19:33:02] [INFO ] Invariant cache hit.
[2023-03-19 19:33:03] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-19 19:33:03] [INFO ] Invariant cache hit.
[2023-03-19 19:33:03] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 624 ms. Remains : 272/272 places, 373/373 transitions.
Computed a total of 37 stabilizing places and 36 stable transitions
Computed a total of 37 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 27 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 19:33:04] [INFO ] Invariant cache hit.
[2023-03-19 19:33:04] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 19:33:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 19:33:04] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 19:33:04] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 19:33:04] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-19 19:33:04] [INFO ] After 260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 54 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=54 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 320 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 449 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 231 ms.
Product exploration explored 100000 steps with 25000 reset in 391 ms.
Applying partial POR strategy [false, false, false, true, false, true]
Stuttering acceptance computed with spot in 300 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 373/373 transitions.
Graph (trivial) has 292 edges and 272 vertex of which 170 / 272 are part of one of the 15 SCC in 3 ms
Free SCC test removed 155 places
Ensure Unique test removed 213 transitions
Reduce isomorphic transitions removed 213 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 117 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 117 transition count 159
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 40 place count 117 transition count 159
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 117 transition count 159
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 71 place count 90 transition count 127
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 98 place count 90 transition count 127
Performed 37 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 2 with 37 rules applied. Total rules applied 135 place count 90 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 138 place count 90 transition count 123
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 163 place count 65 transition count 86
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 3 with 25 rules applied. Total rules applied 188 place count 65 transition count 86
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 193 place count 60 transition count 81
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 198 place count 60 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 199 place count 60 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 200 place count 60 transition count 80
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 202 place count 58 transition count 78
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 204 place count 58 transition count 78
Deduced a syphon composed of 30 places in 0 ms
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 216 place count 58 transition count 66
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 167 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 218 place count 56 transition count 65
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 220 place count 54 transition count 61
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 222 place count 54 transition count 61
Deduced a syphon composed of 29 places in 0 ms
Applied a total of 222 rules in 75 ms. Remains 54 /272 variables (removed 218) and now considering 61/373 (removed 312) transitions.
[2023-03-19 19:33:07] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-19 19:33:07] [INFO ] Flow matrix only has 56 transitions (discarded 5 similar events)
// Phase 1: matrix 56 rows 54 cols
[2023-03-19 19:33:07] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 19:33:07] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/272 places, 61/373 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 54/272 places, 61/373 transitions.
Built C files in :
/tmp/ltsmin15997138228206788273
[2023-03-19 19:33:07] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15997138228206788273
Running compilation step : cd /tmp/ltsmin15997138228206788273;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 903 ms.
Running link step : cd /tmp/ltsmin15997138228206788273;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin15997138228206788273;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3198458674407007171.hoa' '--buchi-type=spotba'
LTSmin run took 735 ms.
FORMULA SmartHome-PT-19-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SmartHome-PT-19-LTLFireability-00 finished in 10683 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 393/393 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 282 transition count 385
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 282 transition count 385
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 282 transition count 383
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 277 transition count 378
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 277 transition count 378
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 272 transition count 373
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 272 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 272 transition count 372
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 271 transition count 371
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 271 transition count 371
Applied a total of 41 rules in 47 ms. Remains 271 /290 variables (removed 19) and now considering 371/393 (removed 22) transitions.
// Phase 1: matrix 371 rows 271 cols
[2023-03-19 19:33:09] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-19 19:33:09] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-19 19:33:09] [INFO ] Invariant cache hit.
[2023-03-19 19:33:09] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2023-03-19 19:33:09] [INFO ] Invariant cache hit.
[2023-03-19 19:33:09] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 271/290 places, 371/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 651 ms. Remains : 271/290 places, 371/393 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s178 1) (EQ s42 1) (EQ s250 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 235 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-19-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-04 finished in 766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U (p1||G(p2)))&&G(F(!p1))))'
Support contains 3 out of 290 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 290/290 places, 393/393 transitions.
Graph (trivial) has 310 edges and 290 vertex of which 164 / 290 are part of one of the 14 SCC in 1 ms
Free SCC test removed 150 places
Ensure Unique test removed 205 transitions
Reduce isomorphic transitions removed 205 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 139 transition count 136
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 56 rules applied. Total rules applied 108 place count 88 transition count 131
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 114 place count 85 transition count 128
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 117 place count 83 transition count 127
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 117 place count 83 transition count 124
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 123 place count 80 transition count 124
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 128 place count 75 transition count 119
Iterating global reduction 4 with 5 rules applied. Total rules applied 133 place count 75 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 135 place count 75 transition count 117
Performed 40 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 215 place count 35 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 216 place count 35 transition count 72
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 220 place count 31 transition count 56
Iterating global reduction 6 with 4 rules applied. Total rules applied 224 place count 31 transition count 56
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 239 place count 31 transition count 41
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 241 place count 29 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 241 place count 29 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 243 place count 28 transition count 40
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 245 place count 26 transition count 36
Iterating global reduction 7 with 2 rules applied. Total rules applied 247 place count 26 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 248 place count 25 transition count 35
Applied a total of 248 rules in 31 ms. Remains 25 /290 variables (removed 265) and now considering 35/393 (removed 358) transitions.
[2023-03-19 19:33:09] [INFO ] Flow matrix only has 28 transitions (discarded 7 similar events)
// Phase 1: matrix 28 rows 25 cols
[2023-03-19 19:33:09] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 19:33:09] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 19:33:09] [INFO ] Flow matrix only has 28 transitions (discarded 7 similar events)
[2023-03-19 19:33:09] [INFO ] Invariant cache hit.
[2023-03-19 19:33:09] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-19 19:33:09] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-19 19:33:09] [INFO ] Flow matrix only has 28 transitions (discarded 7 similar events)
[2023-03-19 19:33:09] [INFO ] Invariant cache hit.
[2023-03-19 19:33:09] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/290 places, 35/393 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 171 ms. Remains : 25/290 places, 35/393 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p2) p1), (NOT p0), (AND (NOT p1) (NOT p2)), p1, p1, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s4 1), p2:(NEQ s6 1), p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-19-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-05 finished in 455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(F(p0)) U p1))))'
Support contains 2 out of 290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 393/393 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 283 transition count 386
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 283 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 283 transition count 385
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 278 transition count 380
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 278 transition count 380
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 273 transition count 375
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 273 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 273 transition count 374
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 272 transition count 373
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 272 transition count 373
Applied a total of 38 rules in 33 ms. Remains 272 /290 variables (removed 18) and now considering 373/393 (removed 20) transitions.
// Phase 1: matrix 373 rows 272 cols
[2023-03-19 19:33:10] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-19 19:33:10] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-19 19:33:10] [INFO ] Invariant cache hit.
[2023-03-19 19:33:10] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2023-03-19 19:33:10] [INFO ] Invariant cache hit.
[2023-03-19 19:33:10] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/290 places, 373/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 612 ms. Remains : 272/290 places, 373/393 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s4 1), p0:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 809 steps with 40 reset in 2 ms.
FORMULA SmartHome-PT-19-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-07 finished in 854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U X(G(!p2))))'
Support contains 4 out of 290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 393/393 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 282 transition count 385
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 282 transition count 385
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 282 transition count 383
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 277 transition count 378
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 277 transition count 378
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 272 transition count 373
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 272 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 272 transition count 372
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 271 transition count 371
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 271 transition count 371
Applied a total of 41 rules in 22 ms. Remains 271 /290 variables (removed 19) and now considering 371/393 (removed 22) transitions.
// Phase 1: matrix 371 rows 271 cols
[2023-03-19 19:33:11] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-19 19:33:11] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-19 19:33:11] [INFO ] Invariant cache hit.
[2023-03-19 19:33:11] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2023-03-19 19:33:11] [INFO ] Invariant cache hit.
[2023-03-19 19:33:11] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 271/290 places, 371/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 801 ms. Remains : 271/290 places, 371/393 transitions.
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) p2), (AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s170 1), p0:(EQ s49 1), p2:(AND (EQ s49 1) (EQ s76 1) (EQ s250 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 40041 reset in 267 ms.
Product exploration explored 100000 steps with 40053 reset in 417 ms.
Computed a total of 37 stabilizing places and 36 stable transitions
Computed a total of 37 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1104 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) p2), (AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 30 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 19:33:14] [INFO ] Invariant cache hit.
[2023-03-19 19:33:14] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p1) p2)), (F p2), (F p1), (F (AND (NOT p0) p1 (NOT p2))), (F p0)]
Knowledge based reduction with 18 factoid took 1359 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 371/371 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 371/371 (removed 0) transitions.
[2023-03-19 19:33:16] [INFO ] Invariant cache hit.
[2023-03-19 19:33:16] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-19 19:33:16] [INFO ] Invariant cache hit.
[2023-03-19 19:33:16] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2023-03-19 19:33:16] [INFO ] Invariant cache hit.
[2023-03-19 19:33:17] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 849 ms. Remains : 271/271 places, 371/371 transitions.
Computed a total of 37 stabilizing places and 36 stable transitions
Computed a total of 37 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT p2)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 413 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 26 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 5) seen :3
Finished Best-First random walk after 2400 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=342 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT p2)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND p2 (NOT p1))), (F p2), (F p1)]
Knowledge based reduction with 8 factoid took 464 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 33382 reset in 149 ms.
Product exploration explored 100000 steps with 33178 reset in 156 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 371/371 transitions.
Graph (trivial) has 290 edges and 271 vertex of which 166 / 271 are part of one of the 15 SCC in 1 ms
Free SCC test removed 151 places
Ensure Unique test removed 206 transitions
Reduce isomorphic transitions removed 206 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 120 transition count 165
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 39 place count 120 transition count 165
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 120 transition count 165
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 63 place count 98 transition count 139
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 85 place count 98 transition count 139
Performed 40 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 125 place count 98 transition count 136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 129 place count 98 transition count 132
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 158 place count 69 transition count 94
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 187 place count 69 transition count 94
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 190 place count 66 transition count 91
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 193 place count 66 transition count 91
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 195 place count 66 transition count 91
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 199 place count 62 transition count 87
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 203 place count 62 transition count 87
Deduced a syphon composed of 30 places in 0 ms
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 210 place count 62 transition count 80
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 209 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 2 with 2 rules applied. Total rules applied 212 place count 60 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 214 place count 58 transition count 75
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 216 place count 58 transition count 75
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 216 rules in 33 ms. Remains 58 /271 variables (removed 213) and now considering 75/371 (removed 296) transitions.
[2023-03-19 19:33:19] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-19 19:33:19] [INFO ] Flow matrix only has 62 transitions (discarded 13 similar events)
// Phase 1: matrix 62 rows 58 cols
[2023-03-19 19:33:19] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 19:33:20] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/271 places, 75/371 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 171 ms. Remains : 58/271 places, 75/371 transitions.
Built C files in :
/tmp/ltsmin14836982105549577379
[2023-03-19 19:33:20] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14836982105549577379
Running compilation step : cd /tmp/ltsmin14836982105549577379;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 789 ms.
Running link step : cd /tmp/ltsmin14836982105549577379;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin14836982105549577379;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6365814048248981280.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 371/371 transitions.
Applied a total of 0 rules in 4 ms. Remains 271 /271 variables (removed 0) and now considering 371/371 (removed 0) transitions.
// Phase 1: matrix 371 rows 271 cols
[2023-03-19 19:33:35] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-19 19:33:35] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-19 19:33:35] [INFO ] Invariant cache hit.
[2023-03-19 19:33:35] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2023-03-19 19:33:35] [INFO ] Invariant cache hit.
[2023-03-19 19:33:35] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 731 ms. Remains : 271/271 places, 371/371 transitions.
Built C files in :
/tmp/ltsmin18445189969831262231
[2023-03-19 19:33:36] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18445189969831262231
Running compilation step : cd /tmp/ltsmin18445189969831262231;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 997 ms.
Running link step : cd /tmp/ltsmin18445189969831262231;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin18445189969831262231;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased237977003504045894.hoa' '--buchi-type=spotba'
LTSmin run took 8480 ms.
FORMULA SmartHome-PT-19-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SmartHome-PT-19-LTLFireability-08 finished in 34475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 290 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 290/290 places, 393/393 transitions.
Graph (trivial) has 312 edges and 290 vertex of which 177 / 290 are part of one of the 16 SCC in 1 ms
Free SCC test removed 161 places
Ensure Unique test removed 219 transitions
Reduce isomorphic transitions removed 219 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 128 transition count 129
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 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 1 with 46 rules applied. Total rules applied 91 place count 84 transition count 127
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 83 transition count 125
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 98 place count 81 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 99 place count 80 transition count 123
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 99 place count 80 transition count 119
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 107 place count 76 transition count 119
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 115 place count 68 transition count 106
Iterating global reduction 5 with 8 rules applied. Total rules applied 123 place count 68 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 125 place count 68 transition count 104
Performed 35 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 195 place count 33 transition count 66
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 197 place count 31 transition count 58
Iterating global reduction 6 with 2 rules applied. Total rules applied 199 place count 31 transition count 58
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 216 place count 31 transition count 41
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 218 place count 29 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 218 place count 29 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 220 place count 28 transition count 40
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 222 place count 26 transition count 36
Iterating global reduction 7 with 2 rules applied. Total rules applied 224 place count 26 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 225 place count 25 transition count 35
Applied a total of 225 rules in 25 ms. Remains 25 /290 variables (removed 265) and now considering 35/393 (removed 358) transitions.
[2023-03-19 19:33:45] [INFO ] Flow matrix only has 27 transitions (discarded 8 similar events)
// Phase 1: matrix 27 rows 25 cols
[2023-03-19 19:33:45] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 19:33:45] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-19 19:33:45] [INFO ] Flow matrix only has 27 transitions (discarded 8 similar events)
[2023-03-19 19:33:45] [INFO ] Invariant cache hit.
[2023-03-19 19:33:45] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-19 19:33:45] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-19 19:33:45] [INFO ] Flow matrix only has 27 transitions (discarded 8 similar events)
[2023-03-19 19:33:45] [INFO ] Invariant cache hit.
[2023-03-19 19:33:45] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/290 places, 35/393 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 155 ms. Remains : 25/290 places, 35/393 transitions.
Stuttering acceptance computed with spot in 40 ms :[p0]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 1) (EQ s4 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 9 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-19-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-10 finished in 210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 290 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 290/290 places, 393/393 transitions.
Graph (trivial) has 314 edges and 290 vertex of which 191 / 290 are part of one of the 16 SCC in 1 ms
Free SCC test removed 175 places
Ensure Unique test removed 238 transitions
Reduce isomorphic transitions removed 238 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 114 transition count 118
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 78 transition count 118
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 73 place count 78 transition count 113
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 83 place count 73 transition count 113
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 90 place count 66 transition count 101
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 66 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 66 transition count 99
Performed 33 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 165 place count 33 transition count 65
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 168 place count 30 transition count 53
Iterating global reduction 3 with 3 rules applied. Total rules applied 171 place count 30 transition count 53
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 186 place count 30 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 187 place count 29 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 187 place count 29 transition count 37
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 189 place count 28 transition count 37
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 191 place count 26 transition count 33
Iterating global reduction 4 with 2 rules applied. Total rules applied 193 place count 26 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 194 place count 25 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 195 place count 24 transition count 32
Applied a total of 195 rules in 23 ms. Remains 24 /290 variables (removed 266) and now considering 32/393 (removed 361) transitions.
[2023-03-19 19:33:45] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
// Phase 1: matrix 25 rows 24 cols
[2023-03-19 19:33:45] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 19:33:45] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 19:33:45] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
[2023-03-19 19:33:45] [INFO ] Invariant cache hit.
[2023-03-19 19:33:45] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-19 19:33:45] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-19 19:33:45] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
[2023-03-19 19:33:45] [INFO ] Invariant cache hit.
[2023-03-19 19:33:45] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/290 places, 32/393 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 202 ms. Remains : 24/290 places, 32/393 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s7 0), p0:(EQ s2 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-19-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-11 finished in 320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)||X((!F(p0) U p1))))'
Support contains 2 out of 290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 393/393 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 283 transition count 386
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 283 transition count 386
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 283 transition count 384
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 279 transition count 380
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 279 transition count 380
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 275 transition count 376
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 275 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 275 transition count 375
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 274 transition count 374
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 274 transition count 374
Applied a total of 35 rules in 19 ms. Remains 274 /290 variables (removed 16) and now considering 374/393 (removed 19) transitions.
// Phase 1: matrix 374 rows 274 cols
[2023-03-19 19:33:46] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-19 19:33:46] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-19 19:33:46] [INFO ] Invariant cache hit.
[2023-03-19 19:33:46] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-19 19:33:46] [INFO ] Invariant cache hit.
[2023-03-19 19:33:46] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 274/290 places, 374/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 592 ms. Remains : 274/290 places, 374/393 transitions.
Stuttering acceptance computed with spot in 367 ms :[p0, true, (OR (NOT p1) p0), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(EQ s128 1), p1:(EQ s59 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 583 steps with 1 reset in 2 ms.
FORMULA SmartHome-PT-19-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-13 finished in 980 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&G(p1)))&&F(p2)))'
Support contains 3 out of 290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 393/393 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 283 transition count 386
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 283 transition count 386
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 283 transition count 384
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 279 transition count 380
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 279 transition count 380
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 275 transition count 376
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 275 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 275 transition count 375
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 274 transition count 374
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 274 transition count 374
Applied a total of 35 rules in 17 ms. Remains 274 /290 variables (removed 16) and now considering 374/393 (removed 19) transitions.
// Phase 1: matrix 374 rows 274 cols
[2023-03-19 19:33:47] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-19 19:33:47] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-19 19:33:47] [INFO ] Invariant cache hit.
[2023-03-19 19:33:47] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2023-03-19 19:33:47] [INFO ] Invariant cache hit.
[2023-03-19 19:33:47] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 274/290 places, 374/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 631 ms. Remains : 274/290 places, 374/393 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s236 1), p0:(EQ s72 0), p1:(EQ s88 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 SmartHome-PT-19-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-14 finished in 862 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 290/290 places, 393/393 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 283 transition count 386
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 283 transition count 386
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 283 transition count 384
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 279 transition count 380
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 279 transition count 380
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 275 transition count 376
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 275 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 275 transition count 375
Applied a total of 33 rules in 18 ms. Remains 275 /290 variables (removed 15) and now considering 375/393 (removed 18) transitions.
// Phase 1: matrix 375 rows 275 cols
[2023-03-19 19:33:47] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-19 19:33:48] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-19 19:33:48] [INFO ] Invariant cache hit.
[2023-03-19 19:33:48] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-19 19:33:48] [INFO ] Invariant cache hit.
[2023-03-19 19:33:48] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/290 places, 375/393 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 580 ms. Remains : 275/290 places, 375/393 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-19-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s150 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-19-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLFireability-15 finished in 682 ms.
All properties solved by simple procedures.
Total runtime 54229 ms.

BK_STOP 1679254429565

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="SmartHome-PT-19"
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-5348"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-19, 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 r453-smll-167912645300300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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