Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689100292.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AirplaneLD-PT-1000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689100292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 625K Apr 29 21:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M Apr 29 21:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 196K Apr 29 21:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 29 21:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 382K May 9 07:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 895K May 9 07:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 196K May 9 07:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 871K May 9 07:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 76K May 9 07:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 140K May 9 07:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 4.3M 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 AirplaneLD-PT-1000-LTLFireability-00
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-01
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-02
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-03
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-04
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-05
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-06
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-07
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-08
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-09
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-10
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-11
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-12
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-13
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-14
FORMULA_NAME AirplaneLD-PT-1000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652658784631

Running Version 202205111006
[2022-05-15 23:53:05] [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-15 23:53:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:53:06] [INFO ] Load time of PNML (sax parser for PT used): 475 ms
[2022-05-15 23:53:06] [INFO ] Transformed 7019 places.
[2022-05-15 23:53:06] [INFO ] Transformed 8008 transitions.
[2022-05-15 23:53:06] [INFO ] Parsed PT model containing 7019 places and 8008 transitions in 617 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 52 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 3002 places and 0 transitions.
FORMULA AirplaneLD-PT-1000-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-1000-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3016 out of 4017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4017/4017 places, 8008/8008 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 4014 transition count 8008
Discarding 995 places :
Symmetric choice reduction at 1 with 995 rule applications. Total rules 998 place count 3019 transition count 7013
Iterating global reduction 1 with 995 rules applied. Total rules applied 1993 place count 3019 transition count 7013
Ensure Unique test removed 995 transitions
Reduce isomorphic transitions removed 995 transitions.
Iterating post reduction 1 with 995 rules applied. Total rules applied 2988 place count 3019 transition count 6018
Applied a total of 2988 rules in 166 ms. Remains 3019 /4017 variables (removed 998) and now considering 6018/8008 (removed 1990) transitions.
// Phase 1: matrix 6018 rows 3019 cols
[2022-05-15 23:53:08] [INFO ] Computed 1 place invariants in 949 ms
[2022-05-15 23:53:08] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 23:53:08] [INFO ] Implicit Places using invariants in 1518 ms returned []
// Phase 1: matrix 6018 rows 3019 cols
[2022-05-15 23:53:09] [INFO ] Computed 1 place invariants in 785 ms
[2022-05-15 23:53:10] [INFO ] Implicit Places using invariants and state equation in 1913 ms returned []
Implicit Place search using SMT with State Equation took 3459 ms to find 0 implicit places.
// Phase 1: matrix 6018 rows 3019 cols
[2022-05-15 23:53:11] [INFO ] Computed 1 place invariants in 922 ms
[2022-05-15 23:53:14] [INFO ] Dead Transitions using invariants and state equation in 3852 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3019/4017 places, 6018/8008 transitions.
Finished structural reductions, in 1 iterations. Remains : 3019/4017 places, 6018/8008 transitions.
Support contains 3016 out of 3019 places after structural reductions.
[2022-05-15 23:53:15] [INFO ] Flatten gal took : 443 ms
[2022-05-15 23:53:16] [INFO ] Flatten gal took : 253 ms
[2022-05-15 23:53:17] [INFO ] Input system was already deterministic with 6018 transitions.
Support contains 3015 out of 3019 places (down from 3016) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 1264 resets, run finished after 1980 ms. (steps per millisecond=5 ) properties (out of 22) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 6018 rows 3019 cols
[2022-05-15 23:53:20] [INFO ] Computed 1 place invariants in 971 ms
[2022-05-15 23:53:23] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 23:53:23] [INFO ] After 1200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-15 23:53:24] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-15 23:53:27] [INFO ] After 2861ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2022-05-15 23:53:28] [INFO ] After 4322ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 683 ms.
[2022-05-15 23:53:29] [INFO ] After 6034ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=2 )
Parikh walk visited 4 properties in 24 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA AirplaneLD-PT-1000-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3019 stabilizing places and 6018 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3019 transition count 6018
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA AirplaneLD-PT-1000-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&p1&&((G(X(p3)) U p3)||p2))))'
Support contains 503 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6018/6018 transitions.
Discarding 2502 places :
Symmetric choice reduction at 0 with 2502 rule applications. Total rules 2502 place count 517 transition count 3516
Iterating global reduction 0 with 2502 rules applied. Total rules applied 5004 place count 517 transition count 3516
Ensure Unique test removed 2502 transitions
Reduce isomorphic transitions removed 2502 transitions.
Iterating post reduction 0 with 2502 rules applied. Total rules applied 7506 place count 517 transition count 1014
Applied a total of 7506 rules in 61 ms. Remains 517 /3019 variables (removed 2502) and now considering 1014/6018 (removed 5004) transitions.
// Phase 1: matrix 1014 rows 517 cols
[2022-05-15 23:53:30] [INFO ] Computed 1 place invariants in 95 ms
[2022-05-15 23:53:30] [INFO ] Implicit Places using invariants in 177 ms returned [516]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 182 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 516/3019 places, 1014/6018 transitions.
Applied a total of 0 rules in 4 ms. Remains 516 /516 variables (removed 0) and now considering 1014/1014 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 516/3019 places, 1014/6018 transitions.
Stuttering acceptance computed with spot in 669 ms :[true, (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p3) (NOT p0)), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(OR (AND p0 p3 p1) (AND p0 p2 p1)), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p0) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p3), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s508 1) (GEQ s515 1)), p1:(GEQ s501 1), p3:(OR (AND (GEQ s142 1) (GEQ s513 1)) (AND (GEQ s367 1) (GEQ s513 1)) (AND (GEQ s396 1) (GEQ s513 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA AirplaneLD-PT-1000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLFireability-01 finished in 1018 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||X(X(p1))))'
Support contains 3 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6018/6018 transitions.
Discarding 3000 places :
Symmetric choice reduction at 0 with 3000 rule applications. Total rules 3000 place count 19 transition count 3018
Iterating global reduction 0 with 3000 rules applied. Total rules applied 6000 place count 19 transition count 3018
Ensure Unique test removed 3000 transitions
Reduce isomorphic transitions removed 3000 transitions.
Iterating post reduction 0 with 3000 rules applied. Total rules applied 9000 place count 19 transition count 18
Applied a total of 9000 rules in 97 ms. Remains 19 /3019 variables (removed 3000) and now considering 18/6018 (removed 6000) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:53:31] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:53:31] [INFO ] Implicit Places using invariants in 32 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/3019 places, 18/6018 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 18/3019 places, 18/6018 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s3 1), p1:(AND (GEQ s10 1) (GEQ s17 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 19 steps with 6 reset in 1 ms.
FORMULA AirplaneLD-PT-1000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLFireability-02 finished in 319 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||G(p1))))'
Support contains 504 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6018/6018 transitions.
Discarding 2499 places :
Symmetric choice reduction at 0 with 2499 rule applications. Total rules 2499 place count 520 transition count 3519
Iterating global reduction 0 with 2499 rules applied. Total rules applied 4998 place count 520 transition count 3519
Ensure Unique test removed 2499 transitions
Reduce isomorphic transitions removed 2499 transitions.
Iterating post reduction 0 with 2499 rules applied. Total rules applied 7497 place count 520 transition count 1020
Applied a total of 7497 rules in 52 ms. Remains 520 /3019 variables (removed 2499) and now considering 1020/6018 (removed 4998) transitions.
// Phase 1: matrix 1020 rows 520 cols
[2022-05-15 23:53:31] [INFO ] Computed 1 place invariants in 49 ms
[2022-05-15 23:53:31] [INFO ] Implicit Places using invariants in 181 ms returned []
// Phase 1: matrix 1020 rows 520 cols
[2022-05-15 23:53:31] [INFO ] Computed 1 place invariants in 38 ms
[2022-05-15 23:53:31] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
// Phase 1: matrix 1020 rows 520 cols
[2022-05-15 23:53:32] [INFO ] Computed 1 place invariants in 77 ms
[2022-05-15 23:53:32] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 520/3019 places, 1020/6018 transitions.
Finished structural reductions, in 1 iterations. Remains : 520/3019 places, 1020/6018 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s102 1) (GEQ s515 1)) (AND (GEQ s298 1) (GEQ s515 1)) (AND (GEQ s356 1) (GEQ s515 1)) (AND (GEQ s73 1) (GEQ s515 1)) (AND (GEQ s15 1) (GE...], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-1000-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLFireability-03 finished in 1295 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1000 out of 3019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3019/3019 places, 6018/6018 transitions.
Graph (complete) has 4018 edges and 3019 vertex of which 2010 are kept as prefixes of interest. Removing 1009 places using SCC suffix rule.29 ms
Discarding 1009 places :
Also discarding 2010 output transitions
Drop transitions removed 2010 transitions
Discarding 1000 places :
Symmetric choice reduction at 0 with 1000 rule applications. Total rules 1001 place count 1010 transition count 3008
Iterating global reduction 0 with 1000 rules applied. Total rules applied 2001 place count 1010 transition count 3008
Ensure Unique test removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 3001 place count 1010 transition count 2008
Applied a total of 3001 rules in 134 ms. Remains 1010 /3019 variables (removed 2009) and now considering 2008/6018 (removed 4010) transitions.
// Phase 1: matrix 2008 rows 1010 cols
[2022-05-15 23:53:33] [INFO ] Computed 1 place invariants in 253 ms
[2022-05-15 23:53:33] [INFO ] Implicit Places using invariants in 411 ms returned [1009]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 415 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1009/3019 places, 2008/6018 transitions.
Graph (complete) has 1007 edges and 1009 vertex of which 1008 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1008 transition count 2006
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 1007 transition count 2006
Applied a total of 3 rules in 40 ms. Remains 1007 /1009 variables (removed 2) and now considering 2006/2008 (removed 2) transitions.
// Phase 1: matrix 2006 rows 1007 cols
[2022-05-15 23:53:33] [INFO ] Computed 0 place invariants in 196 ms
[2022-05-15 23:53:33] [INFO ] Implicit Places using invariants in 347 ms returned []
// Phase 1: matrix 2006 rows 1007 cols
[2022-05-15 23:53:33] [INFO ] Computed 0 place invariants in 236 ms
[2022-05-15 23:53:34] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1144 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1007/3019 places, 2006/6018 transitions.
Finished structural reductions, in 2 iterations. Remains : 1007/3019 places, 2006/6018 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s369 1) (LT s1005 1)) (OR (LT s848 1) (LT s1005 1)) (OR (LT s877 1) (LT s1005 1)) (OR (LT s790 1) (LT s1005 1)) (OR (LT s427 1) (LT s1005 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 94080 steps with 19770 reset in 10001 ms.
Product exploration timeout after 94200 steps with 19813 reset in 10001 ms.
Computed a total of 1007 stabilizing places and 2006 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1007 transition count 2006
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 p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-1000-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-1000-LTLFireability-05 finished in 22753 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(p0)&&p1))||G(F(G(F(p2))))))'
Support contains 2002 out of 3019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3019/3019 places, 6018/6018 transitions.
Graph (complete) has 4018 edges and 3019 vertex of which 2010 are kept as prefixes of interest. Removing 1009 places using SCC suffix rule.10 ms
Discarding 1009 places :
Also discarding 2010 output transitions
Drop transitions removed 2010 transitions
Applied a total of 1 rules in 87 ms. Remains 2010 /3019 variables (removed 1009) and now considering 4008/6018 (removed 2010) transitions.
// Phase 1: matrix 4008 rows 2010 cols
[2022-05-15 23:53:56] [INFO ] Computed 1 place invariants in 794 ms
[2022-05-15 23:53:56] [INFO ] Implicit Places using invariants in 1151 ms returned [2009]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1155 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2009/3019 places, 4008/6018 transitions.
Graph (complete) has 2007 edges and 2009 vertex of which 2008 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2008 transition count 4006
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 2007 transition count 4006
Applied a total of 3 rules in 51 ms. Remains 2007 /2009 variables (removed 2) and now considering 4006/4008 (removed 2) transitions.
// Phase 1: matrix 4006 rows 2007 cols
[2022-05-15 23:53:57] [INFO ] Computed 0 place invariants in 621 ms
[2022-05-15 23:53:57] [INFO ] Implicit Places using invariants in 861 ms returned []
// Phase 1: matrix 4006 rows 2007 cols
[2022-05-15 23:53:58] [INFO ] Computed 0 place invariants in 602 ms
[2022-05-15 23:53:58] [INFO ] Implicit Places using invariants and state equation in 1252 ms returned []
Implicit Place search using SMT with State Equation took 2116 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2007/3019 places, 4006/6018 transitions.
Finished structural reductions, in 2 iterations. Remains : 2007/3019 places, 4006/6018 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (OR (LT s369 1) (LT s2005 1)) (OR (LT s848 1) (LT s2005 1)) (OR (LT s877 1) (LT s2005 1)) (OR (LT s790 1) (LT s2005 1)) (OR (LT s427 1) (LT s2005 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration timeout after 37180 steps with 7821 reset in 10001 ms.
Product exploration timeout after 36340 steps with 7660 reset in 10001 ms.
Computed a total of 2007 stabilizing places and 4006 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2007 transition count 4006
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 p1 p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p2), (F (G p0)), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0)))]
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 9 factoid took 292 ms. Reduced automaton from 6 states, 16 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-1000-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-1000-LTLFireability-06 finished in 25021 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 2001 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6018/6018 transitions.
Discarding 1002 places :
Symmetric choice reduction at 0 with 1002 rule applications. Total rules 1002 place count 2017 transition count 5016
Iterating global reduction 0 with 1002 rules applied. Total rules applied 2004 place count 2017 transition count 5016
Ensure Unique test removed 1002 transitions
Reduce isomorphic transitions removed 1002 transitions.
Iterating post reduction 0 with 1002 rules applied. Total rules applied 3006 place count 2017 transition count 4014
Applied a total of 3006 rules in 57 ms. Remains 2017 /3019 variables (removed 1002) and now considering 4014/6018 (removed 2004) transitions.
// Phase 1: matrix 4014 rows 2017 cols
[2022-05-15 23:54:20] [INFO ] Computed 1 place invariants in 453 ms
[2022-05-15 23:54:21] [INFO ] Implicit Places using invariants in 640 ms returned [2016]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 655 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2016/3019 places, 4014/6018 transitions.
Applied a total of 0 rules in 19 ms. Remains 2016 /2016 variables (removed 0) and now considering 4014/4014 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2016/3019 places, 4014/6018 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s374 1) (GEQ s2014 1)) (AND (GEQ s853 1) (GEQ s2014 1)) (AND (GEQ s882 1) (GEQ s2014 1)) (AND (GEQ s795 1) (GEQ s2014 1)) (AND (GEQ s432 ...], 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][false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 2 reset in 13 ms.
FORMULA AirplaneLD-PT-1000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLFireability-07 finished in 871 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0)||X(!p0)))||X(X(p0))))'
Support contains 1 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6018/6018 transitions.
Discarding 3000 places :
Symmetric choice reduction at 0 with 3000 rule applications. Total rules 3000 place count 19 transition count 3018
Iterating global reduction 0 with 3000 rules applied. Total rules applied 6000 place count 19 transition count 3018
Ensure Unique test removed 3000 transitions
Reduce isomorphic transitions removed 3000 transitions.
Iterating post reduction 0 with 3000 rules applied. Total rules applied 9000 place count 19 transition count 18
Applied a total of 9000 rules in 62 ms. Remains 19 /3019 variables (removed 3000) and now considering 18/6018 (removed 6000) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:54:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:54:21] [INFO ] Implicit Places using invariants in 24 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/3019 places, 18/6018 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 18/3019 places, 18/6018 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), false, false, p0, false]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 3}]], initial=2, aps=[p0:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 1 reset in 1 ms.
FORMULA AirplaneLD-PT-1000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLFireability-08 finished in 251 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(X(((p0 U p1)&&p2))))))'
Support contains 5 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6018/6018 transitions.
Discarding 2999 places :
Symmetric choice reduction at 0 with 2999 rule applications. Total rules 2999 place count 20 transition count 3019
Iterating global reduction 0 with 2999 rules applied. Total rules applied 5998 place count 20 transition count 3019
Ensure Unique test removed 2999 transitions
Reduce isomorphic transitions removed 2999 transitions.
Iterating post reduction 0 with 2999 rules applied. Total rules applied 8997 place count 20 transition count 20
Applied a total of 8997 rules in 47 ms. Remains 20 /3019 variables (removed 2999) and now considering 20/6018 (removed 5998) transitions.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:54:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:54:21] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:54:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:54:21] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:54:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:54:21] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/3019 places, 20/6018 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/3019 places, 20/6018 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(OR (NOT p2) (AND (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(AND (GEQ s13 1) (GEQ s19 1)), p0:(AND (GEQ s3 1) (GEQ s16 1)), p2:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-1000-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLFireability-09 finished in 422 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)&&p1))||!(G(p2) U X(X(!p1)))))'
Support contains 5 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6018/6018 transitions.
Discarding 2999 places :
Symmetric choice reduction at 0 with 2999 rule applications. Total rules 2999 place count 20 transition count 3019
Iterating global reduction 0 with 2999 rules applied. Total rules applied 5998 place count 20 transition count 3019
Ensure Unique test removed 2999 transitions
Reduce isomorphic transitions removed 2999 transitions.
Iterating post reduction 0 with 2999 rules applied. Total rules applied 8997 place count 20 transition count 20
Applied a total of 8997 rules in 67 ms. Remains 20 /3019 variables (removed 2999) and now considering 20/6018 (removed 5998) transitions.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:54:22] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:54:22] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:54:22] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:54:22] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:54:22] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:54:22] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/3019 places, 20/6018 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/3019 places, 20/6018 transitions.
Stuttering acceptance computed with spot in 478 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), p2, (AND (NOT p0) p2), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 12}], [{ cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 2}, { cond=p2, acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=7 dest: 9}], [{ cond=(NOT p1), acceptance={} source=8 dest: 0}, { cond=(AND p2 p1), acceptance={} source=8 dest: 10}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=9 dest: 11}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 12}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=10 dest: 4}, { cond=(AND p2 p1), acceptance={} source=10 dest: 10}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=11 dest: 5}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=11 dest: 11}], [{ cond=(NOT p0), acceptance={0} source=12 dest: 12}]], initial=6, aps=[p1:(OR (LT s8 1) (LT s17 1)), p0:(OR (LT s14 1) (LT s19 1)), p2:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 47642 reset in 117 ms.
Product exploration explored 100000 steps with 47621 reset in 168 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 20
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 p1 p0 p2), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p2 p1 (NOT p0))))), (F (G p1)), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p2) p1 (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1))))]
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 11 factoid took 394 ms. Reduced automaton from 13 states, 22 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-1000-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-1000-LTLFireability-10 finished in 1444 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||p1)))'
Support contains 4 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6018/6018 transitions.
Discarding 2998 places :
Symmetric choice reduction at 0 with 2998 rule applications. Total rules 2998 place count 21 transition count 3020
Iterating global reduction 0 with 2998 rules applied. Total rules applied 5996 place count 21 transition count 3020
Ensure Unique test removed 2998 transitions
Reduce isomorphic transitions removed 2998 transitions.
Iterating post reduction 0 with 2998 rules applied. Total rules applied 8994 place count 21 transition count 22
Applied a total of 8994 rules in 29 ms. Remains 21 /3019 variables (removed 2998) and now considering 22/6018 (removed 5996) transitions.
// Phase 1: matrix 22 rows 21 cols
[2022-05-15 23:54:23] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:54:23] [INFO ] Implicit Places using invariants in 47 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/3019 places, 22/6018 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/3019 places, 22/6018 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s9 1) (GEQ s18 1)), p0:(AND (GEQ s2 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 0 ms.
FORMULA AirplaneLD-PT-1000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLFireability-11 finished in 186 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((((p0 U p1) U X(p2))&&G(F(p1)))))'
Support contains 5 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6018/6018 transitions.
Discarding 2999 places :
Symmetric choice reduction at 0 with 2999 rule applications. Total rules 2999 place count 20 transition count 3019
Iterating global reduction 0 with 2999 rules applied. Total rules applied 5998 place count 20 transition count 3019
Ensure Unique test removed 2999 transitions
Reduce isomorphic transitions removed 2999 transitions.
Iterating post reduction 0 with 2999 rules applied. Total rules applied 8997 place count 20 transition count 20
Applied a total of 8997 rules in 29 ms. Remains 20 /3019 variables (removed 2999) and now considering 20/6018 (removed 5998) transitions.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:54:23] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:54:23] [INFO ] Implicit Places using invariants in 21 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/3019 places, 20/6018 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 19/3019 places, 20/6018 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-12 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=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s10 1) (GEQ s18 1)), p0:(AND (GEQ s8 1) (GEQ s17 1)), p2:(GEQ s0 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, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-1000-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLFireability-12 finished in 310 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G(!((G(p2)||!p3)&&p1))))'
Support contains 5 out of 3019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3019/3019 places, 6018/6018 transitions.
Graph (complete) has 4018 edges and 3019 vertex of which 2010 are kept as prefixes of interest. Removing 1009 places using SCC suffix rule.6 ms
Discarding 1009 places :
Also discarding 2010 output transitions
Drop transitions removed 2010 transitions
Discarding 1998 places :
Symmetric choice reduction at 0 with 1998 rule applications. Total rules 1999 place count 12 transition count 2010
Iterating global reduction 0 with 1998 rules applied. Total rules applied 3997 place count 12 transition count 2010
Ensure Unique test removed 1998 transitions
Reduce isomorphic transitions removed 1998 transitions.
Iterating post reduction 0 with 1998 rules applied. Total rules applied 5995 place count 12 transition count 12
Applied a total of 5995 rules in 93 ms. Remains 12 /3019 variables (removed 3007) and now considering 12/6018 (removed 6006) transitions.
// Phase 1: matrix 12 rows 12 cols
[2022-05-15 23:54:24] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:54:24] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 12 rows 12 cols
[2022-05-15 23:54:24] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:54:24] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2022-05-15 23:54:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 12 cols
[2022-05-15 23:54:24] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:54:24] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/3019 places, 12/6018 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/3019 places, 12/6018 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (AND p1 (NOT p3)) (AND p1 p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND p1 p2)]
Running random walk in product with property : AirplaneLD-PT-1000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p3), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p3 p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p3 p2), acceptance={} source=0 dest: 4}, { cond=(AND p1 p3 p2), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND p3 (NOT p0))), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p1) p3), acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s11 1)), p3:(GEQ s3 1), p0:(AND (GEQ s2 1) (GEQ s9 1)), p2:(AND (GEQ s8 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 104 steps with 20 reset in 0 ms.
FORMULA AirplaneLD-PT-1000-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLFireability-13 finished in 470 ms.
All properties solved by simple procedures.
Total runtime 78467 ms.

BK_STOP 1652658864835

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="AirplaneLD-PT-1000"
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 AirplaneLD-PT-1000, 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 r006-tajo-165245689100292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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