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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 8.2K Apr 29 20:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 20:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 20:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 20:47 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 3.9K May 9 07:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 5 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 41K 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-COL-0020-LTLCardinality-00
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-01
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-02
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-03
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-04
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-05
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-06
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-07
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-08
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-09
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-10
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-11
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-12
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-13
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-14
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652658002887

Running Version 202205111006
[2022-05-15 23:40:04] [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:40:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:40:04] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-15 23:40:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-15 23:40:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 666 ms
[2022-05-15 23:40:05] [INFO ] Detected 3 constant HL places corresponding to 62 PT places.
[2022-05-15 23:40:05] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 159 PT places and 252.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA AirplaneLD-COL-0020-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 23:40:05] [INFO ] Built PT skeleton of HLPN with 20 places and 15 transitions 56 arcs in 8 ms.
[2022-05-15 23:40:05] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA AirplaneLD-COL-0020-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0020-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0020-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 15 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 15
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 17 stabilizing places and 14 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 14
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 1248 resets, run finished after 530 ms. (steps per millisecond=18 ) properties (out of 26) seen :14
Incomplete Best-First random walk after 10001 steps, including 349 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 342 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 336 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 287 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 338 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 350 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 387 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 346 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 341 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 329 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 401 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 356 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 14 rows 17 cols
[2022-05-15 23:40:06] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-15 23:40:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 23:40:06] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 23:40:06] [INFO ] After 421ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:10
[2022-05-15 23:40:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 23:40:06] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-15 23:40:07] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :0
Fused 12 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 12 atomic propositions for a total of 12 simplifications.
FORMULA AirplaneLD-COL-0020-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0020-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0020-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0020-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0020-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0020-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0020-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 23:40:07] [INFO ] Flatten gal took : 14 ms
[2022-05-15 23:40:07] [INFO ] Flatten gal took : 3 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Altitude
Symmetric sort wr.t. initial detected :Altitude
Transition t3_2 : guard parameter $A(Altitude:40) in guard (OR (GEQ $A 19) (EQ $A 39))introduces in Altitude(40) partition with 2 elements
Transition t3_1 : guard parameter $A(Altitude:40) in guard (AND (LT $A 19) (NEQ $A 39))introduces in Altitude(40) partition with 2 elements
Sort wr.t. initial and guards Altitude has partition Partition [nbSubs=2, partition=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]

