Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 469K Apr 30 09:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.8M Apr 30 09:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 30 09:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.6M Apr 30 09:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 194K May 9 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 782K May 9 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 362K May 9 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 970K May 9 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 9 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 48K May 9 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 17M May 10 09:33 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 FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-00
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-01
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-02
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-03
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-04
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-05
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-06
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-07
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-08
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-09
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-10
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-11
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-12
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-13
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-14
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652725716358

Running Version 202205111006
[2022-05-16 18:28:37] [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]
[2022-05-16 18:28:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 18:28:38] [INFO ] Load time of PNML (sax parser for PT used): 735 ms
[2022-05-16 18:28:38] [INFO ] Transformed 40605 places.
[2022-05-16 18:28:38] [INFO ] Transformed 36871 transitions.
[2022-05-16 18:28:38] [INFO ] Parsed PT model containing 40605 places and 36871 transitions in 989 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 72 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 31 places and 0 transitions.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11642 out of 40574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40574/40574 places, 36871/36871 transitions.
Reduce places removed 341 places and 0 transitions.
Discarding 3333 places :
Implicit places reduction removed 3333 places
Iterating post reduction 0 with 3674 rules applied. Total rules applied 3674 place count 36900 transition count 36871
Applied a total of 3674 rules in 857 ms. Remains 36900 /40574 variables (removed 3674) and now considering 36871/36871 (removed 0) transitions.
// Phase 1: matrix 36871 rows 36900 cols
[2022-05-16 18:28:43] [INFO ] Computed 5257 place invariants in 3107 ms
[2022-05-16 18:28:46] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:28:46] [INFO ] Implicit Places using invariants in 6165 ms returned []
Implicit Place search using SMT only with invariants took 6190 ms to find 0 implicit places.
// Phase 1: matrix 36871 rows 36900 cols
[2022-05-16 18:28:49] [INFO ] Computed 5257 place invariants in 2968 ms
[2022-05-16 18:28:51] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:28:52] [INFO ] Dead Transitions using invariants and state equation in 5817 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36900/40574 places, 36871/36871 transitions.
Finished structural reductions, in 1 iterations. Remains : 36900/40574 places, 36871/36871 transitions.
Support contains 11642 out of 36900 places after structural reductions.
[2022-05-16 18:28:53] [INFO ] Flatten gal took : 1354 ms
[2022-05-16 18:28:55] [INFO ] Flatten gal took : 1105 ms
[2022-05-16 18:28:57] [INFO ] Input system was already deterministic with 36871 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1227 ms. (steps per millisecond=8 ) properties (out of 32) seen :16
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 36871 rows 36900 cols
[2022-05-16 18:29:02] [INFO ] Computed 5257 place invariants in 2994 ms
[2022-05-16 18:29:22] [INFO ] [Real]Absence check using 0 positive and 5257 generalized place invariants in 6734 ms returned sat
[2022-05-16 18:29:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 18:29:27] [INFO ] After 25098ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1135 out of 36900 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 36900/36900 places, 36871/36871 transitions.
Graph (complete) has 54944 edges and 36900 vertex of which 36291 are kept as prefixes of interest. Removing 609 places using SCC suffix rule.59 ms
Discarding 609 places :
Also discarding 509 output transitions
Drop transitions removed 509 transitions
Ensure Unique test removed 300 transitions
Reduce isomorphic transitions removed 300 transitions.
Discarding 3333 places :
Implicit places reduction removed 3333 places
Drop transitions removed 18962 transitions
Trivial Post-agglo rules discarded 18962 transitions
Performed 18962 trivial Post agglomeration. Transition count delta: 18962
Iterating post reduction 0 with 22595 rules applied. Total rules applied 22596 place count 32958 transition count 17100
Reduce places removed 18962 places and 0 transitions.
Performed 322 Post agglomeration using F-continuation condition.Transition count delta: 322
Iterating post reduction 1 with 19284 rules applied. Total rules applied 41880 place count 13996 transition count 16778
Reduce places removed 322 places and 0 transitions.
Iterating post reduction 2 with 322 rules applied. Total rules applied 42202 place count 13674 transition count 16778
Performed 1808 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1808 Pre rules applied. Total rules applied 42202 place count 13674 transition count 14970
Deduced a syphon composed of 1808 places in 15 ms
Ensure Unique test removed 901 places
Reduce places removed 2709 places and 0 transitions.
Iterating global reduction 3 with 4517 rules applied. Total rules applied 46719 place count 10965 transition count 14970
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 3 with 703 rules applied. Total rules applied 47422 place count 10963 transition count 14269
Reduce places removed 701 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 703 rules applied. Total rules applied 48125 place count 10262 transition count 14267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 48127 place count 10260 transition count 14267
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 48127 place count 10260 transition count 14265
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 48131 place count 10258 transition count 14265
Discarding 4241 places :
Symmetric choice reduction at 6 with 4241 rule applications. Total rules 52372 place count 6017 transition count 10024
Iterating global reduction 6 with 4241 rules applied. Total rules applied 56613 place count 6017 transition count 10024
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 802 transitions
Trivial Post-agglo rules discarded 802 transitions
Performed 802 trivial Post agglomeration. Transition count delta: 802
Iterating post reduction 6 with 1509 rules applied. Total rules applied 58122 place count 5815 transition count 8717
Reduce places removed 802 places and 0 transitions.
Iterating post reduction 7 with 802 rules applied. Total rules applied 58924 place count 5013 transition count 8717
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 105 Pre rules applied. Total rules applied 58924 place count 5013 transition count 8612
Deduced a syphon composed of 105 places in 5 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 8 with 210 rules applied. Total rules applied 59134 place count 4908 transition count 8612
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 59148 place count 4894 transition count 7198
Iterating global reduction 8 with 14 rules applied. Total rules applied 59162 place count 4894 transition count 7198
Ensure Unique test removed 403 transitions
Reduce isomorphic transitions removed 403 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 8 with 605 rules applied. Total rules applied 59767 place count 4793 transition count 6694
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 9 with 101 rules applied. Total rules applied 59868 place count 4692 transition count 6694
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 101 Pre rules applied. Total rules applied 59868 place count 4692 transition count 6593
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 10 with 202 rules applied. Total rules applied 60070 place count 4591 transition count 6593
Discarding 1008 places :
Symmetric choice reduction at 10 with 1008 rule applications. Total rules 61078 place count 3583 transition count 5585
Iterating global reduction 10 with 1008 rules applied. Total rules applied 62086 place count 3583 transition count 5585
Ensure Unique test removed 1008 transitions
Reduce isomorphic transitions removed 1008 transitions.
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 10 with 1206 rules applied. Total rules applied 63292 place count 3484 transition count 4478
Reduce places removed 99 places and 0 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Iterating post reduction 11 with 198 rules applied. Total rules applied 63490 place count 3385 transition count 4379
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 12 with 99 rules applied. Total rules applied 63589 place count 3286 transition count 4379
Performed 304 Post agglomeration using F-continuation condition.Transition count delta: 304
Deduced a syphon composed of 304 places in 2 ms
Ensure Unique test removed 200 places
Reduce places removed 504 places and 0 transitions.
Iterating global reduction 13 with 808 rules applied. Total rules applied 64397 place count 2782 transition count 4075
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 198
Deduced a syphon composed of 198 places in 1 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 13 with 396 rules applied. Total rules applied 64793 place count 2584 transition count 3877
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 64795 place count 2583 transition count 3881
Free-agglomeration rule (complex) applied 708 times.
Iterating global reduction 13 with 708 rules applied. Total rules applied 65503 place count 2583 transition count 3648
Ensure Unique test removed 201 places
Reduce places removed 909 places and 0 transitions.
Iterating post reduction 13 with 909 rules applied. Total rules applied 66412 place count 1674 transition count 3648
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 66412 place count 1674 transition count 3647
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 66414 place count 1673 transition count 3647
Applied a total of 66414 rules in 4846 ms. Remains 1673 /36900 variables (removed 35227) and now considering 3647/36871 (removed 33224) transitions.
Finished structural reductions, in 1 iterations. Remains : 1673/36900 places, 3647/36871 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 16) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3647 rows 1673 cols
[2022-05-16 18:29:33] [INFO ] Computed 118 place invariants in 49 ms
[2022-05-16 18:29:33] [INFO ] [Real]Absence check using 0 positive and 118 generalized place invariants in 55 ms returned sat
[2022-05-16 18:29:34] [INFO ] After 1205ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2022-05-16 18:29:35] [INFO ] After 1671ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 265 ms.
[2022-05-16 18:29:35] [INFO ] After 2323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 235 steps, including 0 resets, run visited all 2 properties in 14 ms. (steps per millisecond=16 )
Parikh walk visited 3 properties in 45 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 36900 stabilizing places and 36871 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 36900 transition count 36871
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 101 out of 36900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36900/36900 places, 36871/36871 transitions.
Discarding 3333 places :
Implicit places reduction removed 3333 places
Iterating post reduction 0 with 3333 rules applied. Total rules applied 3333 place count 33567 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 3535 place count 33365 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 3737 place count 33365 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3739 place count 33363 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 3741 place count 33363 transition count 36265
Applied a total of 3741 rules in 729 ms. Remains 33363 /36900 variables (removed 3537) and now considering 36265/36871 (removed 606) transitions.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:29:38] [INFO ] Computed 1924 place invariants in 1412 ms
[2022-05-16 18:29:40] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:29:40] [INFO ] Implicit Places using invariants in 3940 ms returned []
Implicit Place search using SMT only with invariants took 3941 ms to find 0 implicit places.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:29:42] [INFO ] Computed 1924 place invariants in 1426 ms
[2022-05-16 18:29:44] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:29:44] [INFO ] Dead Transitions using invariants and state equation in 4017 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33363/36900 places, 36265/36871 transitions.
Finished structural reductions, in 1 iterations. Remains : 33363/36900 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-00 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:(OR (GEQ s25265 1) (GEQ s25196 1) (GEQ s25261 1) (GEQ s25200 1) (GEQ s25257 1) (GEQ s25188 1) (GEQ s25253 1) (GEQ s25192 1) (GEQ s25249 1) (GEQ s25180 ...], 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 6 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-00 finished in 9036 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p1)||(G(p2)&&F(G(p3))))&&p0)))'
Support contains 4040 out of 36900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36900/36900 places, 36871/36871 transitions.
Graph (complete) has 54944 edges and 36900 vertex of which 31125 are kept as prefixes of interest. Removing 5775 places using SCC suffix rule.72 ms
Discarding 5775 places :
Also discarding 6773 output transitions
Drop transitions removed 6773 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 2222 places :
Implicit places reduction removed 2222 places
Drop transitions removed 11009 transitions
Trivial Post-agglo rules discarded 11009 transitions
Performed 11009 trivial Post agglomeration. Transition count delta: 11009
Iterating post reduction 0 with 13231 rules applied. Total rules applied 13232 place count 28802 transition count 18988
Reduce places removed 11009 places and 0 transitions.
Performed 1111 Post agglomeration using F-continuation condition.Transition count delta: 1111
Iterating post reduction 1 with 12120 rules applied. Total rules applied 25352 place count 17793 transition count 17877
Reduce places removed 1111 places and 0 transitions.
Iterating post reduction 2 with 1111 rules applied. Total rules applied 26463 place count 16682 transition count 17877
Performed 707 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 707 Pre rules applied. Total rules applied 26463 place count 16682 transition count 17170
Deduced a syphon composed of 707 places in 14 ms
Reduce places removed 707 places and 0 transitions.
Iterating global reduction 3 with 1414 rules applied. Total rules applied 27877 place count 15975 transition count 17170
Discarding 606 places :
Implicit places reduction removed 606 places
Performed 606 Post agglomeration using F-continuation condition.Transition count delta: 606
Iterating post reduction 3 with 1212 rules applied. Total rules applied 29089 place count 15369 transition count 16564
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 4 with 606 rules applied. Total rules applied 29695 place count 14763 transition count 16564
Discarding 3535 places :
Symmetric choice reduction at 5 with 3535 rule applications. Total rules 33230 place count 11228 transition count 13029
Iterating global reduction 5 with 3535 rules applied. Total rules applied 36765 place count 11228 transition count 13029
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 5 with 1313 rules applied. Total rules applied 38078 place count 11026 transition count 11918
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 6 with 606 rules applied. Total rules applied 38684 place count 10420 transition count 11918
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 101 Pre rules applied. Total rules applied 38684 place count 10420 transition count 11817
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 7 with 202 rules applied. Total rules applied 38886 place count 10319 transition count 11817
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 38901 place count 10304 transition count 10302
Iterating global reduction 7 with 15 rules applied. Total rules applied 38916 place count 10304 transition count 10302
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 7 with 303 rules applied. Total rules applied 39219 place count 10102 transition count 10201
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 8 with 101 rules applied. Total rules applied 39320 place count 10001 transition count 10201
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 202 Pre rules applied. Total rules applied 39320 place count 10001 transition count 9999
Deduced a syphon composed of 202 places in 3 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 9 with 404 rules applied. Total rules applied 39724 place count 9799 transition count 9999
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 39926 place count 9698 transition count 9898
Applied a total of 39926 rules in 6757 ms. Remains 9698 /36900 variables (removed 27202) and now considering 9898/36871 (removed 26973) transitions.
// Phase 1: matrix 9898 rows 9698 cols
[2022-05-16 18:29:52] [INFO ] Computed 1315 place invariants in 289 ms
[2022-05-16 18:29:52] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:29:53] [INFO ] Implicit Places using invariants in 1194 ms returned []
// Phase 1: matrix 9898 rows 9698 cols
[2022-05-16 18:29:53] [INFO ] Computed 1315 place invariants in 282 ms
[2022-05-16 18:29:54] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:29:54] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 2357 ms to find 0 implicit places.
[2022-05-16 18:29:55] [INFO ] Redundant transitions in 1338 ms returned []
// Phase 1: matrix 9898 rows 9698 cols
[2022-05-16 18:29:55] [INFO ] Computed 1315 place invariants in 306 ms
[2022-05-16 18:29:56] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:29:56] [INFO ] Dead Transitions using invariants and state equation in 1190 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9698/36900 places, 9898/36871 transitions.
Finished structural reductions, in 1 iterations. Remains : 9698/36900 places, 9898/36871 transitions.
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=0 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=0 dest: 3}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 5}], [{ cond=(OR (AND (NOT p0) p3) (AND (NOT p1) p3)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1 p3), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1 (NOT p3)), acceptance={1} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=2 dest: 0}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=2 dest: 3}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={1} source=3 dest: 3}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p3), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p1 p3), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=5 dest: 3}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (OR (LT s3142 1) (LT s5364 1)) (OR (LT s2550 1) (LT s4772 1)) (OR (LT s2555 1) (LT s4777 1)) (OR (LT s3147 1) (LT s5369 1)) (OR (LT s2545 1) (LT s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1313 steps with 0 reset in 194 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-01 finished in 12231 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0)))&&X(F(p1)))))'
Support contains 707 out of 36900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36900/36900 places, 36871/36871 transitions.
Discarding 3333 places :
Implicit places reduction removed 3333 places
Iterating post reduction 0 with 3333 rules applied. Total rules applied 3333 place count 33567 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 3535 place count 33365 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 3737 place count 33365 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3739 place count 33363 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 3741 place count 33363 transition count 36265
Applied a total of 3741 rules in 748 ms. Remains 33363 /36900 variables (removed 3537) and now considering 36265/36871 (removed 606) transitions.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:29:59] [INFO ] Computed 1924 place invariants in 1435 ms
[2022-05-16 18:30:02] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:30:02] [INFO ] Implicit Places using invariants in 4037 ms returned []
Implicit Place search using SMT only with invariants took 4038 ms to find 0 implicit places.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:30:03] [INFO ] Computed 1924 place invariants in 1454 ms
[2022-05-16 18:30:06] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:30:06] [INFO ] Dead Transitions using invariants and state equation in 4043 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33363/36900 places, 36265/36871 transitions.
Finished structural reductions, in 1 iterations. Remains : 33363/36900 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(OR (GEQ s20968 1) (GEQ s20972 1) (GEQ s20960 1) (GEQ s21025 1) (GEQ s20964 1) (GEQ s20952 1) (GEQ s21017 1) (GEQ s20956 1) (GEQ s21021 1) (GEQ s20944 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-02 finished in 9147 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(F((X(p1)||X(F(p2)))))&&p0)))))'
Support contains 1821 out of 36900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36900/36900 places, 36871/36871 transitions.
Discarding 3333 places :
Implicit places reduction removed 3333 places
Iterating post reduction 0 with 3333 rules applied. Total rules applied 3333 place count 33567 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 3535 place count 33365 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 3737 place count 33365 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3739 place count 33363 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 3741 place count 33363 transition count 36265
Applied a total of 3741 rules in 740 ms. Remains 33363 /36900 variables (removed 3537) and now considering 36265/36871 (removed 606) transitions.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:30:08] [INFO ] Computed 1924 place invariants in 1415 ms
[2022-05-16 18:30:11] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:30:11] [INFO ] Implicit Places using invariants in 3991 ms returned []
Implicit Place search using SMT only with invariants took 3992 ms to find 0 implicit places.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:30:12] [INFO ] Computed 1924 place invariants in 1426 ms
[2022-05-16 18:30:15] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:30:15] [INFO ] Dead Transitions using invariants and state equation in 4093 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33363/36900 places, 36265/36871 transitions.
Finished structural reductions, in 1 iterations. Remains : 33363/36900 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s14410 1) (LT s16671 1)) (OR (LT s14366 1) (LT s16672 1)) (OR (LT s14420 1) (LT s16673 1)) (OR (LT s14351 1) (LT s16673 1)) (OR (LT s14439...], 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]]
Product exploration explored 100000 steps with 25 reset in 6741 ms.
Product exploration explored 100000 steps with 24 reset in 6823 ms.
Computed a total of 33363 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33363 transition count 36265
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND p0 p2 (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p0)), (F (G p0)), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 270 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 133606 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133606 steps, saw 132300 distinct states, run finished after 3003 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:31:14] [INFO ] Computed 1924 place invariants in 1417 ms
[2022-05-16 18:31:21] [INFO ] [Real]Absence check using 0 positive and 1924 generalized place invariants in 2410 ms returned sat
[2022-05-16 18:31:21] [INFO ] After 7755ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 18:31:29] [INFO ] [Nat]Absence check using 0 positive and 1924 generalized place invariants in 2506 ms returned sat
[2022-05-16 18:31:47] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 104 out of 33363 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 33363/33363 places, 36265/36265 transitions.
Graph (complete) has 47470 edges and 33363 vertex of which 31740 are kept as prefixes of interest. Removing 1623 places using SCC suffix rule.14 ms
Discarding 1623 places :
Also discarding 1521 output transitions
Drop transitions removed 1521 transitions
Drop transitions removed 18988 transitions
Trivial Post-agglo rules discarded 18988 transitions
Performed 18988 trivial Post agglomeration. Transition count delta: 18988
Iterating post reduction 0 with 18988 rules applied. Total rules applied 18989 place count 31740 transition count 15756
Reduce places removed 18988 places and 0 transitions.
Iterating post reduction 1 with 18988 rules applied. Total rules applied 37977 place count 12752 transition count 15756
Performed 1818 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1818 Pre rules applied. Total rules applied 37977 place count 12752 transition count 13938
Deduced a syphon composed of 1818 places in 7 ms
Ensure Unique test removed 909 places
Reduce places removed 2727 places and 0 transitions.
Iterating global reduction 2 with 4545 rules applied. Total rules applied 42522 place count 10025 transition count 13938
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 2 with 707 rules applied. Total rules applied 43229 place count 10025 transition count 13231
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 3 with 707 rules applied. Total rules applied 43936 place count 9318 transition count 13231
Discarding 4545 places :
Symmetric choice reduction at 4 with 4545 rule applications. Total rules 48481 place count 4773 transition count 8686
Iterating global reduction 4 with 4545 rules applied. Total rules applied 53026 place count 4773 transition count 8686
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 808 transitions
Trivial Post-agglo rules discarded 808 transitions
Performed 808 trivial Post agglomeration. Transition count delta: 808
Iterating post reduction 4 with 1515 rules applied. Total rules applied 54541 place count 4571 transition count 7373
Reduce places removed 808 places and 0 transitions.
Iterating post reduction 5 with 808 rules applied. Total rules applied 55349 place count 3763 transition count 7373
Discarding 520 places :
Symmetric choice reduction at 6 with 520 rule applications. Total rules 55869 place count 3243 transition count 5353
Iterating global reduction 6 with 520 rules applied. Total rules applied 56389 place count 3243 transition count 5353
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 303 places :
Implicit places reduction removed 303 places
Drop transitions removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 6 with 1111 rules applied. Total rules applied 57500 place count 2940 transition count 4545
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 7 with 303 rules applied. Total rules applied 57803 place count 2637 transition count 4545
Performed 303 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 303 Pre rules applied. Total rules applied 57803 place count 2637 transition count 4242
Deduced a syphon composed of 303 places in 1 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 8 with 606 rules applied. Total rules applied 58409 place count 2334 transition count 4242
Discarding 1015 places :
Symmetric choice reduction at 8 with 1015 rule applications. Total rules 59424 place count 1319 transition count 2727
Iterating global reduction 8 with 1015 rules applied. Total rules applied 60439 place count 1319 transition count 2727
Ensure Unique test removed 1515 transitions
Reduce isomorphic transitions removed 1515 transitions.
Discarding 303 places :
Implicit places reduction removed 303 places
Drop transitions removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 8 with 2121 rules applied. Total rules applied 62560 place count 1016 transition count 909
Reduce places removed 303 places and 0 transitions.
Iterating post reduction 9 with 303 rules applied. Total rules applied 62863 place count 713 transition count 909
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 101 Pre rules applied. Total rules applied 62863 place count 713 transition count 808
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 10 with 202 rules applied. Total rules applied 63065 place count 612 transition count 808
Free-agglomeration rule (complex) applied 101 times.
Iterating global reduction 10 with 101 rules applied. Total rules applied 63166 place count 612 transition count 707
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 10 with 101 rules applied. Total rules applied 63267 place count 511 transition count 707
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 11 with 101 rules applied. Total rules applied 63368 place count 410 transition count 606
Applied a total of 63368 rules in 2265 ms. Remains 410 /33363 variables (removed 32953) and now considering 606/36265 (removed 35659) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/33363 places, 606/36265 transitions.
Finished random walk after 65 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p0)), (F (G p0)), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 6 factoid took 297 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 104 out of 33363 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 33363/33363 places, 36265/36265 transitions.
Applied a total of 0 rules in 183 ms. Remains 33363 /33363 variables (removed 0) and now considering 36265/36265 (removed 0) transitions.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:31:51] [INFO ] Computed 1924 place invariants in 1463 ms
[2022-05-16 18:31:53] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:31:54] [INFO ] Implicit Places using invariants in 3978 ms returned []
Implicit Place search using SMT only with invariants took 3979 ms to find 0 implicit places.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:31:55] [INFO ] Computed 1924 place invariants in 1423 ms
[2022-05-16 18:31:57] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:31:58] [INFO ] Dead Transitions using invariants and state equation in 3996 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 33363/33363 places, 36265/36265 transitions.
Computed a total of 33363 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33363 transition count 36265
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3202 steps, including 0 resets, run visited all 1 properties in 126 ms. (steps per millisecond=25 )
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 3689 steps with 0 reset in 193 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-03 finished in 154564 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (p0 U p1))))'
Support contains 4444 out of 36900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36900/36900 places, 36871/36871 transitions.
Discarding 1111 places :
Implicit places reduction removed 1111 places
Iterating post reduction 0 with 1111 rules applied. Total rules applied 1111 place count 35789 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 1313 place count 35587 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 1515 place count 35587 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1517 place count 35585 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 1519 place count 35585 transition count 36265
Applied a total of 1519 rules in 688 ms. Remains 35585 /36900 variables (removed 1315) and now considering 36265/36871 (removed 606) transitions.
// Phase 1: matrix 36265 rows 35585 cols
[2022-05-16 18:32:44] [INFO ] Computed 4146 place invariants in 2402 ms
[2022-05-16 18:32:46] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:32:46] [INFO ] Implicit Places using invariants in 5054 ms returned []
Implicit Place search using SMT only with invariants took 5055 ms to find 0 implicit places.
// Phase 1: matrix 36265 rows 35585 cols
[2022-05-16 18:32:49] [INFO ] Computed 4146 place invariants in 2432 ms
[2022-05-16 18:32:51] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:32:51] [INFO ] Dead Transitions using invariants and state equation in 5153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 35585/36900 places, 36265/36871 transitions.
Finished structural reductions, in 1 iterations. Remains : 35585/36900 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s19992 1) (GEQ s22416 1)) (AND (GEQ s20022 1) (GEQ s22446 1)) (AND (GEQ s19420 1) (GEQ s21844 1)) (AND (GEQ s19430 1) (GEQ s21854 1)) (AN...], 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 2 steps with 0 reset in 3 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-04 finished in 11201 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 101 out of 36900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36900/36900 places, 36871/36871 transitions.
Graph (complete) has 54944 edges and 36900 vertex of which 31125 are kept as prefixes of interest. Removing 5775 places using SCC suffix rule.61 ms
Discarding 5775 places :
Also discarding 6773 output transitions
Drop transitions removed 6773 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 3333 places :
Implicit places reduction removed 3333 places
Drop transitions removed 18281 transitions
Trivial Post-agglo rules discarded 18281 transitions
Performed 18281 trivial Post agglomeration. Transition count delta: 18281
Iterating post reduction 0 with 21614 rules applied. Total rules applied 21615 place count 27691 transition count 11716
Reduce places removed 18281 places and 0 transitions.
Iterating post reduction 1 with 18281 rules applied. Total rules applied 39896 place count 9410 transition count 11716
Performed 1313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1313 Pre rules applied. Total rules applied 39896 place count 9410 transition count 10403
Deduced a syphon composed of 1313 places in 4 ms
Ensure Unique test removed 606 places
Reduce places removed 1919 places and 0 transitions.
Iterating global reduction 2 with 3232 rules applied. Total rules applied 43128 place count 7491 transition count 10403
Drop transitions removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 2 with 606 rules applied. Total rules applied 43734 place count 7491 transition count 9797
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 3 with 606 rules applied. Total rules applied 44340 place count 6885 transition count 9797
Discarding 3535 places :
Symmetric choice reduction at 4 with 3535 rule applications. Total rules 47875 place count 3350 transition count 6262
Iterating global reduction 4 with 3535 rules applied. Total rules applied 51410 place count 3350 transition count 6262
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 4 with 1313 rules applied. Total rules applied 52723 place count 3148 transition count 5151
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 5 with 606 rules applied. Total rules applied 53329 place count 2542 transition count 5151
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 101 Pre rules applied. Total rules applied 53329 place count 2542 transition count 5050
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 53531 place count 2441 transition count 5050
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 53546 place count 2426 transition count 3535
Iterating global reduction 6 with 15 rules applied. Total rules applied 53561 place count 2426 transition count 3535
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 303 places :
Implicit places reduction removed 303 places
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 6 with 1010 rules applied. Total rules applied 54571 place count 2123 transition count 2828
Reduce places removed 202 places and 0 transitions.
Iterating post reduction 7 with 202 rules applied. Total rules applied 54773 place count 1921 transition count 2828
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 202 Pre rules applied. Total rules applied 54773 place count 1921 transition count 2626
Deduced a syphon composed of 202 places in 1 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 8 with 404 rules applied. Total rules applied 55177 place count 1719 transition count 2626
Discarding 1010 places :
Symmetric choice reduction at 8 with 1010 rule applications. Total rules 56187 place count 709 transition count 1616
Iterating global reduction 8 with 1010 rules applied. Total rules applied 57197 place count 709 transition count 1616
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 8 with 1010 rules applied. Total rules applied 58207 place count 709 transition count 606
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 101 Pre rules applied. Total rules applied 58207 place count 709 transition count 505
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 9 with 303 rules applied. Total rules applied 58510 place count 507 transition count 505
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 9 with 101 rules applied. Total rules applied 58611 place count 406 transition count 404
Applied a total of 58611 rules in 1656 ms. Remains 406 /36900 variables (removed 36494) and now considering 404/36871 (removed 36467) transitions.
// Phase 1: matrix 404 rows 406 cols
[2022-05-16 18:32:53] [INFO ] Computed 2 place invariants in 7 ms
[2022-05-16 18:32:54] [INFO ] Implicit Places using invariants in 177 ms returned [101, 102]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 179 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/36900 places, 404/36871 transitions.
Reduce places removed 101 places and 101 transitions.
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 101 Pre rules applied. Total rules applied 0 place count 303 transition count 202
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 0 with 202 rules applied. Total rules applied 202 place count 202 transition count 202
Applied a total of 202 rules in 13 ms. Remains 202 /404 variables (removed 202) and now considering 202/404 (removed 202) transitions.
// Phase 1: matrix 202 rows 202 cols
[2022-05-16 18:32:54] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 18:32:54] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 202 rows 202 cols
[2022-05-16 18:32:54] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 18:32:54] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 202/36900 places, 202/36871 transitions.
Finished structural reductions, in 2 iterations. Remains : 202/36900 places, 202/36871 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s191 1) (GEQ s126 1) (GEQ s195 1) (GEQ s130 1) (GEQ s199 1) (GEQ s134 1) (GEQ s138 1) (GEQ s175 1) (GEQ s110 1) (GEQ s179 1) (GEQ s114 1) (GEQ...], 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 50000 reset in 647 ms.
Product exploration explored 100000 steps with 50000 reset in 682 ms.
Computed a total of 202 stabilizing places and 202 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 202 transition count 202
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(NOT p0), (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-06 finished in 3510 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)&&G(X(p1))))||G(p2)))'
Support contains 404 out of 36900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36900/36900 places, 36871/36871 transitions.
Graph (complete) has 54944 edges and 36900 vertex of which 36288 are kept as prefixes of interest. Removing 612 places using SCC suffix rule.35 ms
Discarding 612 places :
Also discarding 511 output transitions
Drop transitions removed 511 transitions
Ensure Unique test removed 303 transitions
Reduce isomorphic transitions removed 303 transitions.
Discarding 3333 places :
Implicit places reduction removed 3333 places
Drop transitions removed 19897 transitions
Trivial Post-agglo rules discarded 19897 transitions
Performed 19897 trivial Post agglomeration. Transition count delta: 19897
Iterating post reduction 0 with 23533 rules applied. Total rules applied 23534 place count 32955 transition count 16160
Reduce places removed 19897 places and 0 transitions.
Iterating post reduction 1 with 19897 rules applied. Total rules applied 43431 place count 13058 transition count 16160
Performed 1818 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1818 Pre rules applied. Total rules applied 43431 place count 13058 transition count 14342
Deduced a syphon composed of 1818 places in 8 ms
Ensure Unique test removed 909 places
Reduce places removed 2727 places and 0 transitions.
Iterating global reduction 2 with 4545 rules applied. Total rules applied 47976 place count 10331 transition count 14342
Drop transitions removed 707 transitions
Trivial Post-agglo rules discarded 707 transitions
Performed 707 trivial Post agglomeration. Transition count delta: 707
Iterating post reduction 2 with 707 rules applied. Total rules applied 48683 place count 10331 transition count 13635
Reduce places removed 707 places and 0 transitions.
Iterating post reduction 3 with 707 rules applied. Total rules applied 49390 place count 9624 transition count 13635
Discarding 4747 places :
Symmetric choice reduction at 4 with 4747 rule applications. Total rules 54137 place count 4877 transition count 8888
Iterating global reduction 4 with 4747 rules applied. Total rules applied 58884 place count 4877 transition count 8888
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 808 transitions
Trivial Post-agglo rules discarded 808 transitions
Performed 808 trivial Post agglomeration. Transition count delta: 808
Iterating post reduction 4 with 1515 rules applied. Total rules applied 60399 place count 4675 transition count 7575
Reduce places removed 808 places and 0 transitions.
Iterating post reduction 5 with 808 rules applied. Total rules applied 61207 place count 3867 transition count 7575
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 202 Pre rules applied. Total rules applied 61207 place count 3867 transition count 7373
Deduced a syphon composed of 202 places in 2 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 6 with 404 rules applied. Total rules applied 61611 place count 3665 transition count 7373
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 61631 place count 3645 transition count 5353
Iterating global reduction 6 with 20 rules applied. Total rules applied 61651 place count 3645 transition count 5353
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Discarding 404 places :
Implicit places reduction removed 404 places
Drop transitions removed 404 transitions
Trivial Post-agglo rules discarded 404 transitions
Performed 404 trivial Post agglomeration. Transition count delta: 404
Iterating post reduction 6 with 1818 rules applied. Total rules applied 63469 place count 3241 transition count 3939
Reduce places removed 404 places and 0 transitions.
Iterating post reduction 7 with 404 rules applied. Total rules applied 63873 place count 2837 transition count 3939
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 202 Pre rules applied. Total rules applied 63873 place count 2837 transition count 3737
Deduced a syphon composed of 202 places in 1 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 8 with 404 rules applied. Total rules applied 64277 place count 2635 transition count 3737
Discarding 1010 places :
Symmetric choice reduction at 8 with 1010 rule applications. Total rules 65287 place count 1625 transition count 2727
Iterating global reduction 8 with 1010 rules applied. Total rules applied 66297 place count 1625 transition count 2727
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 8 with 1212 rules applied. Total rules applied 67509 place count 1524 transition count 1616
Reduce places removed 101 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 9 with 202 rules applied. Total rules applied 67711 place count 1423 transition count 1515
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 10 with 101 rules applied. Total rules applied 67812 place count 1322 transition count 1515
Performed 202 Post agglomeration using F-continuation condition.Transition count delta: 202
Deduced a syphon composed of 202 places in 1 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 11 with 404 rules applied. Total rules applied 68216 place count 1120 transition count 1313
Applied a total of 68216 rules in 2251 ms. Remains 1120 /36900 variables (removed 35780) and now considering 1313/36871 (removed 35558) transitions.
// Phase 1: matrix 1313 rows 1120 cols
[2022-05-16 18:32:58] [INFO ] Computed 207 place invariants in 19 ms
[2022-05-16 18:32:58] [INFO ] Implicit Places using invariants in 715 ms returned [101, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 714, 1018]
Discarding 205 places :
Implicit Place search using SMT only with invariants took 718 ms to find 205 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 915/36900 places, 1313/36871 transitions.
Drop transitions removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 202 rules applied. Total rules applied 202 place count 915 transition count 1111
Reduce places removed 202 places and 0 transitions.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Iterating post reduction 1 with 303 rules applied. Total rules applied 505 place count 713 transition count 1010
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 2 with 101 rules applied. Total rules applied 606 place count 612 transition count 1010
Applied a total of 606 rules in 19 ms. Remains 612 /915 variables (removed 303) and now considering 1010/1313 (removed 303) transitions.
// Phase 1: matrix 1010 rows 612 cols
[2022-05-16 18:32:58] [INFO ] Computed 2 place invariants in 8 ms
[2022-05-16 18:32:58] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 1010 rows 612 cols
[2022-05-16 18:32:58] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-16 18:32:59] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 612/36900 places, 1010/36871 transitions.
Finished structural reductions, in 2 iterations. Remains : 612/36900 places, 1010/36871 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={1} source=1 dest: 2}, { cond=p0, acceptance={0, 1} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 1}, { cond=p0, acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 2}, { cond=p1, acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(OR (GEQ s362 1) (GEQ s587 1) (GEQ s406 1) (GEQ s391 1) (GEQ s602 1) (GEQ s464 1) (GEQ s377 1) (GEQ s449 1) (GEQ s478 1) (GEQ s529 1) (GEQ s515 1) (GEQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 110 steps with 0 reset in 8 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-07 finished in 3864 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(X(F(p0)))))&&!(X(p1) U p2)))'
Support contains 7 out of 36900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36900/36900 places, 36871/36871 transitions.
Discarding 3333 places :
Implicit places reduction removed 3333 places
Iterating post reduction 0 with 3333 rules applied. Total rules applied 3333 place count 33567 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 3535 place count 33365 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 3737 place count 33365 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3739 place count 33363 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 3741 place count 33363 transition count 36265
Applied a total of 3741 rules in 664 ms. Remains 33363 /36900 variables (removed 3537) and now considering 36265/36871 (removed 606) transitions.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:33:01] [INFO ] Computed 1924 place invariants in 1443 ms
[2022-05-16 18:33:04] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:33:04] [INFO ] Implicit Places using invariants in 4033 ms returned []
Implicit Place search using SMT only with invariants took 4034 ms to find 0 implicit places.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:33:05] [INFO ] Computed 1924 place invariants in 1437 ms
[2022-05-16 18:33:08] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:33:08] [INFO ] Dead Transitions using invariants and state equation in 4052 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33363/36900 places, 36265/36871 transitions.
Finished structural reductions, in 1 iterations. Remains : 33363/36900 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) p2), true, (OR (NOT p0) (AND p1 p2)), (NOT p0), (AND p2 p1), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(AND p2 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s30730 1), p1:(AND (GEQ s6906 1) (GEQ s2034 1)), p0:(OR (LT s79 1) (LT s180 1) (LT s281 1) (LT s382 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 8750 ms.
Product exploration explored 100000 steps with 25000 reset in 8728 ms.
Computed a total of 33363 stabilizing places and 36265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 33363 transition count 36265
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (OR (NOT p2) (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (NOT (AND p2 p1)))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 10 factoid took 240 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-09 finished in 66373 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 2 out of 36900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36900/36900 places, 36871/36871 transitions.
Graph (complete) has 54944 edges and 36900 vertex of which 30233 are kept as prefixes of interest. Removing 6667 places using SCC suffix rule.34 ms
Discarding 6667 places :
Also discarding 7568 output transitions
Drop transitions removed 7568 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 3333 places :
Implicit places reduction removed 3333 places
Drop transitions removed 18280 transitions
Trivial Post-agglo rules discarded 18280 transitions
Performed 18280 trivial Post agglomeration. Transition count delta: 18280
Iterating post reduction 0 with 21613 rules applied. Total rules applied 21614 place count 26799 transition count 10922
Reduce places removed 18280 places and 0 transitions.
Iterating post reduction 1 with 18280 rules applied. Total rules applied 39894 place count 8519 transition count 10922
Performed 1418 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1418 Pre rules applied. Total rules applied 39894 place count 8519 transition count 9504
Deduced a syphon composed of 1418 places in 4 ms
Ensure Unique test removed 609 places
Reduce places removed 2027 places and 0 transitions.
Iterating global reduction 2 with 3445 rules applied. Total rules applied 43339 place count 6492 transition count 9504
Drop transitions removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 2 with 606 rules applied. Total rules applied 43945 place count 6492 transition count 8898
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 3 with 606 rules applied. Total rules applied 44551 place count 5886 transition count 8898
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 44551 place count 5886 transition count 8897
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 44553 place count 5885 transition count 8897
Discarding 3134 places :
Symmetric choice reduction at 4 with 3134 rule applications. Total rules 47687 place count 2751 transition count 5268
Iterating global reduction 4 with 3134 rules applied. Total rules applied 50821 place count 2751 transition count 5268
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 503 transitions
Trivial Post-agglo rules discarded 503 transitions
Performed 503 trivial Post agglomeration. Transition count delta: 503
Iterating post reduction 4 with 1210 rules applied. Total rules applied 52031 place count 2549 transition count 4260
Reduce places removed 503 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 504 rules applied. Total rules applied 52535 place count 2046 transition count 4259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 52536 place count 2045 transition count 4259
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 52536 place count 2045 transition count 4257
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 52540 place count 2043 transition count 4257
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 52555 place count 2028 transition count 3237
Iterating global reduction 7 with 15 rules applied. Total rules applied 52570 place count 2028 transition count 3237
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 203 places :
Implicit places reduction removed 203 places
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 7 with 908 rules applied. Total rules applied 53478 place count 1825 transition count 2532
Reduce places removed 200 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 201 rules applied. Total rules applied 53679 place count 1625 transition count 2531
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 53680 place count 1624 transition count 2531
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 103 Pre rules applied. Total rules applied 53680 place count 1624 transition count 2428
Deduced a syphon composed of 103 places in 1 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 10 with 206 rules applied. Total rules applied 53886 place count 1521 transition count 2428
Discarding 1109 places :
Symmetric choice reduction at 10 with 1109 rule applications. Total rules 54995 place count 412 transition count 1319
Iterating global reduction 10 with 1109 rules applied. Total rules applied 56104 place count 412 transition count 1319
Ensure Unique test removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Iterating post reduction 10 with 1010 rules applied. Total rules applied 57114 place count 412 transition count 309
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 101 Pre rules applied. Total rules applied 57114 place count 412 transition count 208
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 101 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 11 with 303 rules applied. Total rules applied 57417 place count 210 transition count 208
Discarding 98 places :
Symmetric choice reduction at 11 with 98 rule applications. Total rules 57515 place count 112 transition count 110
Iterating global reduction 11 with 98 rules applied. Total rules applied 57613 place count 112 transition count 110
Discarding 98 places :
Symmetric choice reduction at 11 with 98 rule applications. Total rules 57711 place count 14 transition count 12
Iterating global reduction 11 with 98 rules applied. Total rules applied 57809 place count 14 transition count 12
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 11 with 3 rules applied. Total rules applied 57812 place count 11 transition count 9
Applied a total of 57812 rules in 1518 ms. Remains 11 /36900 variables (removed 36889) and now considering 9/36871 (removed 36862) transitions.
// Phase 1: matrix 9 rows 11 cols
[2022-05-16 18:34:07] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 18:34:07] [INFO ] Implicit Places using invariants in 24 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/36900 places, 9/36871 transitions.
Graph (complete) has 7 edges and 9 vertex of which 7 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 2 places and 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 4 transition count 4
Applied a total of 3 rules in 4 ms. Remains 4 /9 variables (removed 5) and now considering 4/9 (removed 5) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 18:34:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 18:34:07] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 18:34:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 18:34:07] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/36900 places, 4/36871 transitions.
Finished structural reductions, in 2 iterations. Remains : 4/36900 places, 4/36871 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s1 1), p1:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-10 finished in 1730 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(G(p0)))||F(p1))))'
Support contains 5 out of 36900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36900/36900 places, 36871/36871 transitions.
Graph (complete) has 54944 edges and 36900 vertex of which 30232 are kept as prefixes of interest. Removing 6668 places using SCC suffix rule.34 ms
Discarding 6668 places :
Also discarding 7569 output transitions
Drop transitions removed 7569 transitions
Reduce places removed 101 places and 101 transitions.
Discarding 3333 places :
Implicit places reduction removed 3333 places
Drop transitions removed 18279 transitions
Trivial Post-agglo rules discarded 18279 transitions
Performed 18279 trivial Post agglomeration. Transition count delta: 18279
Iterating post reduction 0 with 21612 rules applied. Total rules applied 21613 place count 26798 transition count 10922
Reduce places removed 18279 places and 0 transitions.
Iterating post reduction 1 with 18279 rules applied. Total rules applied 39892 place count 8519 transition count 10922
Performed 1413 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1413 Pre rules applied. Total rules applied 39892 place count 8519 transition count 9509
Deduced a syphon composed of 1413 places in 3 ms
Ensure Unique test removed 606 places
Reduce places removed 2019 places and 0 transitions.
Iterating global reduction 2 with 3432 rules applied. Total rules applied 43324 place count 6500 transition count 9509
Drop transitions removed 606 transitions
Trivial Post-agglo rules discarded 606 transitions
Performed 606 trivial Post agglomeration. Transition count delta: 606
Iterating post reduction 2 with 606 rules applied. Total rules applied 43930 place count 6500 transition count 8903
Reduce places removed 606 places and 0 transitions.
Iterating post reduction 3 with 606 rules applied. Total rules applied 44536 place count 5894 transition count 8903
Discarding 3134 places :
Symmetric choice reduction at 4 with 3134 rule applications. Total rules 47670 place count 2760 transition count 5274
Iterating global reduction 4 with 3134 rules applied. Total rules applied 50804 place count 2760 transition count 5274
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 202 places :
Implicit places reduction removed 202 places
Drop transitions removed 507 transitions
Trivial Post-agglo rules discarded 507 transitions
Performed 507 trivial Post agglomeration. Transition count delta: 507
Iterating post reduction 4 with 1214 rules applied. Total rules applied 52018 place count 2558 transition count 4262
Reduce places removed 507 places and 0 transitions.
Iterating post reduction 5 with 507 rules applied. Total rules applied 52525 place count 2051 transition count 4262
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 52539 place count 2037 transition count 3343
Iterating global reduction 6 with 14 rules applied. Total rules applied 52553 place count 2037 transition count 3343
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 6 with 709 rules applied. Total rules applied 53262 place count 1935 transition count 2736
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 7 with 102 rules applied. Total rules applied 53364 place count 1833 transition count 2736
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 53364 place count 1833 transition count 2734
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 53368 place count 1831 transition count 2734
Discarding 1008 places :
Symmetric choice reduction at 8 with 1008 rule applications. Total rules 54376 place count 823 transition count 1726
Iterating global reduction 8 with 1008 rules applied. Total rules applied 55384 place count 823 transition count 1726
Ensure Unique test removed 909 transitions
Reduce isomorphic transitions removed 909 transitions.
Iterating post reduction 8 with 909 rules applied. Total rules applied 56293 place count 823 transition count 817
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 9 with 202 rules applied. Total rules applied 56495 place count 722 transition count 716
Applied a total of 56495 rules in 1514 ms. Remains 722 /36900 variables (removed 36178) and now considering 716/36871 (removed 36155) transitions.
// Phase 1: matrix 716 rows 722 cols
[2022-05-16 18:34:09] [INFO ] Computed 207 place invariants in 12 ms
[2022-05-16 18:34:09] [INFO ] Implicit Places using invariants in 372 ms returned [105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 715]
Discarding 203 places :
Implicit Place search using SMT only with invariants took 376 ms to find 203 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 519/36900 places, 716/36871 transitions.
Graph (complete) has 1021 edges and 519 vertex of which 418 are kept as prefixes of interest. Removing 101 places using SCC suffix rule.0 ms
Discarding 101 places :
Also discarding 101 output transitions
Drop transitions removed 101 transitions
Drop transitions removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 203 rules applied. Total rules applied 204 place count 418 transition count 412
Reduce places removed 203 places and 0 transitions.
Iterating post reduction 1 with 203 rules applied. Total rules applied 407 place count 215 transition count 412
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 505 place count 117 transition count 216
Iterating global reduction 2 with 98 rules applied. Total rules applied 603 place count 117 transition count 216
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 701 place count 19 transition count 20
Iterating global reduction 2 with 98 rules applied. Total rules applied 799 place count 19 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 801 place count 18 transition count 19
Applied a total of 801 rules in 8 ms. Remains 18 /519 variables (removed 501) and now considering 19/716 (removed 697) transitions.
// Phase 1: matrix 19 rows 18 cols
[2022-05-16 18:34:09] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 18:34:09] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 19 rows 18 cols
[2022-05-16 18:34:09] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 18:34:09] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/36900 places, 19/36871 transitions.
Finished structural reductions, in 2 iterations. Remains : 18/36900 places, 19/36871 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1)), p1:(GEQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 207 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-11 finished in 2047 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((X(F(G(p1)))&&p0)))&&X(!(p2 U p3))))'
Support contains 6 out of 36900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36900/36900 places, 36871/36871 transitions.
Discarding 3333 places :
Implicit places reduction removed 3333 places
Iterating post reduction 0 with 3333 rules applied. Total rules applied 3333 place count 33567 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 3535 place count 33365 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 3737 place count 33365 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3739 place count 33363 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 3741 place count 33363 transition count 36265
Applied a total of 3741 rules in 775 ms. Remains 33363 /36900 variables (removed 3537) and now considering 36265/36871 (removed 606) transitions.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:34:11] [INFO ] Computed 1924 place invariants in 1408 ms
[2022-05-16 18:34:14] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:34:14] [INFO ] Implicit Places using invariants in 4032 ms returned []
Implicit Place search using SMT only with invariants took 4040 ms to find 0 implicit places.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:34:16] [INFO ] Computed 1924 place invariants in 1439 ms
[2022-05-16 18:34:18] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:34:18] [INFO ] Dead Transitions using invariants and state equation in 4040 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33363/36900 places, 36265/36871 transitions.
Finished structural reductions, in 1 iterations. Remains : 33363/36900 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), true, p3, (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p3 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p3) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p3, acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(GEQ s5597 1), p0:(AND (GEQ s18240 1) (GEQ s20776 1)), p2:(AND (GEQ s806 1) (GEQ s2523 1)), p1:(GEQ s33302 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-13 finished in 9191 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 36900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36900/36900 places, 36871/36871 transitions.
Discarding 3333 places :
Implicit places reduction removed 3333 places
Iterating post reduction 0 with 3333 rules applied. Total rules applied 3333 place count 33567 transition count 36871
Discarding 202 places :
Symmetric choice reduction at 1 with 202 rule applications. Total rules 3535 place count 33365 transition count 36467
Iterating global reduction 1 with 202 rules applied. Total rules applied 3737 place count 33365 transition count 36467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3739 place count 33363 transition count 36265
Iterating global reduction 1 with 2 rules applied. Total rules applied 3741 place count 33363 transition count 36265
Applied a total of 3741 rules in 788 ms. Remains 33363 /36900 variables (removed 3537) and now considering 36265/36871 (removed 606) transitions.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:34:21] [INFO ] Computed 1924 place invariants in 1440 ms
[2022-05-16 18:34:23] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:34:23] [INFO ] Implicit Places using invariants in 3993 ms returned []
Implicit Place search using SMT only with invariants took 3994 ms to find 0 implicit places.
// Phase 1: matrix 36265 rows 33363 cols
[2022-05-16 18:34:25] [INFO ] Computed 1924 place invariants in 1450 ms
[2022-05-16 18:34:27] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:34:27] [INFO ] Dead Transitions using invariants and state equation in 4033 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33363/36900 places, 36265/36871 transitions.
Finished structural reductions, in 1 iterations. Remains : 33363/36900 places, 36265/36871 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s28312 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 5783 steps with 0 reset in 146 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-14 finished in 9148 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((X(G(!p0))||p1) U p2))'
Support contains 4 out of 36900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36900/36900 places, 36871/36871 transitions.
Discarding 3333 places :
Implicit places reduction removed 3333 places
Iterating post reduction 0 with 3333 rules applied. Total rules applied 3333 place count 33567 transition count 36871
Discarding 201 places :
Symmetric choice reduction at 1 with 201 rule applications. Total rules 3534 place count 33366 transition count 36469
Iterating global reduction 1 with 201 rules applied. Total rules applied 3735 place count 33366 transition count 36469
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3736 place count 33365 transition count 36368
Iterating global reduction 1 with 1 rules applied. Total rules applied 3737 place count 33365 transition count 36368
Applied a total of 3737 rules in 816 ms. Remains 33365 /36900 variables (removed 3535) and now considering 36368/36871 (removed 503) transitions.
// Phase 1: matrix 36368 rows 33365 cols
[2022-05-16 18:34:30] [INFO ] Computed 1924 place invariants in 1451 ms
[2022-05-16 18:34:33] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:34:33] [INFO ] Implicit Places using invariants in 4160 ms returned []
Implicit Place search using SMT only with invariants took 4161 ms to find 0 implicit places.
// Phase 1: matrix 36368 rows 33365 cols
[2022-05-16 18:34:34] [INFO ] Computed 1924 place invariants in 1437 ms
[2022-05-16 18:34:37] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 18:34:37] [INFO ] Dead Transitions using invariants and state equation in 4086 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 33365/36900 places, 36368/36871 transitions.
Finished structural reductions, in 1 iterations. Remains : 33365/36900 places, 36368/36871 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), p2, (AND (NOT p0) p2)]
Running random walk in product with property : FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s774 1) (GEQ s3198 1)), p2:(GEQ s20626 1), p1:(GEQ s16912 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 46271 steps with 7 reset in 1133 ms.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00100M0010C005P005G002-LTLFireability-15 finished in 10441 ms.
All properties solved by simple procedures.
Total runtime 361102 ms.

BK_STOP 1652726078941

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="FamilyReunion-PT-L00100M0010C005P005G002"
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 FamilyReunion-PT-L00100M0010C005P005G002, 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 r078-tall-165260110800740"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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