Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 589K Feb 26 12:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.9M Feb 26 12:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 235K Feb 26 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Feb 26 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 425K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 103K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 450K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6M Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.3M Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 554K Feb 26 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.0M Feb 26 12:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 84K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 168K Feb 25 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.3M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-00
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-01
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-02
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-03
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-04
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-05
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-06
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-07
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-08
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-09
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-10
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-11
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-12
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-13
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-14
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678346096457

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-PT-1000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 07:14:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 07:14:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 07:15:00] [INFO ] Load time of PNML (sax parser for PT used): 438 ms
[2023-03-09 07:15:00] [INFO ] Transformed 7019 places.
[2023-03-09 07:15:00] [INFO ] Transformed 8008 transitions.
[2023-03-09 07:15:00] [INFO ] Parsed PT model containing 7019 places and 8008 transitions and 30528 arcs in 716 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 458 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 3002 places and 0 transitions.
FORMULA AirplaneLD-PT-1000-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-1000-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-1000-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3016 out of 4017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4017/4017 places, 8008/8008 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4016 transition count 8008
Discarding 997 places :
Symmetric choice reduction at 1 with 997 rule applications. Total rules 998 place count 3019 transition count 7011
Iterating global reduction 1 with 997 rules applied. Total rules applied 1995 place count 3019 transition count 7011
Ensure Unique test removed 997 transitions
Reduce isomorphic transitions removed 997 transitions.
Iterating post reduction 1 with 997 rules applied. Total rules applied 2992 place count 3019 transition count 6014
Applied a total of 2992 rules in 260 ms. Remains 3019 /4017 variables (removed 998) and now considering 6014/8008 (removed 1994) transitions.
// Phase 1: matrix 6014 rows 3019 cols
[2023-03-09 07:15:02] [INFO ] Computed 2 place invariants in 906 ms
[2023-03-09 07:15:03] [INFO ] Implicit Places using invariants in 1917 ms returned []
[2023-03-09 07:15:03] [INFO ] Invariant cache hit.
[2023-03-09 07:15:05] [INFO ] Implicit Places using invariants and state equation in 1482 ms returned []
Implicit Place search using SMT with State Equation took 3492 ms to find 0 implicit places.
[2023-03-09 07:15:05] [INFO ] Invariant cache hit.
[2023-03-09 07:15:09] [INFO ] Dead Transitions using invariants and state equation in 4942 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3019/4017 places, 6014/8008 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8699 ms. Remains : 3019/4017 places, 6014/8008 transitions.
Support contains 3016 out of 3019 places after structural reductions.
[2023-03-09 07:15:10] [INFO ] Flatten gal took : 427 ms
[2023-03-09 07:15:11] [INFO ] Flatten gal took : 243 ms
[2023-03-09 07:15:11] [INFO ] Input system was already deterministic with 6014 transitions.
Support contains 3015 out of 3019 places (down from 3016) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 1261 resets, run finished after 4455 ms. (steps per millisecond=2 ) properties (out of 29) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-09 07:15:16] [INFO ] Invariant cache hit.
[2023-03-09 07:15:17] [INFO ] [Real]Absence check using 2 positive place invariants in 27 ms returned sat
[2023-03-09 07:15:20] [INFO ] After 4291ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:2
[2023-03-09 07:15:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 23 ms returned sat
[2023-03-09 07:15:21] [INFO ] After 673ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :0
Fused 9 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA AirplaneLD-PT-1000-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
FORMULA AirplaneLD-PT-1000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-1000-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-1000-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3019 stabilizing places and 6014 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3019 transition count 6014
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3017 transition count 6014
Discarding 2998 places :
Symmetric choice reduction at 1 with 2998 rule applications. Total rules 3000 place count 19 transition count 3016
Iterating global reduction 1 with 2998 rules applied. Total rules applied 5998 place count 19 transition count 3016
Ensure Unique test removed 2998 transitions
Reduce isomorphic transitions removed 2998 transitions.
Iterating post reduction 1 with 2998 rules applied. Total rules applied 8996 place count 19 transition count 18
Applied a total of 8996 rules in 114 ms. Remains 19 /3019 variables (removed 3000) and now considering 18/6014 (removed 5996) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-09 07:15:22] [INFO ] Computed 1 place invariants in 13 ms
[2023-03-09 07:15:22] [INFO ] Implicit Places using invariants in 53 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/3019 places, 18/6014 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 LTL mode , in 2 iterations and 171 ms. Remains : 18/3019 places, 18/6014 transitions.
Stuttering acceptance computed with spot in 365 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-05 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:(GT 1 s17)], 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 215 steps with 71 reset in 3 ms.
FORMULA AirplaneLD-PT-1000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLCardinality-05 finished in 644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U p1)))'
Support contains 6 out of 3019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Graph (complete) has 7530 edges and 3019 vertex of which 2011 are kept as prefixes of interest. Removing 1008 places using SCC suffix rule.35 ms
Discarding 1008 places :
Also discarding 1006 output transitions
Drop transitions removed 1006 transitions
Ensure Unique test removed 999 transitions
Reduce isomorphic transitions removed 999 transitions.
Iterating post reduction 0 with 999 rules applied. Total rules applied 1000 place count 2011 transition count 4009
Discarding 1999 places :
Symmetric choice reduction at 1 with 1999 rule applications. Total rules 2999 place count 12 transition count 2010
Iterating global reduction 1 with 1999 rules applied. Total rules applied 4998 place count 12 transition count 2010
Ensure Unique test removed 1999 transitions
Reduce isomorphic transitions removed 1999 transitions.
Iterating post reduction 1 with 1999 rules applied. Total rules applied 6997 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6997 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6999 place count 11 transition count 10
Applied a total of 6999 rules in 148 ms. Remains 11 /3019 variables (removed 3008) and now considering 10/6014 (removed 6004) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-09 07:15:22] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 07:15:22] [INFO ] Implicit Places using invariants in 34 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/3019 places, 10/6014 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 183 ms. Remains : 10/3019 places, 10/6014 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), 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={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ (ADD s6 s7) (ADD s3 s4)), p0:(LEQ s0 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 18581 reset in 159 ms.
Product exploration explored 100000 steps with 18615 reset in 159 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 10
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 3 factoid took 388 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-1000-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-1000-LTLCardinality-06 finished in 1248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(p1 U !p2)))))'
Support contains 3003 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3018 transition count 6014
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 3016 transition count 6012
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 3016 transition count 6012
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 3016 transition count 6010
Applied a total of 7 rules in 74 ms. Remains 3016 /3019 variables (removed 3) and now considering 6010/6014 (removed 4) transitions.
// Phase 1: matrix 6010 rows 3016 cols
[2023-03-09 07:15:24] [INFO ] Computed 2 place invariants in 413 ms
[2023-03-09 07:15:24] [INFO ] Implicit Places using invariants in 958 ms returned [3015]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 965 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3015/3019 places, 6010/6014 transitions.
Applied a total of 0 rules in 29 ms. Remains 3015 /3015 variables (removed 0) and now considering 6010/6010 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1069 ms. Remains : 3015/3019 places, 6010/6014 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s3014 s3011), p2:(GT 1 (ADD s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022 s102...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 63420 steps with 7951 reset in 10001 ms.
Product exploration timeout after 64490 steps with 8100 reset in 10004 ms.
Computed a total of 3015 stabilizing places and 6010 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3015 transition count 6010
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 p2 (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (OR p0 (NOT p2) p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 471 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Incomplete random walk after 10000 steps, including 1254 resets, run finished after 4169 ms. (steps per millisecond=2 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 6010 rows 3015 cols
[2023-03-09 07:15:53] [INFO ] Computed 1 place invariants in 451 ms
[2023-03-09 07:15:55] [INFO ] After 680ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 07:15:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 21 ms returned sat
[2023-03-09 07:15:59] [INFO ] After 3520ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 07:16:00] [INFO ] After 4412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 680 ms.
[2023-03-09 07:16:01] [INFO ] After 6012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 3 properties in 16 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (OR p0 (NOT p2) p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(F (AND p2 p1)), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR (NOT p2) p1 p0))), (F (AND p2 p1 (NOT p0))), (F (AND p2 (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 755 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Support contains 3003 out of 3015 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3015/3015 places, 6010/6010 transitions.
Applied a total of 0 rules in 17 ms. Remains 3015 /3015 variables (removed 0) and now considering 6010/6010 (removed 0) transitions.
[2023-03-09 07:16:02] [INFO ] Invariant cache hit.
[2023-03-09 07:16:03] [INFO ] Implicit Places using invariants in 622 ms returned []
[2023-03-09 07:16:03] [INFO ] Invariant cache hit.
[2023-03-09 07:16:04] [INFO ] Implicit Places using invariants and state equation in 1178 ms returned []
Implicit Place search using SMT with State Equation took 1807 ms to find 0 implicit places.
[2023-03-09 07:16:04] [INFO ] Invariant cache hit.
[2023-03-09 07:16:07] [INFO ] Dead Transitions using invariants and state equation in 3062 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4888 ms. Remains : 3015/3015 places, 6010/6010 transitions.
Computed a total of 3015 stabilizing places and 6010 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3015 transition count 6010
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 p1) p0), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR (NOT p2) p1 p0)), (X (NOT (AND p2 p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 525 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Incomplete random walk after 10000 steps, including 1272 resets, run finished after 3679 ms. (steps per millisecond=2 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 07:16:14] [INFO ] Invariant cache hit.
[2023-03-09 07:16:16] [INFO ] After 629ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 07:16:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-09 07:16:20] [INFO ] After 2801ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 07:16:21] [INFO ] After 3858ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 621 ms.
[2023-03-09 07:16:21] [INFO ] After 5349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 3 properties in 6 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR (NOT p2) p1 p0)), (X (NOT (AND p2 p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 p2)), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR p1 p0 (NOT p2)))), (F (AND p1 (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) p2))]
Knowledge based reduction with 7 factoid took 634 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Product exploration timeout after 55010 steps with 6928 reset in 10001 ms.
Product exploration timeout after 56180 steps with 7095 reset in 10002 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Support contains 3003 out of 3015 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3015/3015 places, 6010/6010 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 3015 transition count 6010
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3015 transition count 6010
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 295 ms. Remains 3015 /3015 variables (removed 0) and now considering 6010/6010 (removed 0) transitions.
[2023-03-09 07:16:44] [INFO ] Redundant transitions in 465 ms returned []
// Phase 1: matrix 6010 rows 3015 cols
[2023-03-09 07:16:45] [INFO ] Computed 1 place invariants in 426 ms
[2023-03-09 07:16:48] [INFO ] Dead Transitions using invariants and state equation in 3458 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3015/3015 places, 6010/6010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4231 ms. Remains : 3015/3015 places, 6010/6010 transitions.
Support contains 3003 out of 3015 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3015/3015 places, 6010/6010 transitions.
Applied a total of 0 rules in 10 ms. Remains 3015 /3015 variables (removed 0) and now considering 6010/6010 (removed 0) transitions.
// Phase 1: matrix 6010 rows 3015 cols
[2023-03-09 07:16:48] [INFO ] Computed 1 place invariants in 395 ms
[2023-03-09 07:16:49] [INFO ] Implicit Places using invariants in 955 ms returned []
[2023-03-09 07:16:49] [INFO ] Invariant cache hit.
[2023-03-09 07:16:50] [INFO ] Implicit Places using invariants and state equation in 1718 ms returned []
Implicit Place search using SMT with State Equation took 2701 ms to find 0 implicit places.
[2023-03-09 07:16:50] [INFO ] Invariant cache hit.
[2023-03-09 07:16:53] [INFO ] Dead Transitions using invariants and state equation in 3063 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5793 ms. Remains : 3015/3015 places, 6010/6010 transitions.
Treatment of property AirplaneLD-PT-1000-LTLCardinality-07 finished in 90573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p1)))))'
Support contains 3 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3017 transition count 6014
Discarding 2998 places :
Symmetric choice reduction at 1 with 2998 rule applications. Total rules 3000 place count 19 transition count 3016
Iterating global reduction 1 with 2998 rules applied. Total rules applied 5998 place count 19 transition count 3016
Ensure Unique test removed 2998 transitions
Reduce isomorphic transitions removed 2998 transitions.
Iterating post reduction 1 with 2998 rules applied. Total rules applied 8996 place count 19 transition count 18
Applied a total of 8996 rules in 56 ms. Remains 19 /3019 variables (removed 3000) and now considering 18/6014 (removed 5996) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-09 07:16:54] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 07:16:54] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-09 07:16:54] [INFO ] Invariant cache hit.
[2023-03-09 07:16:54] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-09 07:16:54] [INFO ] Invariant cache hit.
[2023-03-09 07:16:54] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/3019 places, 18/6014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 261 ms. Remains : 19/3019 places, 18/6014 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s18 s11), p1:(LEQ s8 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 18288 reset in 71 ms.
Product exploration explored 100000 steps with 18306 reset in 74 ms.
Computed a total of 19 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 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 : [(AND (NOT p0) p1), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 469 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F p0)]
Knowledge based reduction with 3 factoid took 402 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2023-03-09 07:16:56] [INFO ] Invariant cache hit.
[2023-03-09 07:16:56] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 07:16:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:16:56] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-09 07:16:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:16:56] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-09 07:16:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:16:56] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-09 07:16:56] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 07:16:56] [INFO ] Added : 0 causal constraints over 0 iterations in 37 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 19 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Graph (complete) has 17 edges and 19 vertex of which 5 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 12 output transitions
Drop transitions removed 12 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 4 transition count 4
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 4 transition count 4
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 4 transition count 3
Applied a total of 5 rules in 1 ms. Remains 4 /19 variables (removed 15) and now considering 3/18 (removed 15) transitions.
// Phase 1: matrix 3 rows 4 cols
[2023-03-09 07:16:56] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 07:16:56] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-09 07:16:56] [INFO ] Invariant cache hit.
[2023-03-09 07:16:56] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-09 07:16:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 07:16:56] [INFO ] Invariant cache hit.
[2023-03-09 07:16:56] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/19 places, 3/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 4/19 places, 3/18 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 202 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 295 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-09 07:16:57] [INFO ] Invariant cache hit.
[2023-03-09 07:16:57] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 07:16:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:16:57] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-09 07:16:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:16:57] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-09 07:16:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:16:57] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-09 07:16:57] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 07:16:57] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 39954 reset in 84 ms.
Product exploration explored 100000 steps with 40011 reset in 52 ms.
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 1 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 0 ms. Remains 3 /4 variables (removed 1) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 3 cols
[2023-03-09 07:16:57] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 07:16:57] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-09 07:16:57] [INFO ] Invariant cache hit.
[2023-03-09 07:16:57] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-09 07:16:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 07:16:57] [INFO ] Invariant cache hit.
[2023-03-09 07:16:57] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/4 places, 2/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188 ms. Remains : 3/4 places, 2/3 transitions.
Treatment of property AirplaneLD-PT-1000-LTLCardinality-08 finished in 3349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 3019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Graph (complete) has 7530 edges and 3019 vertex of which 1 are kept as prefixes of interest. Removing 3018 places using SCC suffix rule.7 ms
Discarding 3018 places :
Also discarding 5014 output transitions
Drop transitions removed 5014 transitions
Ensure Unique test removed 999 transitions
Reduce isomorphic transitions removed 999 transitions.
Iterating post reduction 0 with 999 rules applied. Total rules applied 1000 place count 1 transition count 1
Applied a total of 1000 rules in 28 ms. Remains 1 /3019 variables (removed 3018) and now considering 1/6014 (removed 6013) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-09 07:16:57] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 07:16:57] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-09 07:16:57] [INFO ] Invariant cache hit.
[2023-03-09 07:16:57] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-09 07:16:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 07:16:57] [INFO ] Invariant cache hit.
[2023-03-09 07:16:58] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/3019 places, 1/6014 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 1/3019 places, 1/6014 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-09 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 1 s0)], 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 0 ms.
FORMULA AirplaneLD-PT-1000-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLCardinality-09 finished in 323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Support contains 3 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3017 transition count 6014
Discarding 2996 places :
Symmetric choice reduction at 1 with 2996 rule applications. Total rules 2998 place count 21 transition count 3018
Iterating global reduction 1 with 2996 rules applied. Total rules applied 5994 place count 21 transition count 3018
Ensure Unique test removed 2996 transitions
Reduce isomorphic transitions removed 2996 transitions.
Iterating post reduction 1 with 2996 rules applied. Total rules applied 8990 place count 21 transition count 22
Applied a total of 8990 rules in 74 ms. Remains 21 /3019 variables (removed 2998) and now considering 22/6014 (removed 5992) transitions.
// Phase 1: matrix 22 rows 21 cols
[2023-03-09 07:16:58] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 07:16:58] [INFO ] Implicit Places using invariants in 99 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 100 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/3019 places, 22/6014 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 174 ms. Remains : 20/3019 places, 22/6014 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(LEQ 1 s6), p0:(GT s3 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-1000-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLCardinality-10 finished in 394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(G(p1)||F(!p0))&&(F(!p0)||X(p2))))))'
Support contains 5 out of 3019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Graph (complete) has 7530 edges and 3019 vertex of which 3017 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 2997 places :
Symmetric choice reduction at 0 with 2997 rule applications. Total rules 2998 place count 20 transition count 3017
Iterating global reduction 0 with 2997 rules applied. Total rules applied 5995 place count 20 transition count 3017
Ensure Unique test removed 2997 transitions
Reduce isomorphic transitions removed 2997 transitions.
Iterating post reduction 0 with 2997 rules applied. Total rules applied 8992 place count 20 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8992 place count 20 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8994 place count 19 transition count 19
Applied a total of 8994 rules in 79 ms. Remains 19 /3019 variables (removed 3000) and now considering 19/6014 (removed 5995) transitions.
// Phase 1: matrix 19 rows 19 cols
[2023-03-09 07:16:58] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 07:16:58] [INFO ] Implicit Places using invariants in 28 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/3019 places, 19/6014 transitions.
Graph (complete) has 17 edges and 18 vertex of which 17 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
Applied a total of 1 rules in 1 ms. Remains 17 /18 variables (removed 1) and now considering 18/19 (removed 1) transitions.
// Phase 1: matrix 18 rows 17 cols
[2023-03-09 07:16:58] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 07:16:58] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-09 07:16:58] [INFO ] Invariant cache hit.
[2023-03-09 07:16:58] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 143 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/3019 places, 18/6014 transitions.
Applied a total of 0 rules in 4 ms. Remains 16 /16 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 256 ms. Remains : 16/3019 places, 18/6014 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s14 s12), p0:(LEQ s2 s12), p2:(LEQ s15 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-1000-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLCardinality-11 finished in 437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 3 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3018 transition count 6014
Discarding 2997 places :
Symmetric choice reduction at 1 with 2997 rule applications. Total rules 2998 place count 21 transition count 3017
Iterating global reduction 1 with 2997 rules applied. Total rules applied 5995 place count 21 transition count 3017
Ensure Unique test removed 2997 transitions
Reduce isomorphic transitions removed 2997 transitions.
Iterating post reduction 1 with 2997 rules applied. Total rules applied 8992 place count 21 transition count 20
Applied a total of 8992 rules in 43 ms. Remains 21 /3019 variables (removed 2998) and now considering 20/6014 (removed 5994) transitions.
// Phase 1: matrix 20 rows 21 cols
[2023-03-09 07:16:59] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 07:16:59] [INFO ] Implicit Places using invariants in 35 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/3019 places, 20/6014 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 20/3019 places, 20/6014 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 1 s16), p0:(LEQ s19 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-1000-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLCardinality-12 finished in 255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 2 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3018 transition count 6014
Discarding 2998 places :
Symmetric choice reduction at 1 with 2998 rule applications. Total rules 2999 place count 20 transition count 3016
Iterating global reduction 1 with 2998 rules applied. Total rules applied 5997 place count 20 transition count 3016
Ensure Unique test removed 2998 transitions
Reduce isomorphic transitions removed 2998 transitions.
Iterating post reduction 1 with 2998 rules applied. Total rules applied 8995 place count 20 transition count 18
Applied a total of 8995 rules in 44 ms. Remains 20 /3019 variables (removed 2999) and now considering 18/6014 (removed 5996) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-09 07:16:59] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 07:16:59] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-09 07:16:59] [INFO ] Invariant cache hit.
[2023-03-09 07:16:59] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-09 07:16:59] [INFO ] Invariant cache hit.
[2023-03-09 07:16:59] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/3019 places, 18/6014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 187 ms. Remains : 20/3019 places, 18/6014 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ s19 s15), p0:(GT 1 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 16235 reset in 121 ms.
Product exploration explored 100000 steps with 16253 reset in 80 ms.
Computed a total of 20 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 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 : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 693 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1)]
Knowledge based reduction with 6 factoid took 551 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
[2023-03-09 07:17:01] [INFO ] Invariant cache hit.
[2023-03-09 07:17:01] [INFO ] [Real]Absence check using 2 positive place invariants in 36 ms returned sat
[2023-03-09 07:17:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:17:01] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2023-03-09 07:17:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:17:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-09 07:17:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:17:01] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-09 07:17:01] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-09 07:17:01] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /20 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 19 cols
[2023-03-09 07:17:01] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 07:17:01] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-09 07:17:01] [INFO ] Invariant cache hit.
[2023-03-09 07:17:01] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 154 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/20 places, 17/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 157 ms. Remains : 18/20 places, 17/18 transitions.
Computed a total of 18 stabilizing places and 17 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 17
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 p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 3 factoid took 331 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1)]
// Phase 1: matrix 17 rows 18 cols
[2023-03-09 07:17:02] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 07:17:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 07:17:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:17:02] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-09 07:17:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:17:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-09 07:17:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:17:03] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-09 07:17:03] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 07:17:03] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 68 ms :[(NOT p1)]
Product exploration explored 100000 steps with 18170 reset in 83 ms.
Product exploration explored 100000 steps with 18187 reset in 66 ms.
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 17/17 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2023-03-09 07:17:03] [INFO ] Invariant cache hit.
[2023-03-09 07:17:03] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-09 07:17:03] [INFO ] Invariant cache hit.
[2023-03-09 07:17:03] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-09 07:17:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 07:17:03] [INFO ] Invariant cache hit.
[2023-03-09 07:17:03] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 315 ms. Remains : 18/18 places, 17/17 transitions.
Treatment of property AirplaneLD-PT-1000-LTLCardinality-15 finished in 4527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(p1 U !p2)))))'
Found a Lengthening insensitive property : AirplaneLD-PT-1000-LTLCardinality-07
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Support contains 3003 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Graph (complete) has 7530 edges and 3019 vertex of which 3018 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 3016 transition count 6012
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 3016 transition count 6012
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 7 place count 3016 transition count 6010
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 7 place count 3016 transition count 6009
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 3015 transition count 6009
Applied a total of 9 rules in 138 ms. Remains 3015 /3019 variables (removed 4) and now considering 6009/6014 (removed 5) transitions.
// Phase 1: matrix 6009 rows 3015 cols
[2023-03-09 07:17:04] [INFO ] Computed 2 place invariants in 381 ms
[2023-03-09 07:17:05] [INFO ] Implicit Places using invariants in 1139 ms returned [3014]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1145 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 3014/3019 places, 6009/6014 transitions.
Applied a total of 0 rules in 56 ms. Remains 3014 /3014 variables (removed 0) and now considering 6009/6009 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1339 ms. Remains : 3014/3019 places, 6009/6014 transitions.
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s3013 s3010), p2:(GT 1 (ADD s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s102...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 56750 steps with 8186 reset in 10001 ms.
Product exploration timeout after 57640 steps with 8316 reset in 10001 ms.
Computed a total of 3014 stabilizing places and 6009 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3014 transition count 6009
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 p2 (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (OR p0 (NOT p2) p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 648 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Incomplete random walk after 10000 steps, including 1438 resets, run finished after 4331 ms. (steps per millisecond=2 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 6009 rows 3014 cols
[2023-03-09 07:17:33] [INFO ] Computed 1 place invariants in 461 ms
[2023-03-09 07:17:35] [INFO ] After 421ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 07:17:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-09 07:17:38] [INFO ] After 2635ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 07:17:39] [INFO ] After 3472ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 524 ms.
[2023-03-09 07:17:39] [INFO ] After 4599ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 3 properties in 5 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (OR p0 (NOT p2) p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(F (AND p2 p1)), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR (NOT p2) p1 p0))), (F (AND p2 p1 (NOT p0))), (F (AND p2 (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 493 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Support contains 3003 out of 3014 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3014/3014 places, 6009/6009 transitions.
Applied a total of 0 rules in 12 ms. Remains 3014 /3014 variables (removed 0) and now considering 6009/6009 (removed 0) transitions.
[2023-03-09 07:17:40] [INFO ] Invariant cache hit.
[2023-03-09 07:17:41] [INFO ] Implicit Places using invariants in 670 ms returned []
[2023-03-09 07:17:41] [INFO ] Invariant cache hit.
[2023-03-09 07:17:42] [INFO ] Implicit Places using invariants and state equation in 1389 ms returned []
Implicit Place search using SMT with State Equation took 2062 ms to find 0 implicit places.
[2023-03-09 07:17:42] [INFO ] Invariant cache hit.
[2023-03-09 07:17:45] [INFO ] Dead Transitions using invariants and state equation in 2963 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5037 ms. Remains : 3014/3014 places, 6009/6009 transitions.
Computed a total of 3014 stabilizing places and 6009 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3014 transition count 6009
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 p1) p0), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR (NOT p2) p1 p0)), (X (NOT (AND p2 p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 323 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Incomplete random walk after 10000 steps, including 1437 resets, run finished after 3966 ms. (steps per millisecond=2 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 07:17:53] [INFO ] Invariant cache hit.
[2023-03-09 07:17:54] [INFO ] After 835ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 07:17:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-09 07:17:59] [INFO ] After 3866ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 07:18:00] [INFO ] After 4887ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 590 ms.
[2023-03-09 07:18:01] [INFO ] After 6310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 3 properties in 5 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR (NOT p2) p1 p0)), (X (NOT (AND p2 p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 p2)), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR p1 p0 (NOT p2)))), (F (AND p1 (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) p2))]
Knowledge based reduction with 7 factoid took 638 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Product exploration timeout after 50670 steps with 7329 reset in 10001 ms.
Product exploration timeout after 51190 steps with 7384 reset in 10001 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Support contains 3003 out of 3014 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3014/3014 places, 6009/6009 transitions.
Applied a total of 0 rules in 145 ms. Remains 3014 /3014 variables (removed 0) and now considering 6009/6009 (removed 0) transitions.
[2023-03-09 07:18:23] [INFO ] Redundant transitions in 532 ms returned []
[2023-03-09 07:18:23] [INFO ] Invariant cache hit.
[2023-03-09 07:18:26] [INFO ] Dead Transitions using invariants and state equation in 3106 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3793 ms. Remains : 3014/3014 places, 6009/6009 transitions.
Support contains 3003 out of 3014 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3014/3014 places, 6009/6009 transitions.
Applied a total of 0 rules in 11 ms. Remains 3014 /3014 variables (removed 0) and now considering 6009/6009 (removed 0) transitions.
[2023-03-09 07:18:26] [INFO ] Invariant cache hit.
[2023-03-09 07:18:27] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-09 07:18:27] [INFO ] Invariant cache hit.
[2023-03-09 07:18:28] [INFO ] Implicit Places using invariants and state equation in 1163 ms returned []
Implicit Place search using SMT with State Equation took 1602 ms to find 0 implicit places.
[2023-03-09 07:18:28] [INFO ] Invariant cache hit.
[2023-03-09 07:18:32] [INFO ] Dead Transitions using invariants and state equation in 3920 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5553 ms. Remains : 3014/3014 places, 6009/6009 transitions.
Treatment of property AirplaneLD-PT-1000-LTLCardinality-07 finished in 88693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p1)))))'
Found a Shortening insensitive property : AirplaneLD-PT-1000-LTLCardinality-08
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Graph (complete) has 7530 edges and 3019 vertex of which 5 are kept as prefixes of interest. Removing 3014 places using SCC suffix rule.6 ms
Discarding 3014 places :
Also discarding 6008 output transitions
Drop transitions removed 6008 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 4 transition count 4
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 4 transition count 4
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 4 transition count 3
Applied a total of 5 rules in 19 ms. Remains 4 /3019 variables (removed 3015) and now considering 3/6014 (removed 6011) transitions.
// Phase 1: matrix 3 rows 4 cols
[2023-03-09 07:18:32] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 07:18:32] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-09 07:18:32] [INFO ] Invariant cache hit.
[2023-03-09 07:18:32] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-09 07:18:32] [INFO ] Invariant cache hit.
[2023-03-09 07:18:32] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 4/3019 places, 3/6014 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 215 ms. Remains : 4/3019 places, 3/6014 transitions.
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s3 s1), p1:(LEQ s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 26676 reset in 61 ms.
Product exploration explored 100000 steps with 26647 reset in 49 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
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), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 516 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F p0)]
Knowledge based reduction with 3 factoid took 545 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0)]
[2023-03-09 07:18:34] [INFO ] Invariant cache hit.
[2023-03-09 07:18:34] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 07:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:18:34] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2023-03-09 07:18:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:18:34] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-09 07:18:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:18:34] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-09 07:18:34] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 07:18:34] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 4 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-09 07:18:34] [INFO ] Invariant cache hit.
[2023-03-09 07:18:34] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-09 07:18:34] [INFO ] Invariant cache hit.
[2023-03-09 07:18:34] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-09 07:18:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 07:18:34] [INFO ] Invariant cache hit.
[2023-03-09 07:18:34] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 4/4 places, 3/3 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 251 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 393 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
[2023-03-09 07:18:35] [INFO ] Invariant cache hit.
[2023-03-09 07:18:35] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-09 07:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:18:35] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-09 07:18:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:18:35] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 07:18:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:18:35] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-09 07:18:35] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-09 07:18:35] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Product exploration explored 100000 steps with 39998 reset in 76 ms.
Product exploration explored 100000 steps with 39967 reset in 55 ms.
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 1 edges and 4 vertex of which 3 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
Applied a total of 1 rules in 1 ms. Remains 3 /4 variables (removed 1) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 3 cols
[2023-03-09 07:18:36] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 07:18:36] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-09 07:18:36] [INFO ] Invariant cache hit.
[2023-03-09 07:18:36] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-09 07:18:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 07:18:36] [INFO ] Invariant cache hit.
[2023-03-09 07:18:36] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/4 places, 2/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 3/4 places, 2/3 transitions.
Treatment of property AirplaneLD-PT-1000-LTLCardinality-08 finished in 3999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
[2023-03-09 07:18:36] [INFO ] Flatten gal took : 238 ms
[2023-03-09 07:18:36] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-09 07:18:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3019 places, 6014 transitions and 16537 arcs took 29 ms.
Total runtime 217169 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AirplaneLD-PT-1000
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/377
LTLCardinality

