Execution Chart

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

Trace from the execution

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

--------------------
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 1678508410733

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-PT-1000
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-11 04:20:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 04:20:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 04:20:13] [INFO ] Load time of PNML (sax parser for PT used): 365 ms
[2023-03-11 04:20:13] [INFO ] Transformed 7019 places.
[2023-03-11 04:20:13] [INFO ] Transformed 8008 transitions.
[2023-03-11 04:20:13] [INFO ] Parsed PT model containing 7019 places and 8008 transitions and 30528 arcs in 503 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 387 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 296 ms. Remains 3019 /4017 variables (removed 998) and now considering 6014/8008 (removed 1994) transitions.
// Phase 1: matrix 6014 rows 3019 cols
[2023-03-11 04:20:15] [INFO ] Computed 2 place invariants in 886 ms
[2023-03-11 04:20:16] [INFO ] Implicit Places using invariants in 1529 ms returned []
[2023-03-11 04:20:16] [INFO ] Invariant cache hit.
[2023-03-11 04:20:17] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 2645 ms to find 0 implicit places.
[2023-03-11 04:20:17] [INFO ] Invariant cache hit.
[2023-03-11 04:20:21] [INFO ] Dead Transitions using invariants and state equation in 3661 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 6608 ms. Remains : 3019/4017 places, 6014/8008 transitions.
Support contains 3016 out of 3019 places after structural reductions.
[2023-03-11 04:20:21] [INFO ] Flatten gal took : 304 ms
[2023-03-11 04:20:21] [INFO ] Flatten gal took : 205 ms
[2023-03-11 04:20:22] [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 1259 resets, run finished after 2183 ms. (steps per millisecond=4 ) properties (out of 29) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) 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 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) 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 10) 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 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-11 04:20:24] [INFO ] Invariant cache hit.
[2023-03-11 04:20:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-11 04:20:28] [INFO ] After 4076ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:2
[2023-03-11 04:20:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2023-03-11 04:20:29] [INFO ] After 674ms 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 49 ms. Remains 19 /3019 variables (removed 3000) and now considering 18/6014 (removed 5996) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-11 04:20:30] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 04:20:30] [INFO ] Implicit Places using invariants in 166 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 168 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 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 217 ms. Remains : 18/3019 places, 18/6014 transitions.
Stuttering acceptance computed with spot in 312 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 179 steps with 59 reset in 2 ms.
FORMULA AirplaneLD-PT-1000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLCardinality-05 finished in 616 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.16 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 121 ms. Remains 11 /3019 variables (removed 3008) and now considering 10/6014 (removed 6004) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-11 04:20:30] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 04:20:30] [INFO ] Implicit Places using invariants in 56 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 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 181 ms. Remains : 10/3019 places, 10/6014 transitions.
Stuttering acceptance computed with spot in 165 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 18596 reset in 204 ms.
Product exploration explored 100000 steps with 18638 reset in 137 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 354 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 1108 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 67 ms. Remains 3016 /3019 variables (removed 3) and now considering 6010/6014 (removed 4) transitions.
// Phase 1: matrix 6010 rows 3016 cols
[2023-03-11 04:20:32] [INFO ] Computed 2 place invariants in 394 ms
[2023-03-11 04:20:32] [INFO ] Implicit Places using invariants in 833 ms returned [3015]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 836 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 30 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 936 ms. Remains : 3015/3019 places, 6010/6014 transitions.
Stuttering acceptance computed with spot in 192 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 63540 steps with 7995 reset in 10001 ms.
Product exploration timeout after 64360 steps with 8118 reset in 10001 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 354 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 169 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Incomplete random walk after 10000 steps, including 1261 resets, run finished after 4709 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 328 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 297 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 301 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-11 04:21:01] [INFO ] Computed 1 place invariants in 420 ms
[2023-03-11 04:21:02] [INFO ] After 600ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 04:21:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 26 ms returned sat
[2023-03-11 04:21:08] [INFO ] After 5272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 04:21:10] [INFO ] After 6356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 620 ms.
[2023-03-11 04:21:10] [INFO ] After 7819ms 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 12 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 951 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 174 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 191 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 14 ms. Remains 3015 /3015 variables (removed 0) and now considering 6010/6010 (removed 0) transitions.
[2023-03-11 04:21:12] [INFO ] Invariant cache hit.
[2023-03-11 04:21:12] [INFO ] Implicit Places using invariants in 713 ms returned []
[2023-03-11 04:21:12] [INFO ] Invariant cache hit.
[2023-03-11 04:21:13] [INFO ] Implicit Places using invariants and state equation in 1020 ms returned []
Implicit Place search using SMT with State Equation took 1753 ms to find 0 implicit places.
[2023-03-11 04:21:13] [INFO ] Invariant cache hit.
[2023-03-11 04:21:16] [INFO ] Dead Transitions using invariants and state equation in 3046 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4831 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 594 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 190 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Incomplete random walk after 10000 steps, including 1259 resets, run finished after 3525 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 300 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 299 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 299 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 04:21:24] [INFO ] Invariant cache hit.
[2023-03-11 04:21:25] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 04:21:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 26 ms returned sat
[2023-03-11 04:21:28] [INFO ] After 2634ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 04:21:29] [INFO ] After 3603ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 577 ms.
[2023-03-11 04:21:30] [INFO ] After 4930ms 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 7 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 615 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 239 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Product exploration timeout after 56660 steps with 7126 reset in 10001 ms.
Product exploration timeout after 56840 steps with 7144 reset in 10002 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 243 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 0 ms
Applied a total of 1 rules in 254 ms. Remains 3015 /3015 variables (removed 0) and now considering 6010/6010 (removed 0) transitions.
[2023-03-11 04:21:53] [INFO ] Redundant transitions in 484 ms returned []
// Phase 1: matrix 6010 rows 3015 cols
[2023-03-11 04:21:53] [INFO ] Computed 1 place invariants in 401 ms
[2023-03-11 04:21:56] [INFO ] Dead Transitions using invariants and state equation in 3079 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 3825 ms. Remains : 3015/3015 places, 6010/6010 transitions.
Built C files in :
/tmp/ltsmin13104390622103709941
[2023-03-11 04:21:56] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13104390622103709941
Running compilation step : cd /tmp/ltsmin13104390622103709941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13104390622103709941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13104390622103709941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
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 33 ms. Remains 3015 /3015 variables (removed 0) and now considering 6010/6010 (removed 0) transitions.
// Phase 1: matrix 6010 rows 3015 cols
[2023-03-11 04:21:59] [INFO ] Computed 1 place invariants in 394 ms
[2023-03-11 04:22:00] [INFO ] Implicit Places using invariants in 1129 ms returned []
[2023-03-11 04:22:00] [INFO ] Invariant cache hit.
[2023-03-11 04:22:01] [INFO ] Implicit Places using invariants and state equation in 1108 ms returned []
Implicit Place search using SMT with State Equation took 2240 ms to find 0 implicit places.
[2023-03-11 04:22:01] [INFO ] Invariant cache hit.
[2023-03-11 04:22:04] [INFO ] Dead Transitions using invariants and state equation in 2614 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4898 ms. Remains : 3015/3015 places, 6010/6010 transitions.
Built C files in :
/tmp/ltsmin9621178232290823248
[2023-03-11 04:22:04] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9621178232290823248
Running compilation step : cd /tmp/ltsmin9621178232290823248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9621178232290823248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9621178232290823248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 04:22:07] [INFO ] Flatten gal took : 176 ms
[2023-03-11 04:22:08] [INFO ] Flatten gal took : 152 ms
[2023-03-11 04:22:08] [INFO ] Time to serialize gal into /tmp/LTL9446438235243297110.gal : 34 ms
[2023-03-11 04:22:08] [INFO ] Time to serialize properties into /tmp/LTL15918973767155656680.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9446438235243297110.gal' '-t' 'CGAL' '-hoa' '/tmp/aut503466229445861336.hoa' '-atoms' '/tmp/LTL15918973767155656680.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL15918973767155656680.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut503466229445861336.hoa
Detected timeout of ITS tools.
[2023-03-11 04:22:23] [INFO ] Flatten gal took : 138 ms
[2023-03-11 04:22:23] [INFO ] Flatten gal took : 139 ms
[2023-03-11 04:22:23] [INFO ] Time to serialize gal into /tmp/LTL13293573299968196195.gal : 23 ms
[2023-03-11 04:22:23] [INFO ] Time to serialize properties into /tmp/LTL3146210142736560385.ltl : 20 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13293573299968196195.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3146210142736560385.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("(P2<=P6)")||(("(stp4<=((((((((((Speed_Left_Wheel_1+Speed_Left_Wheel_2)+(Speed_Left_Wheel_3+Speed_Left_Wheel_4))+((Speed_Left_...59850
Formula 0 simplified : XF(!"(P2<=P6)" & (!"(stp4<=((((((((((Speed_Left_Wheel_1+Speed_Left_Wheel_2)+(Speed_Left_Wheel_3+Speed_Left_Wheel_4))+((Speed_Left_Wh...59845
Detected timeout of ITS tools.
[2023-03-11 04:22:38] [INFO ] Flatten gal took : 145 ms
[2023-03-11 04:22:38] [INFO ] Applying decomposition
[2023-03-11 04:22:39] [INFO ] Flatten gal took : 134 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11898088863331609281.txt' '-o' '/tmp/graph11898088863331609281.bin' '-w' '/tmp/graph11898088863331609281.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11898088863331609281.bin' '-l' '-1' '-v' '-w' '/tmp/graph11898088863331609281.weights' '-q' '0' '-e' '0.001'
[2023-03-11 04:22:46] [INFO ] Decomposing Gal with order
[2023-03-11 04:22:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 04:22:50] [INFO ] Removed a total of 4495 redundant transitions.
[2023-03-11 04:22:50] [INFO ] Flatten gal took : 3532 ms
[2023-03-11 04:22:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 3000 labels/synchronizations in 253 ms.
[2023-03-11 04:22:51] [INFO ] Time to serialize gal into /tmp/LTL164634431678027760.gal : 20 ms
[2023-03-11 04:22:51] [INFO ] Time to serialize properties into /tmp/LTL6240352113164666488.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL164634431678027760.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6240352113164666488.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(G(("(gi2.gi0.gu5.P2<=gi2.gi0.gu5.P6)")||(("(gu0.stp4<=((((((((((gu0.Speed_Left_Wheel_1+gu0.Speed_Left_Wheel_2)+(gu0.Speed_Left_Wh...71878
Formula 0 simplified : XF(!"(gi2.gi0.gu5.P2<=gi2.gi0.gu5.P6)" & (!"(gu0.stp4<=((((((((((gu0.Speed_Left_Wheel_1+gu0.Speed_Left_Wheel_2)+(gu0.Speed_Left_Whee...71873
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9292902309357484126
[2023-03-11 04:23:06] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9292902309357484126
Running compilation step : cd /tmp/ltsmin9292902309357484126;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9292902309357484126;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9292902309357484126;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AirplaneLD-PT-1000-LTLCardinality-07 finished in 157541 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 73 ms. Remains 19 /3019 variables (removed 3000) and now considering 18/6014 (removed 5996) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-11 04:23:09] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 04:23:09] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-11 04:23:09] [INFO ] Invariant cache hit.
[2023-03-11 04:23:09] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-11 04:23:09] [INFO ] Invariant cache hit.
[2023-03-11 04:23:09] [INFO ] Dead Transitions using invariants and state equation in 97 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 359 ms. Remains : 19/3019 places, 18/6014 transitions.
Stuttering acceptance computed with spot in 75 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 18284 reset in 69 ms.
Product exploration explored 100000 steps with 18281 reset in 72 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 296 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 41 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 234 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-03-11 04:23:10] [INFO ] Invariant cache hit.
[2023-03-11 04:23:10] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 04:23:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:23:10] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-11 04:23:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:23:10] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 04:23:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:23:10] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-11 04:23:10] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-11 04:23:10] [INFO ] Added : 0 causal constraints over 0 iterations in 26 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.0 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-11 04:23:10] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 04:23:10] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-11 04:23:10] [INFO ] Invariant cache hit.
[2023-03-11 04:23:10] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-11 04:23:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 04:23:10] [INFO ] Invariant cache hit.
[2023-03-11 04:23:10] [INFO ] Dead Transitions using invariants and state equation in 13 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 55 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 135 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 27 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 140 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-11 04:23:11] [INFO ] Invariant cache hit.
[2023-03-11 04:23:11] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 04:23:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:23:11] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-11 04:23:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:23:11] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 04:23:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:23:11] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-11 04:23:11] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-11 04:23:11] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 40047 reset in 53 ms.
Product exploration explored 100000 steps with 40031 reset in 77 ms.
Built C files in :
/tmp/ltsmin10046051517840295269
[2023-03-11 04:23:11] [INFO ] Computing symmetric may disable matrix : 3 transitions.
[2023-03-11 04:23:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 04:23:11] [INFO ] Computing symmetric may enable matrix : 3 transitions.
[2023-03-11 04:23:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 04:23:11] [INFO ] Computing Do-Not-Accords matrix : 3 transitions.
[2023-03-11 04:23:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 04:23:11] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10046051517840295269
Running compilation step : cd /tmp/ltsmin10046051517840295269;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 82 ms.
Running link step : cd /tmp/ltsmin10046051517840295269;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin10046051517840295269;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4577630439224277792.hoa' '--buchi-type=spotba'
LTSmin run took 119 ms.
FORMULA AirplaneLD-PT-1000-LTLCardinality-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AirplaneLD-PT-1000-LTLCardinality-08 finished in 2548 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.5 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 11 ms. Remains 1 /3019 variables (removed 3018) and now considering 1/6014 (removed 6013) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-11 04:23:11] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 04:23:11] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-11 04:23:11] [INFO ] Invariant cache hit.
[2023-03-11 04:23:11] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-11 04:23:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 04:23:11] [INFO ] Invariant cache hit.
[2023-03-11 04:23:11] [INFO ] Dead Transitions using invariants and state equation in 32 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 132 ms. Remains : 1/3019 places, 1/6014 transitions.
Stuttering acceptance computed with spot in 72 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 1 ms.
FORMULA AirplaneLD-PT-1000-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLCardinality-09 finished in 224 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 36 ms. Remains 21 /3019 variables (removed 2998) and now considering 22/6014 (removed 5992) transitions.
// Phase 1: matrix 22 rows 21 cols
[2023-03-11 04:23:12] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 04:23:12] [INFO ] Implicit Places using invariants in 26 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 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 62 ms. Remains : 20/3019 places, 22/6014 transitions.
Stuttering acceptance computed with spot in 170 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 12 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-1000-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLCardinality-10 finished in 252 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 74 ms. Remains 19 /3019 variables (removed 3000) and now considering 19/6014 (removed 5995) transitions.
// Phase 1: matrix 19 rows 19 cols
[2023-03-11 04:23:12] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 04:23:12] [INFO ] Implicit Places using invariants in 29 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 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.0 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-11 04:23:12] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 04:23:12] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 04:23:12] [INFO ] Invariant cache hit.
[2023-03-11 04:23:12] [INFO ] Implicit Places using invariants and state equation in 27 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 53 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 0 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 159 ms. Remains : 16/3019 places, 18/6014 transitions.
Stuttering acceptance computed with spot in 148 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 21 steps with 3 reset in 0 ms.
FORMULA AirplaneLD-PT-1000-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLCardinality-11 finished in 324 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 39 ms. Remains 21 /3019 variables (removed 2998) and now considering 20/6014 (removed 5994) transitions.
// Phase 1: matrix 20 rows 21 cols
[2023-03-11 04:23:12] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 04:23:12] [INFO ] Implicit Places using invariants in 28 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 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 1 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 68 ms. Remains : 20/3019 places, 20/6014 transitions.
Stuttering acceptance computed with spot in 104 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 19 steps with 2 reset in 0 ms.
FORMULA AirplaneLD-PT-1000-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLCardinality-12 finished in 188 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 63 ms. Remains 20 /3019 variables (removed 2999) and now considering 18/6014 (removed 5996) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-11 04:23:12] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 04:23:12] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-11 04:23:12] [INFO ] Invariant cache hit.
[2023-03-11 04:23:12] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-11 04:23:12] [INFO ] Invariant cache hit.
[2023-03-11 04:23:12] [INFO ] Dead Transitions using invariants and state equation in 31 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 162 ms. Remains : 20/3019 places, 18/6014 transitions.
Stuttering acceptance computed with spot in 178 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 16210 reset in 69 ms.
Product exploration explored 100000 steps with 16208 reset in 84 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 402 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 118 ms :[(NOT p1), (NOT p1)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
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 290 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 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
[2023-03-11 04:23:14] [INFO ] Invariant cache hit.
[2023-03-11 04:23:14] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-11 04:23:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:23:14] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-11 04:23:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:23:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-11 04:23:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:23:14] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-11 04:23:14] [INFO ] Computed and/alt/rep : 9/16/9 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-11 04:23:14] [INFO ] Added : 0 causal constraints over 0 iterations in 5 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-11 04:23:14] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 04:23:14] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-11 04:23:14] [INFO ] Invariant cache hit.
[2023-03-11 04:23:14] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 105 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 1 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 107 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 125 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 50 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 146 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 26 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
// Phase 1: matrix 17 rows 18 cols
[2023-03-11 04:23:14] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 04:23:15] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-11 04:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:23:15] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-11 04:23:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:23:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-11 04:23:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:23:15] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-11 04:23:15] [INFO ] Computed and/alt/rep : 9/15/9 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-11 04:23:15] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Product exploration explored 100000 steps with 18182 reset in 73 ms.
Product exploration explored 100000 steps with 18178 reset in 146 ms.
Built C files in :
/tmp/ltsmin3103923983658938567
[2023-03-11 04:23:15] [INFO ] Computing symmetric may disable matrix : 17 transitions.
[2023-03-11 04:23:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 04:23:15] [INFO ] Computing symmetric may enable matrix : 17 transitions.
[2023-03-11 04:23:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 04:23:15] [INFO ] Computing Do-Not-Accords matrix : 17 transitions.
[2023-03-11 04:23:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 04:23:15] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3103923983658938567
Running compilation step : cd /tmp/ltsmin3103923983658938567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 82 ms.
Running link step : cd /tmp/ltsmin3103923983658938567;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3103923983658938567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5648824351452347540.hoa' '--buchi-type=spotba'
LTSmin run took 98 ms.
FORMULA AirplaneLD-PT-1000-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AirplaneLD-PT-1000-LTLCardinality-15 finished in 2865 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 179 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.20 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 115 ms. Remains 3015 /3019 variables (removed 4) and now considering 6009/6014 (removed 5) transitions.
// Phase 1: matrix 6009 rows 3015 cols
[2023-03-11 04:23:16] [INFO ] Computed 2 place invariants in 415 ms
[2023-03-11 04:23:16] [INFO ] Implicit Places using invariants in 871 ms returned [3014]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 874 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 33 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 1022 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 56870 steps with 8185 reset in 10001 ms.
Product exploration timeout after 57270 steps with 8262 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 436 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 141 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Incomplete random walk after 10000 steps, including 1437 resets, run finished after 6135 ms. (steps per millisecond=1 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 298 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 311 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 299 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-11 04:23:46] [INFO ] Computed 1 place invariants in 424 ms
[2023-03-11 04:23:48] [INFO ] After 532ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 04:23:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 04:23:51] [INFO ] After 2814ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 04:23:52] [INFO ] After 3752ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 548 ms.
[2023-03-11 04:23:53] [INFO ] After 5168ms 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 3 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 513 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 176 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 177 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 11 ms. Remains 3014 /3014 variables (removed 0) and now considering 6009/6009 (removed 0) transitions.
[2023-03-11 04:23:54] [INFO ] Invariant cache hit.
[2023-03-11 04:23:54] [INFO ] Implicit Places using invariants in 466 ms returned []
[2023-03-11 04:23:54] [INFO ] Invariant cache hit.
[2023-03-11 04:23:55] [INFO ] Implicit Places using invariants and state equation in 1074 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
[2023-03-11 04:23:55] [INFO ] Invariant cache hit.
[2023-03-11 04:23:58] [INFO ] Dead Transitions using invariants and state equation in 2841 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4407 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 372 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 149 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Incomplete random walk after 10000 steps, including 1437 resets, run finished after 6713 ms. (steps per millisecond=1 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 298 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 297 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 328 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 04:24:08] [INFO ] Invariant cache hit.
[2023-03-11 04:24:09] [INFO ] After 515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 04:24:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 22 ms returned sat
[2023-03-11 04:24:14] [INFO ] After 3348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 04:24:15] [INFO ] After 4480ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 632 ms.
[2023-03-11 04:24:15] [INFO ] After 5842ms 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 7 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 572 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 255 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2]
Stuttering acceptance computed with spot in 257 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 50430 steps with 7260 reset in 10004 ms.
Product exploration timeout after 50710 steps with 7317 reset in 10002 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 233 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 130 ms. Remains 3014 /3014 variables (removed 0) and now considering 6009/6009 (removed 0) transitions.
[2023-03-11 04:24:38] [INFO ] Redundant transitions in 448 ms returned []
[2023-03-11 04:24:38] [INFO ] Invariant cache hit.
[2023-03-11 04:24:40] [INFO ] Dead Transitions using invariants and state equation in 2736 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3344 ms. Remains : 3014/3014 places, 6009/6009 transitions.
Built C files in :
/tmp/ltsmin12534759744088237192
[2023-03-11 04:24:41] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12534759744088237192
Running compilation step : cd /tmp/ltsmin12534759744088237192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12534759744088237192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12534759744088237192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
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 20 ms. Remains 3014 /3014 variables (removed 0) and now considering 6009/6009 (removed 0) transitions.
[2023-03-11 04:24:44] [INFO ] Invariant cache hit.
[2023-03-11 04:24:44] [INFO ] Implicit Places using invariants in 476 ms returned []
[2023-03-11 04:24:44] [INFO ] Invariant cache hit.
[2023-03-11 04:24:45] [INFO ] Implicit Places using invariants and state equation in 1125 ms returned []
Implicit Place search using SMT with State Equation took 1604 ms to find 0 implicit places.
[2023-03-11 04:24:45] [INFO ] Invariant cache hit.
[2023-03-11 04:24:49] [INFO ] Dead Transitions using invariants and state equation in 3381 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5017 ms. Remains : 3014/3014 places, 6009/6009 transitions.
Built C files in :
/tmp/ltsmin13522783866456768251
[2023-03-11 04:24:49] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13522783866456768251
Running compilation step : cd /tmp/ltsmin13522783866456768251;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13522783866456768251;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13522783866456768251;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 04:24:52] [INFO ] Flatten gal took : 190 ms
[2023-03-11 04:24:52] [INFO ] Flatten gal took : 219 ms
[2023-03-11 04:24:52] [INFO ] Time to serialize gal into /tmp/LTL6692693405425505809.gal : 19 ms
[2023-03-11 04:24:52] [INFO ] Time to serialize properties into /tmp/LTL5970928882579994362.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6692693405425505809.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1537330997224118561.hoa' '-atoms' '/tmp/LTL5970928882579994362.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5970928882579994362.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1537330997224118561.hoa
Detected timeout of ITS tools.
[2023-03-11 04:25:08] [INFO ] Flatten gal took : 161 ms
[2023-03-11 04:25:08] [INFO ] Flatten gal took : 229 ms
[2023-03-11 04:25:08] [INFO ] Time to serialize gal into /tmp/LTL14469859221372367656.gal : 39 ms
[2023-03-11 04:25:08] [INFO ] Time to serialize properties into /tmp/LTL1222701907837219896.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14469859221372367656.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1222701907837219896.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("(P2<=P6)")||(("(stp4<=((((((((((Speed_Left_Wheel_1+Speed_Left_Wheel_2)+(Speed_Left_Wheel_3+Speed_Left_Wheel_4))+((Speed_Left_...59850
Formula 0 simplified : XF(!"(P2<=P6)" & (!"(stp4<=((((((((((Speed_Left_Wheel_1+Speed_Left_Wheel_2)+(Speed_Left_Wheel_3+Speed_Left_Wheel_4))+((Speed_Left_Wh...59845
Detected timeout of ITS tools.
[2023-03-11 04:25:23] [INFO ] Flatten gal took : 194 ms
[2023-03-11 04:25:23] [INFO ] Applying decomposition
[2023-03-11 04:25:23] [INFO ] Flatten gal took : 182 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4417640364122211216.txt' '-o' '/tmp/graph4417640364122211216.bin' '-w' '/tmp/graph4417640364122211216.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4417640364122211216.bin' '-l' '-1' '-v' '-w' '/tmp/graph4417640364122211216.weights' '-q' '0' '-e' '0.001'
[2023-03-11 04:25:29] [INFO ] Decomposing Gal with order
[2023-03-11 04:25:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 04:25:32] [INFO ] Removed a total of 4494 redundant transitions.
[2023-03-11 04:25:32] [INFO ] Flatten gal took : 3098 ms
[2023-03-11 04:25:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 3000 labels/synchronizations in 133 ms.
[2023-03-11 04:25:33] [INFO ] Time to serialize gal into /tmp/LTL174224232651922998.gal : 14 ms
[2023-03-11 04:25:33] [INFO ] Time to serialize properties into /tmp/LTL15048869994994943057.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL174224232651922998.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15048869994994943057.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("(gi2.gu4.P2<=gi2.gu4.P6)")||(("(gu0.stp4<=((((((((((gu0.Speed_Left_Wheel_1+gu0.Speed_Left_Wheel_2)+(gu0.Speed_Left_Wheel_3+gu...71870
Formula 0 simplified : XF(!"(gi2.gu4.P2<=gi2.gu4.P6)" & (!"(gu0.stp4<=((((((((((gu0.Speed_Left_Wheel_1+gu0.Speed_Left_Wheel_2)+(gu0.Speed_Left_Wheel_3+gu0....71865
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12664290105534571058
[2023-03-11 04:25:48] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12664290105534571058
Running compilation step : cd /tmp/ltsmin12664290105534571058;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12664290105534571058;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12664290105534571058;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AirplaneLD-PT-1000-LTLCardinality-07 finished in 155812 ms.
[2023-03-11 04:25:52] [INFO ] Flatten gal took : 554 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin828875465208700873
[2023-03-11 04:25:52] [INFO ] Too many transitions (6014) to apply POR reductions. Disabling POR matrices.
[2023-03-11 04:25:52] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin828875465208700873
Running compilation step : cd /tmp/ltsmin828875465208700873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-11 04:25:52] [INFO ] Applying decomposition
[2023-03-11 04:25:52] [INFO ] Flatten gal took : 137 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3919602064452145461.txt' '-o' '/tmp/graph3919602064452145461.bin' '-w' '/tmp/graph3919602064452145461.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3919602064452145461.bin' '-l' '-1' '-v' '-w' '/tmp/graph3919602064452145461.weights' '-q' '0' '-e' '0.001'
[2023-03-11 04:25:57] [INFO ] Decomposing Gal with order
[2023-03-11 04:25:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 04:26:00] [INFO ] Removed a total of 4498 redundant transitions.
[2023-03-11 04:26:01] [INFO ] Flatten gal took : 3046 ms
[2023-03-11 04:26:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 3002 labels/synchronizations in 149 ms.
[2023-03-11 04:26:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality9103314970306156921.gal : 18 ms
[2023-03-11 04:26:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality17525935812051789727.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9103314970306156921.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17525935812051789727.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X(G(("(gi2.gi0.gu5.P2<=gi2.gi0.gu5.P6)")||(("(gu0.stp4<=((((((((((gu0.Speed_Left_Wheel_1+gu0.Speed_Left_Wheel_2)+(gu0.Speed_Left_Wh...71878
Formula 0 simplified : XF(!"(gi2.gi0.gu5.P2<=gi2.gi0.gu5.P6)" & (!"(gu0.stp4<=((((((((((gu0.Speed_Left_Wheel_1+gu0.Speed_Left_Wheel_2)+(gu0.Speed_Left_Whee...71873
Compilation finished in 23161 ms.
Running link step : cd /tmp/ltsmin828875465208700873;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 106 ms.
Running LTSmin : cd /tmp/ltsmin828875465208700873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||((LTLAPp1==true) U !(LTLAPp2==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gi2.gi0.t3007, gi2.gi0.t3008, gi2.gi0.t6013, gi2.t6011, t3589, t5706, Intersection with reac...233
Computing Next relation with stutter on 1.8003e+07 deadlock states
15 unique states visited
7 strongly connected components in search stack
16 transitions explored
11 items max in DFS search stack
25047 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,250.857,2297084,1,0,3052,1.10099e+07,41,65,71953,1.11352e+06,189
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AirplaneLD-PT-1000-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 917684 ms.

BK_STOP 1678509331451

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
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 r005-oct2-167813592900291"
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 ;