fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r006-tajo-165245689100267
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for AirplaneLD-PT-0100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
414.819 11424.00 21065.00 47.90 TTFTFTTTTFFFFTFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 102K Apr 29 21:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 401K Apr 29 21:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K Apr 29 21:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 318K Apr 29 21:01 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 26K May 9 07:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 9 07:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K May 9 07:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 118K May 9 07:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.1K 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 433K 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-0100-LTLCardinality-00
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-01
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-02
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-03
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-04
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-05
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-06
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-07
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-08
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-09
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-10
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-11
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-12
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-13
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-14
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652658580039

Running Version 202205111006
[2022-05-15 23:49:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:49:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:49:41] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2022-05-15 23:49:41] [INFO ] Transformed 719 places.
[2022-05-15 23:49:41] [INFO ] Transformed 808 transitions.
[2022-05-15 23:49:41] [INFO ] Parsed PT model containing 719 places and 808 transitions in 219 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 302 places and 0 transitions.
FORMULA AirplaneLD-PT-0100-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 414 out of 417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 417/417 places, 808/808 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 415 transition count 808
Applied a total of 2 rules in 14 ms. Remains 415 /417 variables (removed 2) and now considering 808/808 (removed 0) transitions.
// Phase 1: matrix 808 rows 415 cols
[2022-05-15 23:49:41] [INFO ] Computed 1 place invariants in 47 ms
[2022-05-15 23:49:41] [INFO ] Implicit Places using invariants in 205 ms returned []
// Phase 1: matrix 808 rows 415 cols
[2022-05-15 23:49:41] [INFO ] Computed 1 place invariants in 16 ms
[2022-05-15 23:49:42] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
// Phase 1: matrix 808 rows 415 cols
[2022-05-15 23:49:42] [INFO ] Computed 1 place invariants in 12 ms
[2022-05-15 23:49:42] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 415/417 places, 808/808 transitions.
Finished structural reductions, in 1 iterations. Remains : 415/417 places, 808/808 transitions.
Support contains 414 out of 415 places after structural reductions.
[2022-05-15 23:49:42] [INFO ] Flatten gal took : 74 ms
[2022-05-15 23:49:42] [INFO ] Flatten gal took : 35 ms
[2022-05-15 23:49:42] [INFO ] Input system was already deterministic with 808 transitions.
Incomplete random walk after 10000 steps, including 1257 resets, run finished after 532 ms. (steps per millisecond=18 ) properties (out of 21) seen :14
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 808 rows 415 cols
[2022-05-15 23:49:43] [INFO ] Computed 1 place invariants in 11 ms
[2022-05-15 23:49:43] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 23:49:43] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 2 ms.
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
FORMULA AirplaneLD-PT-0100-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 415 stabilizing places and 808 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 415 transition count 808
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA AirplaneLD-PT-0100-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&X(F(G(p1)))))'
Support contains 203 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 808/808 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 414 transition count 808
Discarding 197 places :
Symmetric choice reduction at 1 with 197 rule applications. Total rules 198 place count 217 transition count 611
Iterating global reduction 1 with 197 rules applied. Total rules applied 395 place count 217 transition count 611
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 1 with 197 rules applied. Total rules applied 592 place count 217 transition count 414
Applied a total of 592 rules in 15 ms. Remains 217 /415 variables (removed 198) and now considering 414/808 (removed 394) transitions.
// Phase 1: matrix 414 rows 217 cols
[2022-05-15 23:49:43] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-15 23:49:43] [INFO ] Implicit Places using invariants in 63 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 216/415 places, 414/808 transitions.
Applied a total of 0 rules in 3 ms. Remains 216 /216 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 216/415 places, 414/808 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLCardinality-00 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:(LEQ s5 s213), p1:(LEQ s215 (ADD s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 12574 reset in 922 ms.
Product exploration explored 100000 steps with 12620 reset in 988 ms.
Computed a total of 216 stabilizing places and 414 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 216 transition count 414
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 p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 5 factoid took 128 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-0100-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLCardinality-00 finished in 2550 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(G(F(p0))))))'
Support contains 201 out of 415 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 415/415 places, 808/808 transitions.
Graph (complete) has 614 edges and 415 vertex of which 211 are kept as prefixes of interest. Removing 204 places using SCC suffix rule.3 ms
Discarding 204 places :
Also discarding 300 output transitions
Drop transitions removed 300 transitions
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 211 transition count 409
Applied a total of 100 rules in 12 ms. Remains 211 /415 variables (removed 204) and now considering 409/808 (removed 399) transitions.
// Phase 1: matrix 409 rows 211 cols
[2022-05-15 23:49:46] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-15 23:49:46] [INFO ] Implicit Places using invariants in 50 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 210/415 places, 409/808 transitions.
Graph (complete) has 207 edges and 210 vertex of which 209 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
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 209 transition count 407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 208 transition count 407
Applied a total of 3 rules in 9 ms. Remains 208 /210 variables (removed 2) and now considering 407/409 (removed 2) transitions.
// Phase 1: matrix 407 rows 208 cols
[2022-05-15 23:49:46] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-15 23:49:46] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 407 rows 208 cols
[2022-05-15 23:49:46] [INFO ] Computed 0 place invariants in 11 ms
[2022-05-15 23:49:46] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 208/415 places, 407/808 transitions.
Finished structural reductions, in 2 iterations. Remains : 208/415 places, 407/808 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLCardinality-01 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:(LEQ s207 (ADD s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 25817 reset in 1004 ms.
Product exploration explored 100000 steps with 25902 reset in 781 ms.
Computed a total of 208 stabilizing places and 407 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 208 transition count 407
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-0100-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLCardinality-01 finished in 2335 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U X(p0)))'
Support contains 101 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 808/808 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 414 transition count 808
Discarding 296 places :
Symmetric choice reduction at 1 with 296 rule applications. Total rules 297 place count 118 transition count 512
Iterating global reduction 1 with 296 rules applied. Total rules applied 593 place count 118 transition count 512
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Iterating post reduction 1 with 296 rules applied. Total rules applied 889 place count 118 transition count 216
Applied a total of 889 rules in 15 ms. Remains 118 /415 variables (removed 297) and now considering 216/808 (removed 592) transitions.
// Phase 1: matrix 216 rows 118 cols
[2022-05-15 23:49:48] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-15 23:49:48] [INFO ] Implicit Places using invariants in 39 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/415 places, 216/808 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 117/415 places, 216/808 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AirplaneLD-PT-0100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s...], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLCardinality-02 finished in 134 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((X(p0) U p1) U G(!p0))&&((p0 U false)||G(p1))))'
Support contains 4 out of 415 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 415/415 places, 808/808 transitions.
Graph (complete) has 614 edges and 415 vertex of which 5 are kept as prefixes of interest. Removing 410 places using SCC suffix rule.3 ms
Discarding 410 places :
Also discarding 802 output transitions
Drop transitions removed 802 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 5
Applied a total of 2 rules in 6 ms. Remains 5 /415 variables (removed 410) and now considering 5/808 (removed 803) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-15 23:49:48] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:49:48] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-15 23:49:48] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:49:48] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2022-05-15 23:49:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-15 23:49:48] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:49:48] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/415 places, 5/808 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/415 places, 5/808 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p1) p0), true, (NOT p1), p0, (NOT p0), false, p0]
Running random walk in product with property : AirplaneLD-PT-0100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 1}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s4 s2), p0:(LEQ 1 (ADD s0 s1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 14 steps with 3 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLCardinality-04 finished in 260 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&(F((G(p0)||p1))||X(p2))))'
Support contains 106 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 808/808 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 414 transition count 808
Discarding 297 places :
Symmetric choice reduction at 1 with 297 rule applications. Total rules 298 place count 117 transition count 511
Iterating global reduction 1 with 297 rules applied. Total rules applied 595 place count 117 transition count 511
Ensure Unique test removed 297 transitions
Reduce isomorphic transitions removed 297 transitions.
Iterating post reduction 1 with 297 rules applied. Total rules applied 892 place count 117 transition count 214
Applied a total of 892 rules in 8 ms. Remains 117 /415 variables (removed 298) and now considering 214/808 (removed 594) transitions.
// Phase 1: matrix 214 rows 117 cols
[2022-05-15 23:49:49] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 23:49:49] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 214 rows 117 cols
[2022-05-15 23:49:49] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-15 23:49:49] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
// Phase 1: matrix 214 rows 117 cols
[2022-05-15 23:49:49] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:49:49] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/415 places, 214/808 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/415 places, 214/808 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s115 (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20260 reset in 422 ms.
Product exploration explored 100000 steps with 20161 reset in 484 ms.
Computed a total of 117 stabilizing places and 214 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 117 transition count 214
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 p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), true, (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 6 factoid took 245 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-PT-0100-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLCardinality-06 finished in 1594 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 808/808 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 414 transition count 808
Discarding 394 places :
Symmetric choice reduction at 1 with 394 rule applications. Total rules 395 place count 20 transition count 414
Iterating global reduction 1 with 394 rules applied. Total rules applied 789 place count 20 transition count 414
Ensure Unique test removed 394 transitions
Reduce isomorphic transitions removed 394 transitions.
Iterating post reduction 1 with 394 rules applied. Total rules applied 1183 place count 20 transition count 20
Applied a total of 1183 rules in 6 ms. Remains 20 /415 variables (removed 395) and now considering 20/808 (removed 788) transitions.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:49:50] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:49:50] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:49:50] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:49:50] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:49:50] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:49:50] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/415 places, 20/808 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/415 places, 20/808 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(LEQ s2 s8)], 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 2 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLCardinality-09 finished in 173 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(p0))||F(p0)||p0)))'
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 415/415 places, 808/808 transitions.
Graph (complete) has 614 edges and 415 vertex of which 414 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 394 places :
Symmetric choice reduction at 0 with 394 rule applications. Total rules 395 place count 20 transition count 414
Iterating global reduction 0 with 394 rules applied. Total rules applied 789 place count 20 transition count 414
Ensure Unique test removed 394 transitions
Reduce isomorphic transitions removed 394 transitions.
Iterating post reduction 0 with 394 rules applied. Total rules applied 1183 place count 20 transition count 20
Applied a total of 1183 rules in 10 ms. Remains 20 /415 variables (removed 395) and now considering 20/808 (removed 788) transitions.
// Phase 1: matrix 20 rows 20 cols
[2022-05-15 23:49:50] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:49:50] [INFO ] Implicit Places using invariants in 26 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/415 places, 20/808 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 1 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:49:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:49:50] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 18 rows 17 cols
[2022-05-15 23:49:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:49:50] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/415 places, 18/808 transitions.
Finished structural reductions, in 2 iterations. Remains : 17/415 places, 18/808 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s11)], 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 11 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLCardinality-10 finished in 128 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((false U false)))'
Support contains 0 out of 415 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 415/415 places, 808/808 transitions.
Graph (complete) has 614 edges and 415 vertex of which 0 are kept as prefixes of interest. Removing 415 places using SCC suffix rule.2 ms
Discarding 415 places :
Also discarding 808 output transitions
Drop transitions removed 808 transitions
Applied a total of 1 rules in 5 ms. Remains 0 /415 variables (removed 415) and now considering 0/808 (removed 808) transitions.
[2022-05-15 23:49:51] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:49:51] [INFO ] Implicit Places using invariants in 4 ms returned []
[2022-05-15 23:49:51] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:49:51] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2022-05-15 23:49:51] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 23:49:51] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 23:49:51] [INFO ] Dead Transitions using invariants and state equation in 3 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 0/415 places, 0/808 transitions.
Finished structural reductions, in 1 iterations. Remains : 0/415 places, 0/808 transitions.
Stuttering acceptance computed with spot in 13 ms :[true]
Running random walk in product with property : AirplaneLD-PT-0100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}]], initial=0, aps=[], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLCardinality-11 finished in 56 ms.
All properties solved by simple procedures.
Total runtime 9833 ms.

BK_STOP 1652658591463

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-0100"
export BK_EXAMINATION="LTLCardinality"
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-0100, examination is LTLCardinality"
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-165245689100267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-PT-0100.tgz
mv AirplaneLD-PT-0100 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;