FORMULA AirplaneLD-PT-1000-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-1000-LTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678346438806

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/377/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/377/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/377/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 9 (type SKEL/SRCH) for 0 AirplaneLD-PT-1000-LTLCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 9 (type SKEL/SRCH) for AirplaneLD-PT-1000-LTLCardinality-07
lola: result : false
lola: markings : 46
lola: fired transitions : 68
lola: time used : 0.000000
lola: memory pages used : 1
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 10 (type SKEL/SRCH) for 6 AirplaneLD-PT-1000-LTLCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 10 (type SKEL/SRCH) for AirplaneLD-PT-1000-LTLCardinality-15
lola: result : true
lola: markings : 799
lola: fired transitions : 2814
lola: time used : 0.000000
lola: memory pages used : 1
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 11 (type SKEL/SRCH) for 3 AirplaneLD-PT-1000-LTLCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 11 (type SKEL/SRCH) for AirplaneLD-PT-1000-LTLCardinality-08
lola: result : true
lola: markings : 647
lola: fired transitions : 1836
lola: time used : 0.000000
lola: memory pages used : 1
lola: planning for AirplaneLD-PT-1000-LTLCardinality-15 stopped (result already fixed).
lola: planning for AirplaneLD-PT-1000-LTLCardinality-08 stopped (result already fixed).
lola: LAUNCH task # 1 (type EXCL) for 0 AirplaneLD-PT-1000-LTLCardinality-07
lola: time limit : 3597 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 3/3597 3/32 AirplaneLD-PT-1000-LTLCardinality-07 57629 m, 11525 m/sec, 134946 t fired, .

