Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 32M
-rw-r--r-- 1 mcc users 1.2M Feb 26 12:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Feb 26 12:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 508K Feb 26 12:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.8M Feb 26 12:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 1.1M Feb 25 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.6M Feb 25 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 381K Feb 25 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Feb 25 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.3M Feb 26 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.7M Feb 26 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 643K Feb 26 14:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.2M Feb 26 14:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 167K Feb 25 15:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 333K Feb 25 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 8.7M Mar 5 18:22 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-2000-LTLFireability-00
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-01
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-02
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-03
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-04
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-05
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-06
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-07
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-08
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-09
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-10
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-11
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-12
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-13
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-14
FORMULA_NAME AirplaneLD-PT-2000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678508510969

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-PT-2000
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 04:21:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 04:21:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 04:21:54] [INFO ] Load time of PNML (sax parser for PT used): 525 ms
[2023-03-11 04:21:54] [INFO ] Transformed 14019 places.
[2023-03-11 04:21:54] [INFO ] Transformed 16008 transitions.
[2023-03-11 04:21:54] [INFO ] Parsed PT model containing 14019 places and 16008 transitions and 61028 arcs in 711 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 68 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 6002 places and 0 transitions.
FORMULA AirplaneLD-PT-2000-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-2000-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-2000-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-2000-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3017 out of 8017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8017/8017 places, 16008/16008 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 8014 transition count 16008
Discarding 4993 places :
Symmetric choice reduction at 1 with 4993 rule applications. Total rules 4996 place count 3021 transition count 11015
Iterating global reduction 1 with 4993 rules applied. Total rules applied 9989 place count 3021 transition count 11015
Ensure Unique test removed 4993 transitions
Reduce isomorphic transitions removed 4993 transitions.
Iterating post reduction 1 with 4993 rules applied. Total rules applied 14982 place count 3021 transition count 6022
Applied a total of 14982 rules in 423 ms. Remains 3021 /8017 variables (removed 4996) and now considering 6022/16008 (removed 9986) transitions.
// Phase 1: matrix 6022 rows 3021 cols
[2023-03-11 04:21:56] [INFO ] Computed 1 place invariants in 1187 ms
[2023-03-11 04:21:56] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 04:21:57] [INFO ] Implicit Places using invariants in 1866 ms returned []
[2023-03-11 04:21:57] [INFO ] Invariant cache hit.
[2023-03-11 04:21:58] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 3100 ms to find 0 implicit places.
[2023-03-11 04:21:58] [INFO ] Invariant cache hit.
[2023-03-11 04:22:02] [INFO ] Dead Transitions using invariants and state equation in 3795 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3021/8017 places, 6022/16008 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7323 ms. Remains : 3021/8017 places, 6022/16008 transitions.
Support contains 3017 out of 3021 places after structural reductions.
[2023-03-11 04:22:02] [INFO ] Flatten gal took : 350 ms
[2023-03-11 04:22:03] [INFO ] Flatten gal took : 244 ms
[2023-03-11 04:22:03] [INFO ] Input system was already deterministic with 6022 transitions.
Support contains 3016 out of 3021 places (down from 3017) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 1264 resets, run finished after 3164 ms. (steps per millisecond=3 ) properties (out of 20) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 480 ms. (steps per millisecond=20 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-11 04:22:08] [INFO ] Invariant cache hit.
[2023-03-11 04:22:11] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 04:22:12] [INFO ] After 1546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 04:22:13] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 04:22:18] [INFO ] After 4222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 04:22:21] [INFO ] After 7489ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 2359 ms.
[2023-03-11 04:22:23] [INFO ] After 11228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Finished Parikh walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 8 properties in 81 ms.
Computed a total of 3021 stabilizing places and 6022 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3021 transition count 6022
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 3021 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3021/3021 places, 6022/6022 transitions.
Discarding 3002 places :
Symmetric choice reduction at 0 with 3002 rule applications. Total rules 3002 place count 19 transition count 3020
Iterating global reduction 0 with 3002 rules applied. Total rules applied 6004 place count 19 transition count 3020
Ensure Unique test removed 3002 transitions
Reduce isomorphic transitions removed 3002 transitions.
Iterating post reduction 0 with 3002 rules applied. Total rules applied 9006 place count 19 transition count 18
Applied a total of 9006 rules in 90 ms. Remains 19 /3021 variables (removed 3002) and now considering 18/6022 (removed 6004) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-11 04:22:24] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 04:22:24] [INFO ] Implicit Places using invariants in 115 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/3021 places, 18/6022 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 LTL mode , in 2 iterations and 207 ms. Remains : 18/3021 places, 18/6022 transitions.
Stuttering acceptance computed with spot in 304 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-2000-LTLFireability-00 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 s5 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 26 steps with 10 reset in 3 ms.
FORMULA AirplaneLD-PT-2000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-2000-LTLFireability-00 finished in 608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((F(p0)&&p1)))))'
Support contains 3 out of 3021 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3021/3021 places, 6022/6022 transitions.
Graph (complete) has 3023 edges and 3021 vertex of which 5 are kept as prefixes of interest. Removing 3016 places using SCC suffix rule.17 ms
Discarding 3016 places :
Also discarding 4018 output transitions
Drop transitions removed 4018 transitions
Ensure Unique test removed 1999 transitions
Reduce isomorphic transitions removed 1999 transitions.
Iterating post reduction 0 with 1999 rules applied. Total rules applied 2000 place count 5 transition count 5
Applied a total of 2000 rules in 37 ms. Remains 5 /3021 variables (removed 3016) and now considering 5/6022 (removed 6017) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-11 04:22:25] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 04:22:25] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-11 04:22:25] [INFO ] Invariant cache hit.
[2023-03-11 04:22:25] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-11 04:22:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 04:22:25] [INFO ] Invariant cache hit.
[2023-03-11 04:22:25] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/3021 places, 5/6022 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 5/3021 places, 5/6022 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-2000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s4 1)), p1:(AND (LT s0 1) (LT s0 1) (LT s0 1) (LT s0 1) (LT s0 1) (LT s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 25000 reset in 189 ms.
Product exploration explored 100000 steps with 25000 reset in 108 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (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 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 4 factoid took 890 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 4 factoid took 783 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-11 04:22:28] [INFO ] Invariant cache hit.
[2023-03-11 04:22:28] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 04:22:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:22:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-11 04:22:28] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-11 04:22:28] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-11 04:22:28] [INFO ] Invariant cache hit.
[2023-03-11 04:22:28] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-11 04:22:28] [INFO ] Invariant cache hit.
[2023-03-11 04:22:28] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-11 04:22:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 04:22:28] [INFO ] Invariant cache hit.
[2023-03-11 04:22:28] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 5/5 places, 5/5 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (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 (NOT p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 3 factoid took 678 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 (NOT p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 636 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-11 04:22:30] [INFO ] Invariant cache hit.
[2023-03-11 04:22:30] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 04:22:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:22:30] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-11 04:22:30] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-11 04:22:30] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 191 ms.
Product exploration explored 100000 steps with 25000 reset in 119 ms.
Built C files in :
/tmp/ltsmin10346117183113470987
[2023-03-11 04:22:30] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2023-03-11 04:22:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 04:22:30] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2023-03-11 04:22:30] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 04:22:30] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2023-03-11 04:22:30] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 04:22:30] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10346117183113470987
Running compilation step : cd /tmp/ltsmin10346117183113470987;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 331 ms.
Running link step : cd /tmp/ltsmin10346117183113470987;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin10346117183113470987;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8760708754538360607.hoa' '--buchi-type=spotba'
LTSmin run took 160 ms.
FORMULA AirplaneLD-PT-2000-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AirplaneLD-PT-2000-LTLFireability-01 finished in 6206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(!p0&&F(p1))))'
Support contains 3 out of 3021 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3021/3021 places, 6022/6022 transitions.
Graph (complete) has 3023 edges and 3021 vertex of which 9 are kept as prefixes of interest. Removing 3012 places using SCC suffix rule.10 ms
Discarding 3012 places :
Also discarding 4014 output transitions
Drop transitions removed 4014 transitions
Ensure Unique test removed 1999 transitions
Reduce isomorphic transitions removed 1999 transitions.
Iterating post reduction 0 with 1999 rules applied. Total rules applied 2000 place count 9 transition count 9
Applied a total of 2000 rules in 25 ms. Remains 9 /3021 variables (removed 3012) and now considering 9/6022 (removed 6013) transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-03-11 04:22:31] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 04:22:31] [INFO ] Implicit Places using invariants in 30 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/3021 places, 9/6022 transitions.
Graph (complete) has 5 edges and 8 vertex of which 7 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 6 ms. Remains 7 /8 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 7 cols
[2023-03-11 04:22:31] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 04:22:31] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-11 04:22:31] [INFO ] Invariant cache hit.
[2023-03-11 04:22:31] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/3021 places, 8/6022 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 137 ms. Remains : 7/3021 places, 8/6022 transitions.
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p1), p0, (AND (NOT p1) p0)]
Running random walk in product with property : AirplaneLD-PT-2000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LT s0 1), p0:(AND (GEQ s3 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 27989 reset in 108 ms.
Product exploration explored 100000 steps with 27971 reset in 68 ms.
Computed a total of 7 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 8
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 p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 6 factoid took 518 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-2000-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-2000-LTLFireability-02 finished in 1154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((p0 U (p1&&X(!p2)))))))'
Support contains 1003 out of 3021 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3021/3021 places, 6022/6022 transitions.
Discarding 2003 places :
Symmetric choice reduction at 0 with 2003 rule applications. Total rules 2003 place count 1018 transition count 4019
Iterating global reduction 0 with 2003 rules applied. Total rules applied 4006 place count 1018 transition count 4019
Ensure Unique test removed 2003 transitions
Reduce isomorphic transitions removed 2003 transitions.
Iterating post reduction 0 with 2003 rules applied. Total rules applied 6009 place count 1018 transition count 2016
Applied a total of 6009 rules in 111 ms. Remains 1018 /3021 variables (removed 2003) and now considering 2016/6022 (removed 4006) transitions.
// Phase 1: matrix 2016 rows 1018 cols
[2023-03-11 04:22:32] [INFO ] Computed 1 place invariants in 182 ms
[2023-03-11 04:22:32] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-11 04:22:33] [INFO ] Invariant cache hit.
[2023-03-11 04:22:33] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 1017 ms to find 0 implicit places.
[2023-03-11 04:22:33] [INFO ] Invariant cache hit.
[2023-03-11 04:22:34] [INFO ] Dead Transitions using invariants and state equation in 998 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1018/3021 places, 2016/6022 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2128 ms. Remains : 1018/3021 places, 2016/6022 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p1) (NOT p0) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), p2, p2]
Running random walk in product with property : AirplaneLD-PT-2000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(OR p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=4 dest: 1}, { cond=(AND p0 p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1 p2), acceptance={0} source=4 dest: 3}]], initial=0, aps=[p0:(GEQ s0 1), p1:(OR (AND (GEQ s915 1) (GEQ s1013 1)) (AND (GEQ s436 1) (GEQ s1013 1)) (AND (GEQ s15 1) (GEQ s1013 1)) (AND (GEQ s494 1) (GEQ s1013 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-2000-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-2000-LTLFireability-04 finished in 2462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(!p0)) U (p1&&F(p2)))))'
Support contains 1003 out of 3021 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3021/3021 places, 6022/6022 transitions.
Discarding 2004 places :
Symmetric choice reduction at 0 with 2004 rule applications. Total rules 2004 place count 1017 transition count 4018
Iterating global reduction 0 with 2004 rules applied. Total rules applied 4008 place count 1017 transition count 4018
Ensure Unique test removed 2004 transitions
Reduce isomorphic transitions removed 2004 transitions.
Iterating post reduction 0 with 2004 rules applied. Total rules applied 6012 place count 1017 transition count 2014
Applied a total of 6012 rules in 72 ms. Remains 1017 /3021 variables (removed 2004) and now considering 2014/6022 (removed 4008) transitions.
// Phase 1: matrix 2014 rows 1017 cols
[2023-03-11 04:22:35] [INFO ] Computed 1 place invariants in 199 ms
[2023-03-11 04:22:35] [INFO ] Implicit Places using invariants in 365 ms returned [1016]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 381 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1016/3021 places, 2014/6022 transitions.
Applied a total of 0 rules in 4 ms. Remains 1016 /1016 variables (removed 0) and now considering 2014/2014 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 457 ms. Remains : 1016/3021 places, 2014/6022 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), p0, (NOT p2), true]
Running random walk in product with property : AirplaneLD-PT-2000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s1006 1), p2:(AND (GEQ s1007 1) (GEQ s1015 1)), p0:(OR (AND (GEQ s821 1) (GEQ s1013 1)) (AND (GEQ s342 1) (GEQ s1013 1)) (AND (GEQ s284 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-2000-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-2000-LTLFireability-05 finished in 683 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(G(p1))))))'
Support contains 1004 out of 3021 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3021/3021 places, 6022/6022 transitions.
Discarding 2001 places :
Symmetric choice reduction at 0 with 2001 rule applications. Total rules 2001 place count 1020 transition count 4021
Iterating global reduction 0 with 2001 rules applied. Total rules applied 4002 place count 1020 transition count 4021
Ensure Unique test removed 2001 transitions
Reduce isomorphic transitions removed 2001 transitions.
Iterating post reduction 0 with 2001 rules applied. Total rules applied 6003 place count 1020 transition count 2020
Applied a total of 6003 rules in 61 ms. Remains 1020 /3021 variables (removed 2001) and now considering 2020/6022 (removed 4002) transitions.
// Phase 1: matrix 2020 rows 1020 cols
[2023-03-11 04:22:35] [INFO ] Computed 1 place invariants in 164 ms
[2023-03-11 04:22:35] [INFO ] Implicit Places using invariants in 341 ms returned [1019]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 345 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1019/3021 places, 2020/6022 transitions.
Applied a total of 0 rules in 18 ms. Remains 1019 /1019 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 426 ms. Remains : 1019/3021 places, 2020/6022 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-2000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s956 1) (GEQ s1015 1)) (AND (GEQ s477 1) (GEQ s1015 1)) (AND (GEQ s506 1) (GEQ s1015 1)) (AND (GEQ s927 1) (GEQ s1015 1)) (AND (GEQ s27 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-2000-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-2000-LTLFireability-06 finished in 596 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&F(p1)&&F(p2))))))'
Support contains 5 out of 3021 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3021/3021 places, 6022/6022 transitions.
Discarding 2999 places :
Symmetric choice reduction at 0 with 2999 rule applications. Total rules 2999 place count 22 transition count 3023
Iterating global reduction 0 with 2999 rules applied. Total rules applied 5998 place count 22 transition count 3023
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 22 transition count 24
Applied a total of 8997 rules in 71 ms. Remains 22 /3021 variables (removed 2999) and now considering 24/6022 (removed 5998) transitions.
// Phase 1: matrix 24 rows 22 cols
[2023-03-11 04:22:36] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 04:22:36] [INFO ] Implicit Places using invariants in 51 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/3021 places, 24/6022 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 21/3021 places, 24/6022 transitions.
Stuttering acceptance computed with spot in 404 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : AirplaneLD-PT-2000-LTLFireability-08 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 p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s17 1)), p1:(AND (GEQ s6 1) (GEQ s17 1)), p2:(OR (LT s2 1) (LT s18 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]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-2000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-2000-LTLFireability-08 finished in 567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F(p1)))))'
Support contains 4 out of 3021 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3021/3021 places, 6022/6022 transitions.
Discarding 3000 places :
Symmetric choice reduction at 0 with 3000 rule applications. Total rules 3000 place count 21 transition count 3022
Iterating global reduction 0 with 3000 rules applied. Total rules applied 6000 place count 21 transition count 3022
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 21 transition count 22
Applied a total of 9000 rules in 81 ms. Remains 21 /3021 variables (removed 3000) and now considering 22/6022 (removed 6000) transitions.
// Phase 1: matrix 22 rows 21 cols
[2023-03-11 04:22:36] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 04:22:36] [INFO ] Implicit Places using invariants in 58 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/3021 places, 22/6022 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 20/3021 places, 22/6022 transitions.
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-2000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s16 1)), p1:(AND (GEQ s9 1) (GEQ s18 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][false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-2000-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-2000-LTLFireability-09 finished in 403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(G(p1)))))'
Support contains 5 out of 3021 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3021/3021 places, 6022/6022 transitions.
Discarding 3002 places :
Symmetric choice reduction at 0 with 3002 rule applications. Total rules 3002 place count 19 transition count 3020
Iterating global reduction 0 with 3002 rules applied. Total rules applied 6004 place count 19 transition count 3020
Ensure Unique test removed 3002 transitions
Reduce isomorphic transitions removed 3002 transitions.
Iterating post reduction 0 with 3002 rules applied. Total rules applied 9006 place count 19 transition count 18
Applied a total of 9006 rules in 79 ms. Remains 19 /3021 variables (removed 3002) and now considering 18/6022 (removed 6004) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-11 04:22:37] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 04:22:37] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-11 04:22:37] [INFO ] Invariant cache hit.
[2023-03-11 04:22:37] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-11 04:22:37] [INFO ] Invariant cache hit.
[2023-03-11 04:22:37] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/3021 places, 18/6022 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 19/3021 places, 18/6022 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-2000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s18 1)) (AND (GEQ s13 1) (GEQ s18 1))), p1:(AND (GEQ s10 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 2 reset in 1 ms.
FORMULA AirplaneLD-PT-2000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-2000-LTLFireability-10 finished in 549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G(p1)))))'
Support contains 4 out of 3021 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3021/3021 places, 6022/6022 transitions.
Discarding 3001 places :
Symmetric choice reduction at 0 with 3001 rule applications. Total rules 3001 place count 20 transition count 3021
Iterating global reduction 0 with 3001 rules applied. Total rules applied 6002 place count 20 transition count 3021
Ensure Unique test removed 3001 transitions
Reduce isomorphic transitions removed 3001 transitions.
Iterating post reduction 0 with 3001 rules applied. Total rules applied 9003 place count 20 transition count 20
Applied a total of 9003 rules in 82 ms. Remains 20 /3021 variables (removed 3001) and now considering 20/6022 (removed 6002) transitions.
// Phase 1: matrix 20 rows 20 cols
[2023-03-11 04:22:37] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 04:22:37] [INFO ] Implicit Places using invariants in 45 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/3021 places, 20/6022 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 19/3021 places, 20/6022 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : AirplaneLD-PT-2000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s18 1)), p1:(AND (GEQ s7 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-2000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-2000-LTLFireability-11 finished in 476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&G(p1))))'
Support contains 3 out of 3021 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3021/3021 places, 6022/6022 transitions.
Discarding 3001 places :
Symmetric choice reduction at 0 with 3001 rule applications. Total rules 3001 place count 20 transition count 3021
Iterating global reduction 0 with 3001 rules applied. Total rules applied 6002 place count 20 transition count 3021
Ensure Unique test removed 3001 transitions
Reduce isomorphic transitions removed 3001 transitions.
Iterating post reduction 0 with 3001 rules applied. Total rules applied 9003 place count 20 transition count 20
Applied a total of 9003 rules in 95 ms. Remains 20 /3021 variables (removed 3001) and now considering 20/6022 (removed 6002) transitions.
// Phase 1: matrix 20 rows 20 cols
[2023-03-11 04:22:38] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 04:22:38] [INFO ] Implicit Places using invariants in 53 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/3021 places, 20/6022 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 152 ms. Remains : 19/3021 places, 20/6022 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-2000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (LT s5 1) (LT s15 1)), p0:(LT s3 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-2000-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-2000-LTLFireability-12 finished in 409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 3 out of 3021 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3021/3021 places, 6022/6022 transitions.
Discarding 3001 places :
Symmetric choice reduction at 0 with 3001 rule applications. Total rules 3001 place count 20 transition count 3021
Iterating global reduction 0 with 3001 rules applied. Total rules applied 6002 place count 20 transition count 3021
Ensure Unique test removed 3001 transitions
Reduce isomorphic transitions removed 3001 transitions.
Iterating post reduction 0 with 3001 rules applied. Total rules applied 9003 place count 20 transition count 20
Applied a total of 9003 rules in 83 ms. Remains 20 /3021 variables (removed 3001) and now considering 20/6022 (removed 6002) transitions.
// Phase 1: matrix 20 rows 20 cols
[2023-03-11 04:22:38] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 04:22:38] [INFO ] Implicit Places using invariants in 92 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/3021 places, 20/6022 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 LTL mode , in 2 iterations and 176 ms. Remains : 19/3021 places, 20/6022 transitions.
Stuttering acceptance computed with spot in 229 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-2000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (LT s2 1) (LT s16 1)), p0:(GEQ s9 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 503 steps with 158 reset in 3 ms.
FORMULA AirplaneLD-PT-2000-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-2000-LTLFireability-15 finished in 436 ms.
All properties solved by simple procedures.
Total runtime 45553 ms.

BK_STOP 1678508559756

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is AirplaneLD-PT-2000, 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 r005-oct2-167813592900300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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