Applying symmetric unfolding of partitioned symmetric sort :Altitude domain size was 40 reducing to 2 values.
For transition t3_2:(OR (GEQ $A 19) (EQ $A 39)) -> (EQ $A 1)
For transition t3_1:(AND (LT $A 19) (NEQ $A 39)) -> (EQ $A 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Speed
Symmetric sort wr.t. initial detected :Speed
Transition t5_2 : guard parameter $S(Speed:20) in guard (OR (LEQ $S 9) (EQ $S 19))introduces in Speed(20) partition with 2 elements
Transition t5_1 : guard parameter $S(Speed:20) in guard (AND (GT $S 9) (NEQ $S 19))introduces in Speed(20) partition with 2 elements
Transition t4_2 : guard parameter $S(Speed:20) in guard (OR (LEQ $S 9) (EQ $S 19))introduces in Speed(20) partition with 2 elements
Transition t4_1 : guard parameter $S(Speed:20) in guard (AND (GT $S 9) (NEQ $S 19))introduces in Speed(20) partition with 2 elements
Sort wr.t. initial and guards Speed has partition Partition [nbSubs=2, partition=[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]]

Applying symmetric unfolding of partitioned symmetric sort :Speed domain size was 20 reducing to 2 values.
For transition t5_2:(OR (LEQ $S 9) (EQ $S 19)) -> (EQ $S 1)
For transition t5_1:(AND (GT $S 9) (NEQ $S 19)) -> (EQ $S 0)
For transition t4_2:(OR (LEQ $S 9) (EQ $S 19)) -> (EQ $S 1)
For transition t4_1:(AND (GT $S 9) (NEQ $S 19)) -> (EQ $S 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Signal
Arc [19:1*[1]] contains constants of sort Signal
Transition t5_2 : constants on arcs in [[19:1*[1]]] introduces in Signal(2) partition with 1 elements that refines current partition to 2 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :Weight
Symmetric sort wr.t. initial detected :Weight
Transition t2_2 : guard parameter $W(Weight:2) in guard (EQ $W 1)introduces in Weight(2) partition with 2 elements
[2022-05-15 23:40:07] [INFO ] Unfolded HLPN to a Petri net with 29 places and 20 transitions 56 arcs in 33 ms.
[2022-05-15 23:40:07] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Reduce places removed 6 places and 0 transitions.
Support contains 18 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 20
Applied a total of 1 rules in 5 ms. Remains 22 /23 variables (removed 1) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-15 23:40:07] [INFO ] Computed 2 place invariants in 16 ms
[2022-05-15 23:40:07] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-15 23:40:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 23:40:07] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-15 23:40:07] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 23:40:07] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 20/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/23 places, 20/20 transitions.
Support contains 18 out of 22 places after structural reductions.
[2022-05-15 23:40:07] [INFO ] Flatten gal took : 16 ms
[2022-05-15 23:40:07] [INFO ] Flatten gal took : 3 ms
[2022-05-15 23:40:07] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10000 steps, including 1255 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 248 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 241 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 20 rows 22 cols
[2022-05-15 23:40:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 23:40:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 23:40:07] [INFO ] After 43ms 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 5 simplifications.
Computed a total of 22 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(G(p0)))&&F(p1))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Graph (complete) has 30 edges and 22 vertex of which 13 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 6 output transitions
Drop transitions removed 6 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 13 transition count 13
Applied a total of 2 rules in 9 ms. Remains 13 /22 variables (removed 9) and now considering 13/20 (removed 7) transitions.
// Phase 1: matrix 13 rows 13 cols
[2022-05-15 23:40:07] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 23:40:08] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 13 rows 13 cols
[2022-05-15 23:40:08] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:40:08] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2022-05-15 23:40:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 13 cols
[2022-05-15 23:40:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:40:08] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/22 places, 13/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/22 places, 13/20 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-COL-0020-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s6 s0), p0:(LEQ (ADD s11 s12) s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 1 reset in 1 ms.
FORMULA AirplaneLD-COL-0020-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0020-LTLCardinality-01 finished in 732 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 19 transition count 18
Applied a total of 5 rules in 5 ms. Remains 19 /22 variables (removed 3) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:40:08] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-15 23:40:08] [INFO ] Implicit Places using invariants in 47 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/22 places, 18/20 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/22 places, 18/20 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AirplaneLD-COL-0020-LTLCardinality-07 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:(AND (GT 1 (ADD s15 s16)) (LEQ s3 (ADD s15 s16)))], 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 1 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-COL-0020-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0020-LTLCardinality-07 finished in 137 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 19 transition count 18
Applied a total of 5 rules in 4 ms. Remains 19 /22 variables (removed 3) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 19 cols
[2022-05-15 23:40:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:40:08] [INFO ] Implicit Places using invariants in 28 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/22 places, 18/20 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/22 places, 18/20 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AirplaneLD-COL-0020-LTLCardinality-08 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 s8 s1)], 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]]
Product exploration explored 100000 steps with 50000 reset in 222 ms.
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-COL-0020-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-0020-LTLCardinality-08 finished in 811 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Graph (complete) has 30 edges and 22 vertex of which 5 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 14 output transitions
Drop transitions removed 14 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 3 ms. Remains 5 /22 variables (removed 17) and now considering 5/20 (removed 15) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-15 23:40:09] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:40:09] [INFO ] Implicit Places using invariants in 38 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/22 places, 5/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4/22 places, 5/20 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0020-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 (ADD s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 59 ms.
Product exploration explored 100000 steps with 50000 reset in 141 ms.
Computed a total of 4 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA AirplaneLD-COL-0020-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-0020-LTLCardinality-10 finished in 442 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((F(!(!G(p0) U p1))||p2)))))'
Support contains 10 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-15 23:40:09] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 23:40:10] [INFO ] Implicit Places using invariants in 22 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/22 places, 20/20 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 1 place count 21 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 19
Applied a total of 2 rules in 4 ms. Remains 20 /21 variables (removed 1) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 20 cols
[2022-05-15 23:40:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:40:10] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 19 rows 20 cols
[2022-05-15 23:40:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:40:10] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/22 places, 19/20 transitions.
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 19/20 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : AirplaneLD-COL-0020-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 2} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={2} source=1 dest: 2}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 2} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p2 p0 p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={2} source=2 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={1, 2} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s0 (ADD s16 s17)), p1:(LEQ (ADD s18 s19) s3), p2:(GT (ADD s9 s10) (ADD s12 s13))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 13454 reset in 197 ms.
Product exploration explored 100000 steps with 13443 reset in 202 ms.
Computed a total of 20 stabilizing places and 19 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 19
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 (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 p1)))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1))))]
Knowledge based reduction with 12 factoid took 794 ms. Reduced automaton from 3 states, 16 edges and 3 AP to 3 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 78 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 60 steps, including 7 resets, run visited all 11 properties in 2 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 p1)))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (F (NOT (AND (NOT p2) p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND p0 p2 (NOT p1))), (F (NOT (OR (NOT p0) p1))), (F (AND p2 p1)), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (AND p0 (NOT p2) p1)), (F (AND (NOT p0) p2 p1)), (F (AND p0 p2 p1))]
Knowledge based reduction with 12 factoid took 1071 ms. Reduced automaton from 3 states, 16 edges and 3 AP to 3 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 103 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
// Phase 1: matrix 19 rows 20 cols
[2022-05-15 23:40:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:40:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-15 23:40:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:40:12] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2022-05-15 23:40:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:40:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-15 23:40:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:40:12] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2022-05-15 23:40:13] [INFO ] Computed and/alt/rep : 9/17/9 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-15 23:40:13] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Support contains 10 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 19/19 (removed 0) transitions.
// Phase 1: matrix 19 rows 20 cols
[2022-05-15 23:40:13] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 23:40:13] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 19 rows 20 cols
[2022-05-15 23:40:13] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:40:13] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2022-05-15 23:40:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 20 cols
[2022-05-15 23:40:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:40:13] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 19/19 transitions.
Computed a total of 20 stabilizing places and 19 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 19
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 (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1))))]
Knowledge based reduction with 12 factoid took 666 ms. Reduced automaton from 3 states, 16 edges and 3 AP to 3 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 170 steps, including 23 resets, run visited all 11 properties in 3 ms. (steps per millisecond=56 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (F (NOT (AND (NOT p2) p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND p0 p2 (NOT p1))), (F (NOT (OR (NOT p0) p1))), (F (AND p2 p1)), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (AND p0 (NOT p2) p1)), (F (AND (NOT p0) p2 p1)), (F (AND p0 p2 p1))]
Knowledge based reduction with 12 factoid took 847 ms. Reduced automaton from 3 states, 16 edges and 3 AP to 3 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 82 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 76 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
// Phase 1: matrix 19 rows 20 cols
[2022-05-15 23:40:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:40:14] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-15 23:40:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:40:14] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-15 23:40:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:40:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-15 23:40:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:40:15] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-15 23:40:15] [INFO ] Computed and/alt/rep : 9/17/9 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 23:40:15] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 154 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 13443 reset in 224 ms.
Product exploration explored 100000 steps with 13446 reset in 146 ms.
Built C files in :
/tmp/ltsmin15054709732745429732
[2022-05-15 23:40:15] [INFO ] Computing symmetric may disable matrix : 19 transitions.
[2022-05-15 23:40:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 23:40:15] [INFO ] Computing symmetric may enable matrix : 19 transitions.
[2022-05-15 23:40:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 23:40:15] [INFO ] Computing Do-Not-Accords matrix : 19 transitions.
[2022-05-15 23:40:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 23:40:15] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15054709732745429732
Running compilation step : cd /tmp/ltsmin15054709732745429732;'/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 174 ms.
Running link step : cd /tmp/ltsmin15054709732745429732;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin15054709732745429732;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14373489953442223360.hoa' '--buchi-type=spotba'
LTSmin run took 150 ms.
FORMULA AirplaneLD-COL-0020-LTLCardinality-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AirplaneLD-COL-0020-LTLCardinality-14 finished in 6042 ms.
All properties solved by simple procedures.
Total runtime 11657 ms.

BK_STOP 1652658016411

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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-COL-0020"
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-COL-0020, 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-165245688900179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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