Time elapsed: 6 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 8/3597 5/32 AirplaneLD-PT-1000-LTLCardinality-07 130312 m, 14536 m/sec, 307048 t fired, .

Time elapsed: 11 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 13/3597 6/32 AirplaneLD-PT-1000-LTLCardinality-07 170744 m, 8086 m/sec, 480078 t fired, .

Time elapsed: 16 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 18/3597 8/32 AirplaneLD-PT-1000-LTLCardinality-07 233698 m, 12590 m/sec, 653115 t fired, .

Time elapsed: 21 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 23/3597 9/32 AirplaneLD-PT-1000-LTLCardinality-07 303679 m, 13996 m/sec, 815135 t fired, .

Time elapsed: 26 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 28/3597 10/32 AirplaneLD-PT-1000-LTLCardinality-07 344277 m, 8119 m/sec, 982069 t fired, .

Time elapsed: 31 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 33/3597 11/32 AirplaneLD-PT-1000-LTLCardinality-07 402035 m, 11551 m/sec, 1151638 t fired, .

Time elapsed: 36 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 38/3597 13/32 AirplaneLD-PT-1000-LTLCardinality-07 471973 m, 13987 m/sec, 1314646 t fired, .

Time elapsed: 41 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 43/3597 14/32 AirplaneLD-PT-1000-LTLCardinality-07 517034 m, 9012 m/sec, 1484086 t fired, .

