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-165245689000244.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-0010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689000244
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 12K Apr 29 20:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 20:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 29 20:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 29 20:43 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 7.5K May 9 07:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K May 9 07:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 9 07:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:01 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 48K 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-0010-LTLFireability-00
FORMULA_NAME AirplaneLD-PT-0010-LTLFireability-01
FORMULA_NAME AirplaneLD-PT-0010-LTLFireability-02
FORMULA_NAME AirplaneLD-PT-0010-LTLFireability-03
FORMULA_NAME AirplaneLD-PT-0010-LTLFireability-04
FORMULA_NAME AirplaneLD-PT-0010-LTLFireability-05
FORMULA_NAME AirplaneLD-PT-0010-LTLFireability-06
FORMULA_NAME AirplaneLD-PT-0010-LTLFireability-07
FORMULA_NAME AirplaneLD-PT-0010-LTLFireability-08
FORMULA_NAME AirplaneLD-PT-0010-LTLFireability-09
FORMULA_NAME AirplaneLD-PT-0010-LTLFireability-10
FORMULA_NAME AirplaneLD-PT-0010-LTLFireability-11
FORMULA_NAME AirplaneLD-PT-0010-LTLFireability-12
FORMULA_NAME AirplaneLD-PT-0010-LTLFireability-13
FORMULA_NAME AirplaneLD-PT-0010-LTLFireability-14
FORMULA_NAME AirplaneLD-PT-0010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652658432423

Running Version 202205111006
[2022-05-15 23:47:13] [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:47:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:47:13] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2022-05-15 23:47:13] [INFO ] Transformed 89 places.
[2022-05-15 23:47:13] [INFO ] Transformed 88 transitions.
[2022-05-15 23:47:13] [INFO ] Parsed PT model containing 89 places and 88 transitions in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 32 places and 0 transitions.
FORMULA AirplaneLD-PT-0010-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 88/88 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 54 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 52 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 52 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 52 transition count 84
Applied a total of 9 rules in 12 ms. Remains 52 /57 variables (removed 5) and now considering 84/88 (removed 4) transitions.
// Phase 1: matrix 84 rows 52 cols
[2022-05-15 23:47:14] [INFO ] Computed 1 place invariants in 22 ms
[2022-05-15 23:47:14] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 84 rows 52 cols
[2022-05-15 23:47:14] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 23:47:14] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 52 cols
[2022-05-15 23:47:14] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:47:14] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/57 places, 84/88 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/57 places, 84/88 transitions.
Support contains 50 out of 52 places after structural reductions.
[2022-05-15 23:47:14] [INFO ] Flatten gal took : 24 ms
[2022-05-15 23:47:14] [INFO ] Flatten gal took : 11 ms
[2022-05-15 23:47:14] [INFO ] Input system was already deterministic with 84 transitions.
Incomplete random walk after 10000 steps, including 1254 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 22) seen :20
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 84 rows 52 cols
[2022-05-15 23:47:15] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-15 23:47:15] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 8 ms returned sat
[2022-05-15 23:47:15] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA AirplaneLD-PT-0010-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0010-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 52 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 52 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((G(p0)&&F(p1))))&&X(p0)))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 84/84 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 19 transition count 51
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 19 transition count 51
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 99 place count 19 transition count 18
Applied a total of 99 rules in 5 ms. Remains 19 /52 variables (removed 33) and now considering 18/84 (removed 66) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:47:15] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-15 23:47:15] [INFO ] Implicit Places using invariants in 36 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/52 places, 18/84 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/52 places, 18/84 transitions.
Stuttering acceptance computed with spot in 417 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : AirplaneLD-PT-0010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(GEQ s8 1), p1:(LT s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-LTLFireability-00 finished in 543 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(p0 U p1)||(F(p3)&&p2))))'
Support contains 10 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 84/84 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 25 transition count 57
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 25 transition count 57
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 81 place count 25 transition count 30
Applied a total of 81 rules in 2 ms. Remains 25 /52 variables (removed 27) and now considering 30/84 (removed 54) transitions.
// Phase 1: matrix 30 rows 25 cols
[2022-05-15 23:47:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:47:16] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 30 rows 25 cols
[2022-05-15 23:47:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:47:17] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 933 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 25 cols
[2022-05-15 23:47:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:47:17] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 25/52 places, 30/84 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/52 places, 30/84 transitions.
Stuttering acceptance computed with spot in 344 ms :[true, (NOT p3), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), p1, (AND p1 (NOT p3))]
Running random walk in product with property : AirplaneLD-PT-0010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p3:(AND (OR (LT s6 1) (LT s20 1)) (OR (LT s5 1) (LT s20 1)) (OR (LT s4 1) (LT s20 1)) (OR (LT s10 1) (LT s20 1)) (OR (LT s7 1) (LT s20 1)) (OR (LT s8 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 44183 reset in 329 ms.
Product exploration explored 100000 steps with 44252 reset in 160 ms.
Computed a total of 25 stabilizing places and 30 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 30
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 p3 (NOT p1) p2 (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), true, (X (X (NOT (AND p1 (NOT p3))))), (X (X p3)), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (F (G p3)), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 666 ms. Reduced automaton from 6 states, 11 edges and 4 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 114 ms :[true, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), p1]
Finished random walk after 21 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p3 (NOT p1) p2 (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), true, (X (X (NOT (AND p1 (NOT p3))))), (X (X p3)), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (F (G p3)), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (AND (NOT p2) p0)), (F (AND p0 (NOT p1))), (F p1)]
Knowledge based reduction with 12 factoid took 575 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 104 ms :[true, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), p1]
Stuttering acceptance computed with spot in 131 ms :[true, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), p1]
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 25 cols
[2022-05-15 23:47:20] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:47:20] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 30 rows 25 cols
[2022-05-15 23:47:20] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:47:20] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 25 cols
[2022-05-15 23:47:20] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:47:20] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 30/30 transitions.
Computed a total of 25 stabilizing places and 30 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 30
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 p2 (NOT p0) (NOT p1)), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 222 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), p1]
Finished random walk after 12 steps, including 1 resets, run visited all 3 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (AND (NOT p2) p0)), (F (AND (NOT p1) p0)), (F p1)]
Knowledge based reduction with 4 factoid took 246 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 4 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 106 ms :[true, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), p1]
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), p1]
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), p1]
Product exploration explored 100000 steps with 44189 reset in 128 ms.
Product exploration explored 100000 steps with 44395 reset in 237 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 221 ms :[true, (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), p1]
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 30/30 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2022-05-15 23:47:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 25 cols
[2022-05-15 23:47:21] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:47:21] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 30/30 transitions.
Product exploration explored 100000 steps with 44320 reset in 162 ms.
Product exploration explored 100000 steps with 44265 reset in 176 ms.
Built C files in :
/tmp/ltsmin15640574183713101093
[2022-05-15 23:47:22] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15640574183713101093
Running compilation step : cd /tmp/ltsmin15640574183713101093;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 213 ms.
Running link step : cd /tmp/ltsmin15640574183713101093;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15640574183713101093;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6934375391224866329.hoa' '--buchi-type=spotba'
LTSmin run took 233 ms.
FORMULA AirplaneLD-PT-0010-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AirplaneLD-PT-0010-LTLFireability-02 finished in 6871 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((p0 U X(X(!(X(p1) U !p2))))))))'
Support contains 10 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 84/84 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 24 transition count 56
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 24 transition count 56
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 84 place count 24 transition count 28
Applied a total of 84 rules in 1 ms. Remains 24 /52 variables (removed 28) and now considering 28/84 (removed 56) transitions.
// Phase 1: matrix 28 rows 24 cols
[2022-05-15 23:47:22] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:47:23] [INFO ] Implicit Places using invariants in 87 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/52 places, 28/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 23/52 places, 28/84 transitions.
Stuttering acceptance computed with spot in 426 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p2) p1), (NOT p2), (NOT p2), (AND (NOT p2) p1), (AND p1 (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-0010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 8}, { cond=p0, acceptance={} source=4 dest: 9}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}, { cond=p2, acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 6}, { cond=(AND p2 p1), acceptance={} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 5}, { cond=p2, acceptance={} source=8 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p0) p2), acceptance={} source=9 dest: 10}, { cond=(AND p0 p2), acceptance={0} source=9 dest: 11}], [{ cond=(AND (NOT p2) p1), acceptance={} source=10 dest: 5}, { cond=(AND p2 p1), acceptance={} source=10 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=11 dest: 8}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=11 dest: 9}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=11 dest: 10}, { cond=(AND p0 p2 p1), acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(AND (GEQ s15 1) (GEQ s22 1)), p2:(LT s8 1), p1:(OR (GEQ s8 1) (GEQ s8 1) (AND (GEQ s1 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s20 1)) (AND (GEQ s7 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 39 steps with 5 reset in 0 ms.
FORMULA AirplaneLD-PT-0010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-LTLFireability-03 finished in 558 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(F(X(p1)))&&p2)))'
Support contains 18 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 84/84 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 33 transition count 65
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 33 transition count 65
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 57 place count 33 transition count 46
Applied a total of 57 rules in 1 ms. Remains 33 /52 variables (removed 19) and now considering 46/84 (removed 38) transitions.
// Phase 1: matrix 46 rows 33 cols
[2022-05-15 23:47:23] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:47:23] [INFO ] Implicit Places using invariants in 23 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/52 places, 46/84 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 32/52 places, 46/84 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), true, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(GEQ s0 1), p0:(OR (AND (GEQ s15 1) (GEQ s30 1)) (AND (GEQ s20 1) (GEQ s30 1)) (AND (GEQ s21 1) (GEQ s30 1)) (AND (GEQ s11 1) (GEQ s30 1)) (AND (GEQ s1...], 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 19 steps with 1 reset in 1 ms.
FORMULA AirplaneLD-PT-0010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-LTLFireability-04 finished in 232 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((G(((p1 U (p2 U p3))&&p0))&&p2)))))'
Support contains 23 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 84/84 transitions.
Graph (complete) has 65 edges and 52 vertex of which 40 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 31 transition count 55
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 31 transition count 55
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 28 place count 31 transition count 46
Applied a total of 28 rules in 6 ms. Remains 31 /52 variables (removed 21) and now considering 46/84 (removed 38) transitions.
// Phase 1: matrix 46 rows 31 cols
[2022-05-15 23:47:23] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:47:23] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 46 rows 31 cols
[2022-05-15 23:47:23] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:47:23] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2022-05-15 23:47:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 46 rows 31 cols
[2022-05-15 23:47:23] [INFO ] Computed 1 place invariants in 10 ms
[2022-05-15 23:47:23] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/52 places, 46/84 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/52 places, 46/84 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p2) (NOT p0) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3)), (NOT p3), (OR (NOT p0) (NOT p3)), (NOT p3), (OR (AND (NOT p0) p1 (NOT p3)) (AND p1 (NOT p2) (NOT p3)))]
Running random walk in product with property : AirplaneLD-PT-0010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p0 (NOT p3) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p0 (NOT p3) p1), acceptance={} source=0 dest: 4}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p0 (NOT p3) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 p0), acceptance={} source=1 dest: 3}, { cond=(AND p2 p0 (NOT p3) p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p2 (NOT p0) (NOT p3)) (AND p2 (NOT p3) (NOT p1))), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p0 (NOT p3) p1), acceptance={0} source=2 dest: 4}, { cond=(AND p2 p0 (NOT p3) p1), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND (NOT p2) (NOT p3) (NOT p1)) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p2 p0 (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p2 p0) (AND p0 p3) (AND p0 p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p3) p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3) p1), acceptance={0} source=5 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p3) p1), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p3) p1), acceptance={} source=5 dest: 3}, { cond=(AND p2 p0 (NOT p3) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (GEQ s1 1) (GEQ s27 1)) (AND (GEQ s4 1) (GEQ s27 1)) (AND (GEQ s7 1) (GEQ s27 1)) (AND (GEQ s5 1) (GEQ s27 1)) (AND (GEQ s2 1) (GEQ s27 1)) (A...], 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 6 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-LTLFireability-05 finished in 413 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 84/84 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 23 transition count 55
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 23 transition count 55
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 87 place count 23 transition count 26
Applied a total of 87 rules in 3 ms. Remains 23 /52 variables (removed 29) and now considering 26/84 (removed 58) transitions.
// Phase 1: matrix 26 rows 23 cols
[2022-05-15 23:47:24] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:47:24] [INFO ] Implicit Places using invariants in 26 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/52 places, 26/84 transitions.
Graph (complete) has 20 edges and 22 vertex of which 21 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
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 21 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 20 transition count 24
Applied a total of 3 rules in 3 ms. Remains 20 /22 variables (removed 2) and now considering 24/26 (removed 2) transitions.
// Phase 1: matrix 24 rows 20 cols
[2022-05-15 23:47:24] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-15 23:47:24] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 24 rows 20 cols
[2022-05-15 23:47:24] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:47:24] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/52 places, 24/84 transitions.
Finished structural reductions, in 2 iterations. Remains : 20/52 places, 24/84 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s7 1) (GEQ s16 1)) (AND (GEQ s8 1) (GEQ s16 1)) (AND (GEQ s6 1) (GEQ s16 1)) (AND (GEQ s5 1) (GEQ s16 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-LTLFireability-06 finished in 131 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((F(p1) U p2)&&X(p0))))'
Support contains 13 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 84/84 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 27 transition count 59
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 27 transition count 59
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 75 place count 27 transition count 34
Applied a total of 75 rules in 1 ms. Remains 27 /52 variables (removed 25) and now considering 34/84 (removed 50) transitions.
// Phase 1: matrix 34 rows 27 cols
[2022-05-15 23:47:24] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:47:24] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 34 rows 27 cols
[2022-05-15 23:47:24] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:47:24] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
// Phase 1: matrix 34 rows 27 cols
[2022-05-15 23:47:24] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:47:24] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 27/52 places, 34/84 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/52 places, 34/84 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) p2 (NOT p0)), (NOT p2), true, (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND p0 (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-0010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 8}], [{ cond=(NOT p1), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(OR (AND (GEQ s8 1) (GEQ s24 1)) (AND (GEQ s14 1) (GEQ s24 1)) (AND (GEQ s7 1) (GEQ s24 1)) (AND (GEQ s12 1) (GEQ s24 1)) (AND (GEQ s9 1) (GEQ s24 1)) ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 2 reset in 1 ms.
FORMULA AirplaneLD-PT-0010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-LTLFireability-07 finished in 415 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(X(G(!(p1 U p2)))&&(p3 U p1))))'
Support contains 7 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 84/84 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 21 transition count 53
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 21 transition count 53
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 93 place count 21 transition count 22
Applied a total of 93 rules in 2 ms. Remains 21 /52 variables (removed 31) and now considering 22/84 (removed 62) transitions.
// Phase 1: matrix 22 rows 21 cols
[2022-05-15 23:47:24] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:47:24] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 22 rows 21 cols
[2022-05-15 23:47:24] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:47:24] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 21 cols
[2022-05-15 23:47:24] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:47:24] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/52 places, 22/84 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/52 places, 22/84 transitions.
Stuttering acceptance computed with spot in 306 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), p2, (AND p2 (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-0010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p3), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}], [{ cond=(OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND (NOT p0) p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p3 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p3)) p2), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}]], initial=1, aps=[p1:(AND (GEQ s15 1) (GEQ s20 1)), p3:(AND (GEQ s6 1) (GEQ s16 1)), p0:(AND (GEQ s5 1) (GEQ s16 1)), p2:(AND (GEQ s12 1) (GEQ s19 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-LTLFireability-09 finished in 429 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(p0)))))'
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 84/84 transitions.
Graph (complete) has 65 edges and 52 vertex of which 1 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.0 ms
Discarding 51 places :
Also discarding 74 output transitions
Drop transitions removed 74 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 1 transition count 1
Applied a total of 10 rules in 1 ms. Remains 1 /52 variables (removed 51) and now considering 1/84 (removed 83) transitions.
// Phase 1: matrix 1 rows 1 cols
[2022-05-15 23:47:25] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:47:25] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-15 23:47:25] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:47:25] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2022-05-15 23:47:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2022-05-15 23:47:25] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 23:47:25] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/52 places, 1/84 transitions.
Finished structural reductions, in 1 iterations. Remains : 1/52 places, 1/84 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-LTLFireability-11 finished in 159 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(X(X(F(G(p0)))))))))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 84/84 transitions.
Graph (complete) has 65 edges and 52 vertex of which 40 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 25 place count 16 transition count 40
Iterating global reduction 0 with 24 rules applied. Total rules applied 49 place count 16 transition count 40
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 73 place count 16 transition count 16
Applied a total of 73 rules in 2 ms. Remains 16 /52 variables (removed 36) and now considering 16/84 (removed 68) transitions.
// Phase 1: matrix 16 rows 16 cols
[2022-05-15 23:47:25] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:47:25] [INFO ] Implicit Places using invariants in 18 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/52 places, 16/84 transitions.
Graph (complete) has 13 edges and 15 vertex of which 14 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
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 14 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 14
Applied a total of 3 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 13 cols
[2022-05-15 23:47:25] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:47:25] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 14 rows 13 cols
[2022-05-15 23:47:25] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:47:25] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/52 places, 14/84 transitions.
Finished structural reductions, in 2 iterations. Remains : 13/52 places, 14/84 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0010-LTLFireability-12 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 (GEQ s2 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0010-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-LTLFireability-12 finished in 171 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 84/84 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 20 transition count 52
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 20 transition count 52
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 96 place count 20 transition count 20
Applied a total of 96 rules in 3 ms. Remains 20 /52 variables (removed 32) and now considering 20/84 (removed 64) transitions.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:47:25] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:47:25] [INFO ] Implicit Places using invariants in 56 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/52 places, 20/84 transitions.
Graph (complete) has 17 edges and 19 vertex of which 18 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
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 18 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 17 transition count 18
Applied a total of 3 rules in 2 ms. Remains 17 /19 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 17 cols
[2022-05-15 23:47:25] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 23:47:25] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 18 rows 17 cols
[2022-05-15 23:47:25] [INFO ] Computed 0 place invariants in 15 ms
[2022-05-15 23:47:25] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/52 places, 18/84 transitions.
Finished structural reductions, in 2 iterations. Remains : 17/52 places, 18/84 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0010-LTLFireability-13 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 (GEQ s5 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-LTLFireability-13 finished in 186 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(X(F((F(X(p0))&&X(p0))))))||G(p1)))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 84/84 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 21 transition count 53
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 21 transition count 53
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 93 place count 21 transition count 22
Applied a total of 93 rules in 1 ms. Remains 21 /52 variables (removed 31) and now considering 22/84 (removed 62) transitions.
// Phase 1: matrix 22 rows 21 cols
[2022-05-15 23:47:25] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:47:25] [INFO ] Implicit Places using invariants in 46 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/52 places, 22/84 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 2 iterations. Remains : 20/52 places, 22/84 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 1}, { cond=(NOT p1), acceptance={} source=6 dest: 3}]], initial=5, aps=[p0:(AND (GEQ s3 1) (GEQ s17 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, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0010-LTLFireability-14 finished in 291 ms.
All properties solved by simple procedures.
Total runtime 12190 ms.

BK_STOP 1652658446432

--------------------
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-0010"
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-0010, 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-165245689000244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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