Time elapsed: 46 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 48/3597 15/32 AirplaneLD-PT-1000-LTLCardinality-07 573928 m, 11378 m/sec, 1654251 t fired, .

Time elapsed: 51 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 53/3597 16/32 AirplaneLD-PT-1000-LTLCardinality-07 644599 m, 14134 m/sec, 1819313 t fired, .

Time elapsed: 56 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 58/3597 17/32 AirplaneLD-PT-1000-LTLCardinality-07 690151 m, 9110 m/sec, 1989188 t fired, .

Time elapsed: 61 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 63/3597 19/32 AirplaneLD-PT-1000-LTLCardinality-07 744804 m, 10930 m/sec, 2158920 t fired, .

Time elapsed: 66 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 68/3597 20/32 AirplaneLD-PT-1000-LTLCardinality-07 813845 m, 13808 m/sec, 2325744 t fired, .

Time elapsed: 71 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 73/3597 21/32 AirplaneLD-PT-1000-LTLCardinality-07 863973 m, 10025 m/sec, 2490578 t fired, .

Time elapsed: 76 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 78/3597 23/32 AirplaneLD-PT-1000-LTLCardinality-07 916123 m, 10430 m/sec, 2662228 t fired, .

Time elapsed: 81 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 83/3597 24/32 AirplaneLD-PT-1000-LTLCardinality-07 982714 m, 13318 m/sec, 2831159 t fired, .

Time elapsed: 86 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 88/3597 25/32 AirplaneLD-PT-1000-LTLCardinality-07 1038296 m, 11116 m/sec, 2998157 t fired, .

Time elapsed: 91 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 93/3597 26/32 AirplaneLD-PT-1000-LTLCardinality-07 1086791 m, 9699 m/sec, 3168145 t fired, .

Time elapsed: 96 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 98/3597 28/32 AirplaneLD-PT-1000-LTLCardinality-07 1149807 m, 12603 m/sec, 3332595 t fired, .

Time elapsed: 101 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 103/3597 29/32 AirplaneLD-PT-1000-LTLCardinality-07 1208930 m, 11824 m/sec, 3501985 t fired, .

Time elapsed: 106 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 108/3597 30/32 AirplaneLD-PT-1000-LTLCardinality-07 1254903 m, 9194 m/sec, 3672905 t fired, .

Time elapsed: 111 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 113/3597 32/32 AirplaneLD-PT-1000-LTLCardinality-07 1322008 m, 13421 m/sec, 3836416 t fired, .

Time elapsed: 116 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for AirplaneLD-PT-1000-LTLCardinality-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AirplaneLD-PT-1000-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 121 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AirplaneLD-PT-1000-LTLCardinality-07: LTL unknown AGGR
AirplaneLD-PT-1000-LTLCardinality-08: LTL true skeleton: LTL model checker
AirplaneLD-PT-1000-LTLCardinality-15: LTL true skeleton: LTL model checker


Time elapsed: 121 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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