Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.9K Feb 25 18:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 18:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 18:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 25 18:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 85K 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 AutoFlight-PT-12a-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-12a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678349219331

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 08:07:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 08:07:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:07:02] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-09 08:07:02] [INFO ] Transformed 307 places.
[2023-03-09 08:07:02] [INFO ] Transformed 305 transitions.
[2023-03-09 08:07:02] [INFO ] Found NUPN structural information;
[2023-03-09 08:07:02] [INFO ] Parsed PT model containing 307 places and 305 transitions and 980 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 60 transitions
Reduce redundant transitions removed 60 transitions.
FORMULA AutoFlight-PT-12a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 245/245 transitions.
Applied a total of 0 rules in 49 ms. Remains 307 /307 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 307 cols
[2023-03-09 08:07:02] [INFO ] Computed 76 place invariants in 9 ms
[2023-03-09 08:07:03] [INFO ] Implicit Places using invariants in 1141 ms returned [7, 14, 21, 35, 56, 63, 70, 77, 84, 90, 93, 96, 99, 102, 105, 108, 111, 114, 117, 238, 244, 250, 256, 262, 268, 274, 280, 286, 292, 298, 304, 306]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 1191 ms to find 32 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 275/307 places, 245/245 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 265 transition count 235
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 265 transition count 235
Applied a total of 20 rules in 44 ms. Remains 265 /275 variables (removed 10) and now considering 235/245 (removed 10) transitions.
// Phase 1: matrix 235 rows 265 cols
[2023-03-09 08:07:03] [INFO ] Computed 44 place invariants in 6 ms
[2023-03-09 08:07:03] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-09 08:07:03] [INFO ] Invariant cache hit.
[2023-03-09 08:07:04] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 08:07:04] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 265/307 places, 235/245 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2045 ms. Remains : 265/307 places, 235/245 transitions.
Support contains 38 out of 265 places after structural reductions.
[2023-03-09 08:07:04] [INFO ] Flatten gal took : 58 ms
[2023-03-09 08:07:04] [INFO ] Flatten gal took : 51 ms
[2023-03-09 08:07:05] [INFO ] Input system was already deterministic with 235 transitions.
Support contains 35 out of 265 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 175 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 26) seen :20
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-09 08:07:05] [INFO ] Invariant cache hit.
[2023-03-09 08:07:05] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 08:07:05] [INFO ] [Nat]Absence check using 44 positive place invariants in 6 ms returned sat
[2023-03-09 08:07:06] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2023-03-09 08:07:06] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 08:07:06] [INFO ] After 29ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :4 sat :2
[2023-03-09 08:07:06] [INFO ] Deduced a trap composed of 125 places in 97 ms of which 6 ms to minimize.
[2023-03-09 08:07:06] [INFO ] Deduced a trap composed of 127 places in 72 ms of which 1 ms to minimize.
[2023-03-09 08:07:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2023-03-09 08:07:06] [INFO ] After 303ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-09 08:07:06] [INFO ] After 552ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
Fused 6 Parikh solutions to 2 different solutions.
Finished Parikh walk after 100 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=50 )
Parikh walk visited 2 properties in 4 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutoFlight-PT-12a-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
FORMULA AutoFlight-PT-12a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 1 stable transitions
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((X(p1)||p0))))'
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 17 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-09 08:07:06] [INFO ] Computed 44 place invariants in 6 ms
[2023-03-09 08:07:07] [INFO ] Implicit Places using invariants in 304 ms returned [25, 38, 45, 78, 101, 163, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 306 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 232
Applied a total of 4 rules in 7 ms. Remains 255 /257 variables (removed 2) and now considering 232/234 (removed 2) transitions.
// Phase 1: matrix 232 rows 255 cols
[2023-03-09 08:07:07] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-09 08:07:07] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-09 08:07:07] [INFO ] Invariant cache hit.
[2023-03-09 08:07:07] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 255/265 places, 232/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 684 ms. Remains : 255/265 places, 232/235 transitions.
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s52 0) (EQ s5 0) (EQ s158 1)), p1:(EQ s52 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1836 reset in 504 ms.
Product exploration explored 100000 steps with 1853 reset in 428 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 9 factoid took 728 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 195 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 08:07:09] [INFO ] Invariant cache hit.
[2023-03-09 08:07:09] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (AND (NOT p1) p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 10 factoid took 1055 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 232/232 transitions.
Applied a total of 0 rules in 9 ms. Remains 255 /255 variables (removed 0) and now considering 232/232 (removed 0) transitions.
[2023-03-09 08:07:11] [INFO ] Invariant cache hit.
[2023-03-09 08:07:11] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-09 08:07:11] [INFO ] Invariant cache hit.
[2023-03-09 08:07:11] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2023-03-09 08:07:11] [INFO ] Invariant cache hit.
[2023-03-09 08:07:12] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 655 ms. Remains : 255/255 places, 232/232 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 5 factoid took 298 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 180 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :2
Finished Best-First random walk after 5251 steps, including 5 resets, run visited all 1 properties in 8 ms. (steps per millisecond=656 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p0)), (F (AND (NOT p1) p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 5 factoid took 592 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1839 reset in 401 ms.
Product exploration explored 100000 steps with 1867 reset in 253 ms.
Support contains 3 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 232/232 transitions.
Applied a total of 0 rules in 4 ms. Remains 255 /255 variables (removed 0) and now considering 232/232 (removed 0) transitions.
[2023-03-09 08:07:14] [INFO ] Invariant cache hit.
[2023-03-09 08:07:14] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-09 08:07:14] [INFO ] Invariant cache hit.
[2023-03-09 08:07:14] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2023-03-09 08:07:14] [INFO ] Invariant cache hit.
[2023-03-09 08:07:15] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 631 ms. Remains : 255/255 places, 232/232 transitions.
Treatment of property AutoFlight-PT-12a-LTLCardinality-00 finished in 8319 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||F(p1)))))'
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 265 transition count 163
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 193 transition count 163
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 144 place count 193 transition count 143
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 184 place count 173 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 172 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 172 transition count 142
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 238 place count 146 transition count 116
Applied a total of 238 rules in 26 ms. Remains 146 /265 variables (removed 119) and now considering 116/235 (removed 119) transitions.
// Phase 1: matrix 116 rows 146 cols
[2023-03-09 08:07:15] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-09 08:07:15] [INFO ] Implicit Places using invariants in 98 ms returned [17, 26, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 85, 106]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 99 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/265 places, 116/235 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 128 transition count 98
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 110 transition count 98
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 36 place count 110 transition count 96
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 108 transition count 96
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 107 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 107 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 106 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 106 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 46 place count 105 transition count 93
Applied a total of 46 rules in 10 ms. Remains 105 /128 variables (removed 23) and now considering 93/116 (removed 23) transitions.
// Phase 1: matrix 93 rows 105 cols
[2023-03-09 08:07:15] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-09 08:07:15] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-09 08:07:15] [INFO ] Invariant cache hit.
[2023-03-09 08:07:15] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-09 08:07:15] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 105/265 places, 93/235 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 292 ms. Remains : 105/265 places, 93/235 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s44 1), p1:(AND (EQ s44 1) (OR (EQ s29 0) (EQ s65 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-01 finished in 407 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(F(p0)))'
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 16 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-09 08:07:15] [INFO ] Computed 44 place invariants in 4 ms
[2023-03-09 08:07:15] [INFO ] Implicit Places using invariants in 184 ms returned [25, 38, 45, 78, 101, 163, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 186 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 254 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 254 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 253 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 253 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 252 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 252 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 251 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 251 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 250 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 250 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 249 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 249 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 248 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 248 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 247 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 247 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 246 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 246 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 245 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 245 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 244 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 244 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 243 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 243 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 242 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 242 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 241 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 241 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 240 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 240 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 239 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 239 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 238 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 238 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 237 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 237 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 236 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 236 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 235 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 235 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 234 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 234 transition count 211
Applied a total of 46 rules in 77 ms. Remains 234 /257 variables (removed 23) and now considering 211/234 (removed 23) transitions.
// Phase 1: matrix 211 rows 234 cols
[2023-03-09 08:07:15] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-09 08:07:15] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-09 08:07:15] [INFO ] Invariant cache hit.
[2023-03-09 08:07:16] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 234/265 places, 211/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 576 ms. Remains : 234/265 places, 211/235 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s158 0) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 401 ms.
Product exploration explored 100000 steps with 50000 reset in 345 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12a-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12a-LTLCardinality-04 finished in 1571 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 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 259 transition count 141
Reduce places removed 93 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 94 rules applied. Total rules applied 192 place count 166 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 193 place count 165 transition count 140
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 193 place count 165 transition count 127
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 231 place count 140 transition count 127
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 12 rules applied. Total rules applied 243 place count 140 transition count 115
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 255 place count 128 transition count 115
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 256 place count 127 transition count 114
Iterating global reduction 5 with 1 rules applied. Total rules applied 257 place count 127 transition count 114
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 309 place count 101 transition count 88
Applied a total of 309 rules in 30 ms. Remains 101 /265 variables (removed 164) and now considering 88/235 (removed 147) transitions.
// Phase 1: matrix 88 rows 101 cols
[2023-03-09 08:07:17] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-09 08:07:17] [INFO ] Implicit Places using invariants in 149 ms returned [62, 75]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 153 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/265 places, 88/235 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 186 ms. Remains : 99/265 places, 88/235 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-05 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:(AND (EQ s48 0) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-05 finished in 351 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||G((F(p1)&&F(G(p2)))))))'
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 15 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-09 08:07:17] [INFO ] Computed 44 place invariants in 2 ms
[2023-03-09 08:07:17] [INFO ] Implicit Places using invariants in 228 ms returned [25, 38, 45, 78, 101, 163, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 229 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 254 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 254 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 253 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 253 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 252 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 252 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 251 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 251 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 250 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 250 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 249 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 249 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 248 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 248 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 247 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 247 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 246 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 246 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 245 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 245 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 244 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 244 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 243 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 243 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 242 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 242 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 241 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 241 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 240 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 240 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 239 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 239 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 238 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 238 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 237 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 237 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 236 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 236 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 235 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 235 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 234 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 234 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 233 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 233 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 232 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 232 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 231 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 231 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 230 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 230 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 219 transition count 196
Applied a total of 76 rules in 107 ms. Remains 219 /257 variables (removed 38) and now considering 196/234 (removed 38) transitions.
// Phase 1: matrix 196 rows 219 cols
[2023-03-09 08:07:17] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-09 08:07:18] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-09 08:07:18] [INFO ] Invariant cache hit.
[2023-03-09 08:07:18] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/265 places, 196/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 861 ms. Remains : 219/265 places, 196/235 transitions.
Stuttering acceptance computed with spot in 376 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (NEQ s63 0) (NEQ s136 1)), p1:(OR (EQ s189 0) (EQ s154 1)), p2:(AND (EQ s154 0) (EQ s189 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 387 ms.
Product exploration explored 100000 steps with 50000 reset in 340 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), true]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 263 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12a-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12a-LTLCardinality-06 finished in 2280 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))'
Support contains 1 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 15 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-09 08:07:19] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-09 08:07:19] [INFO ] Implicit Places using invariants in 220 ms returned [25, 38, 45, 78, 101, 163, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 221 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 254 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 254 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 253 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 253 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 252 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 252 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 251 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 251 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 250 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 250 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 249 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 249 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 248 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 248 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 247 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 247 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 246 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 246 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 245 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 245 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 244 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 244 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 243 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 243 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 242 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 242 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 241 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 241 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 240 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 240 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 239 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 239 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 238 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 238 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 237 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 237 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 236 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 236 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 235 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 235 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 234 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 234 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 233 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 233 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 232 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 232 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 231 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 231 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 230 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 230 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 219 transition count 196
Applied a total of 76 rules in 94 ms. Remains 219 /257 variables (removed 38) and now considering 196/234 (removed 38) transitions.
// Phase 1: matrix 196 rows 219 cols
[2023-03-09 08:07:20] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-09 08:07:20] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-09 08:07:20] [INFO ] Invariant cache hit.
[2023-03-09 08:07:20] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/265 places, 196/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 645 ms. Remains : 219/265 places, 196/235 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s84 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-07 finished in 787 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(G((X(X(p1))||p0)))))'
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 14 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-09 08:07:20] [INFO ] Computed 44 place invariants in 3 ms
[2023-03-09 08:07:20] [INFO ] Implicit Places using invariants in 178 ms returned [25, 38, 45, 78, 101, 163, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 179 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 254 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 254 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 253 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 253 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 252 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 252 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 251 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 251 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 250 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 250 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 249 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 249 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 248 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 248 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 247 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 247 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 246 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 246 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 245 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 245 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 244 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 244 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 243 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 243 transition count 220
Applied a total of 28 rules in 55 ms. Remains 243 /257 variables (removed 14) and now considering 220/234 (removed 14) transitions.
// Phase 1: matrix 220 rows 243 cols
[2023-03-09 08:07:20] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-09 08:07:21] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-09 08:07:21] [INFO ] Invariant cache hit.
[2023-03-09 08:07:21] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 243/265 places, 220/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 676 ms. Remains : 243/265 places, 220/235 transitions.
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s81 0) (EQ s110 1)), p1:(AND (EQ s110 0) (EQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1208 steps with 41 reset in 9 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-08 finished in 1029 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(G((p0||G(p1))))))'
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 14 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-09 08:07:21] [INFO ] Computed 44 place invariants in 16 ms
[2023-03-09 08:07:21] [INFO ] Implicit Places using invariants in 264 ms returned [25, 45, 78, 101, 163, 213]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 280 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 256 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 256 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 255 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 255 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 254 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 254 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 253 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 253 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 252 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 252 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 251 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 251 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 250 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 250 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 249 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 249 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 248 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 248 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 247 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 247 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 246 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 246 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 245 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 245 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 244 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 244 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 243 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 243 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 242 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 242 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 241 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 241 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 240 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 240 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 239 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 239 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 238 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 238 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 237 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 237 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 236 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 236 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 235 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 235 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 234 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 234 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 233 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 233 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 232 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 232 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 231 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 231 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 230 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 230 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 229 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 229 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 228 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 228 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 227 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 227 transition count 203
Applied a total of 62 rules in 66 ms. Remains 227 /258 variables (removed 31) and now considering 203/234 (removed 31) transitions.
// Phase 1: matrix 203 rows 227 cols
[2023-03-09 08:07:21] [INFO ] Computed 38 place invariants in 3 ms
[2023-03-09 08:07:22] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-09 08:07:22] [INFO ] Invariant cache hit.
[2023-03-09 08:07:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 08:07:22] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 227/265 places, 203/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 873 ms. Remains : 227/265 places, 203/235 transitions.
Stuttering acceptance computed with spot in 255 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(EQ s85 1), p0:(EQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1867 reset in 357 ms.
Product exploration explored 100000 steps with 1840 reset in 261 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/227 stabilizing places and 1/203 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 177 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 08:07:23] [INFO ] Invariant cache hit.
[2023-03-09 08:07:24] [INFO ] [Real]Absence check using 38 positive place invariants in 9 ms returned sat
[2023-03-09 08:07:24] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 581 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-09 08:07:25] [INFO ] Invariant cache hit.
[2023-03-09 08:07:25] [INFO ] [Real]Absence check using 38 positive place invariants in 25 ms returned sat
[2023-03-09 08:07:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:07:25] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2023-03-09 08:07:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 08:07:25] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-09 08:07:25] [INFO ] Computed and/alt/rep : 201/387/201 causal constraints (skipped 1 transitions) in 18 ms.
[2023-03-09 08:07:25] [INFO ] Added : 0 causal constraints over 0 iterations in 78 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 227 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 203/203 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2023-03-09 08:07:25] [INFO ] Invariant cache hit.
[2023-03-09 08:07:25] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-09 08:07:25] [INFO ] Invariant cache hit.
[2023-03-09 08:07:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 08:07:25] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2023-03-09 08:07:25] [INFO ] Invariant cache hit.
[2023-03-09 08:07:26] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 531 ms. Remains : 227/227 places, 203/203 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/227 stabilizing places and 1/203 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 222 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 329 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-09 08:07:27] [INFO ] Invariant cache hit.
[2023-03-09 08:07:27] [INFO ] [Real]Absence check using 38 positive place invariants in 26 ms returned sat
[2023-03-09 08:07:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:07:27] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2023-03-09 08:07:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 08:07:27] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2023-03-09 08:07:27] [INFO ] Computed and/alt/rep : 201/387/201 causal constraints (skipped 1 transitions) in 23 ms.
[2023-03-09 08:07:27] [INFO ] Added : 0 causal constraints over 0 iterations in 62 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1856 reset in 282 ms.
Product exploration explored 100000 steps with 1885 reset in 270 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 203/203 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 227 transition count 203
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 59 place count 227 transition count 203
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 74 place count 227 transition count 203
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 119 place count 182 transition count 158
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 164 place count 182 transition count 158
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 191 place count 182 transition count 158
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 196 place count 177 transition count 153
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 201 place count 177 transition count 153
Deduced a syphon composed of 52 places in 0 ms
Applied a total of 201 rules in 60 ms. Remains 177 /227 variables (removed 50) and now considering 153/203 (removed 50) transitions.
[2023-03-09 08:07:28] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 153 rows 177 cols
[2023-03-09 08:07:28] [INFO ] Computed 38 place invariants in 1 ms
[2023-03-09 08:07:29] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 177/227 places, 153/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 226 ms. Remains : 177/227 places, 153/203 transitions.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 203/203 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 227 cols
[2023-03-09 08:07:29] [INFO ] Computed 38 place invariants in 2 ms
[2023-03-09 08:07:29] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-09 08:07:29] [INFO ] Invariant cache hit.
[2023-03-09 08:07:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 08:07:29] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2023-03-09 08:07:29] [INFO ] Invariant cache hit.
[2023-03-09 08:07:29] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 574 ms. Remains : 227/227 places, 203/203 transitions.
Treatment of property AutoFlight-PT-12a-LTLCardinality-10 finished in 8163 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&&F(p1))))'
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 9 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-09 08:07:29] [INFO ] Computed 44 place invariants in 18 ms
[2023-03-09 08:07:29] [INFO ] Implicit Places using invariants in 147 ms returned [45, 78, 101, 163, 213]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 148 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 259/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 257 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 257 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 256 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 256 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 255 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 255 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 254 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 254 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 253 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 253 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 252 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 252 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 251 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 251 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 250 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 250 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 249 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 249 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 248 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 248 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 247 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 247 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 246 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 246 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 245 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 245 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 244 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 244 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 243 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 243 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 242 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 242 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 241 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 241 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 240 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 240 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 239 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 239 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 238 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 238 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 237 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 237 transition count 212
Applied a total of 44 rules in 93 ms. Remains 237 /259 variables (removed 22) and now considering 212/234 (removed 22) transitions.
// Phase 1: matrix 212 rows 237 cols
[2023-03-09 08:07:29] [INFO ] Computed 39 place invariants in 1 ms
[2023-03-09 08:07:30] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-09 08:07:30] [INFO ] Invariant cache hit.
[2023-03-09 08:07:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 08:07:30] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 237/265 places, 212/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 785 ms. Remains : 237/265 places, 212/235 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s152 0) (EQ s25 1)), p0:(OR (EQ s38 0) (EQ s160 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-12 finished in 1011 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))'
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 16 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-09 08:07:30] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-09 08:07:31] [INFO ] Implicit Places using invariants in 241 ms returned [25, 38, 45, 78, 101, 163, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 243 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 254 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 254 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 253 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 253 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 252 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 252 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 251 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 251 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 250 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 250 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 249 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 249 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 248 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 248 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 247 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 247 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 246 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 246 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 245 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 245 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 244 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 244 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 243 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 243 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 242 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 242 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 241 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 241 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 240 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 240 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 239 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 239 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 238 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 238 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 237 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 237 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 236 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 236 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 235 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 235 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 234 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 234 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 233 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 233 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 232 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 232 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 231 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 231 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 230 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 230 transition count 207
Applied a total of 54 rules in 69 ms. Remains 230 /257 variables (removed 27) and now considering 207/234 (removed 27) transitions.
// Phase 1: matrix 207 rows 230 cols
[2023-03-09 08:07:31] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-09 08:07:31] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-09 08:07:31] [INFO ] Invariant cache hit.
[2023-03-09 08:07:31] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 230/265 places, 207/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 590 ms. Remains : 230/265 places, 207/235 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s123 0) (EQ s144 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 407 ms.
Product exploration explored 100000 steps with 50000 reset in 367 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12a-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12a-LTLCardinality-13 finished in 1567 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)))'
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 264 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 264 transition count 234
Applied a total of 2 rules in 11 ms. Remains 264 /265 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 264 cols
[2023-03-09 08:07:32] [INFO ] Computed 44 place invariants in 2 ms
[2023-03-09 08:07:32] [INFO ] Implicit Places using invariants in 238 ms returned [25, 38, 45, 78, 101, 163, 213]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 262 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/265 places, 234/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 255 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 255 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 254 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 254 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 253 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 253 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 252 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 252 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 251 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 251 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 250 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 250 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 249 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 249 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 248 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 248 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 247 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 247 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 246 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 246 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 245 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 245 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 244 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 244 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 243 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 243 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 242 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 242 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 241 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 241 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 240 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 240 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 239 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 239 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 238 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 238 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 237 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 237 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 236 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 236 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 235 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 235 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 234 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 234 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 233 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 233 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 232 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 232 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 231 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 231 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 230 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 230 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 229 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 229 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 228 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 228 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 227 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 227 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 226 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 226 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 225 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 225 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 224 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 224 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 223 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 223 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 222 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 222 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 221 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 221 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 220 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 220 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 219 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 219 transition count 196
Applied a total of 76 rules in 95 ms. Remains 219 /257 variables (removed 38) and now considering 196/234 (removed 38) transitions.
// Phase 1: matrix 196 rows 219 cols
[2023-03-09 08:07:32] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-09 08:07:32] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-09 08:07:32] [INFO ] Invariant cache hit.
[2023-03-09 08:07:33] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 219/265 places, 196/235 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 772 ms. Remains : 219/265 places, 196/235 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s147 0) (EQ s172 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 160 steps with 1 reset in 1 ms.
FORMULA AutoFlight-PT-12a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12a-LTLCardinality-15 finished in 915 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((X(p1)||p0))))'
Found a Lengthening insensitive property : AutoFlight-PT-12a-LTLCardinality-00
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 259 transition count 141
Reduce places removed 93 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 94 rules applied. Total rules applied 192 place count 166 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 193 place count 165 transition count 140
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 193 place count 165 transition count 127
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 231 place count 140 transition count 127
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 12 rules applied. Total rules applied 243 place count 140 transition count 115
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 255 place count 128 transition count 115
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 256 place count 127 transition count 114
Iterating global reduction 5 with 1 rules applied. Total rules applied 257 place count 127 transition count 114
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 307 place count 102 transition count 89
Applied a total of 307 rules in 30 ms. Remains 102 /265 variables (removed 163) and now considering 89/235 (removed 146) transitions.
// Phase 1: matrix 89 rows 102 cols
[2023-03-09 08:07:33] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-09 08:07:33] [INFO ] Implicit Places using invariants in 94 ms returned [61, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 95 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 100/265 places, 89/235 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 89/89 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 129 ms. Remains : 100/265 places, 89/235 transitions.
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s35 0) (EQ s3 0) (EQ s61 1)), p1:(EQ s35 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3153 reset in 176 ms.
Product exploration explored 100000 steps with 3179 reset in 174 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 7 factoid took 660 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 309 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 89 rows 100 cols
[2023-03-09 08:07:34] [INFO ] Computed 25 place invariants in 14 ms
[2023-03-09 08:07:34] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (AND (NOT p1) p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 8 factoid took 787 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 89/89 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2023-03-09 08:07:35] [INFO ] Invariant cache hit.
[2023-03-09 08:07:36] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-09 08:07:36] [INFO ] Invariant cache hit.
[2023-03-09 08:07:36] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2023-03-09 08:07:36] [INFO ] Invariant cache hit.
[2023-03-09 08:07:36] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 100/100 places, 89/89 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 3 factoid took 305 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Finished random walk after 119 steps, including 4 resets, run visited all 3 properties in 2 ms. (steps per millisecond=59 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p0)), (F (AND (NOT p1) p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 3 factoid took 522 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3182 reset in 182 ms.
Product exploration explored 100000 steps with 3183 reset in 203 ms.
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 89/89 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2023-03-09 08:07:38] [INFO ] Invariant cache hit.
[2023-03-09 08:07:38] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-09 08:07:38] [INFO ] Invariant cache hit.
[2023-03-09 08:07:38] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2023-03-09 08:07:38] [INFO ] Invariant cache hit.
[2023-03-09 08:07:38] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 455 ms. Remains : 100/100 places, 89/89 transitions.
Treatment of property AutoFlight-PT-12a-LTLCardinality-00 finished in 5565 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(G((p0||G(p1))))))'
Found a Lengthening insensitive property : AutoFlight-PT-12a-LTLCardinality-10
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 265/265 places, 235/235 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 265 transition count 161
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 148 place count 191 transition count 161
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 148 place count 191 transition count 142
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 186 place count 172 transition count 142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 171 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 171 transition count 141
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 242 place count 144 transition count 114
Applied a total of 242 rules in 34 ms. Remains 144 /265 variables (removed 121) and now considering 114/235 (removed 121) transitions.
// Phase 1: matrix 114 rows 144 cols
[2023-03-09 08:07:39] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-09 08:07:39] [INFO ] Implicit Places using invariants in 157 ms returned [17, 31, 52, 53, 54, 55, 56, 57, 60, 61, 62, 63, 64, 65, 66, 85, 104]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 159 ms to find 17 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 127/265 places, 114/235 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 127 transition count 99
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 112 transition count 99
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 30 place count 112 transition count 95
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 38 place count 108 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 107 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 107 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 106 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 106 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 105 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 105 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 46 place count 104 transition count 91
Applied a total of 46 rules in 10 ms. Remains 104 /127 variables (removed 23) and now considering 91/114 (removed 23) transitions.
// Phase 1: matrix 91 rows 104 cols
[2023-03-09 08:07:39] [INFO ] Computed 27 place invariants in 0 ms
[2023-03-09 08:07:39] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-09 08:07:39] [INFO ] Invariant cache hit.
[2023-03-09 08:07:39] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-09 08:07:39] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 104/265 places, 91/235 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 501 ms. Remains : 104/265 places, 91/235 transitions.
Running random walk in product with property : AutoFlight-PT-12a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(EQ s51 1), p0:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2918 reset in 204 ms.
Product exploration explored 100000 steps with 2953 reset in 199 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/104 stabilizing places and 1/91 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 294 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 288 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 08:07:40] [INFO ] Invariant cache hit.
[2023-03-09 08:07:40] [INFO ] [Real]Absence check using 27 positive place invariants in 107 ms returned sat
[2023-03-09 08:07:40] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 426 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-09 08:07:41] [INFO ] Invariant cache hit.
[2023-03-09 08:07:41] [INFO ] [Real]Absence check using 27 positive place invariants in 6 ms returned sat
[2023-03-09 08:07:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:07:41] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-09 08:07:41] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-09 08:07:41] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2023-03-09 08:07:41] [INFO ] Computed and/alt/rep : 76/177/76 causal constraints (skipped 14 transitions) in 9 ms.
[2023-03-09 08:07:41] [INFO ] Added : 0 causal constraints over 0 iterations in 23 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 91/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-09 08:07:41] [INFO ] Invariant cache hit.
[2023-03-09 08:07:42] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-09 08:07:42] [INFO ] Invariant cache hit.
[2023-03-09 08:07:42] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-09 08:07:42] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-09 08:07:42] [INFO ] Invariant cache hit.
[2023-03-09 08:07:42] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 374 ms. Remains : 104/104 places, 91/91 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/104 stabilizing places and 1/91 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 258 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
[2023-03-09 08:07:43] [INFO ] Invariant cache hit.
[2023-03-09 08:07:43] [INFO ] [Real]Absence check using 27 positive place invariants in 6 ms returned sat
[2023-03-09 08:07:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:07:43] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2023-03-09 08:07:43] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-09 08:07:43] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2023-03-09 08:07:43] [INFO ] Computed and/alt/rep : 76/177/76 causal constraints (skipped 14 transitions) in 7 ms.
[2023-03-09 08:07:43] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2952 reset in 228 ms.
Product exploration explored 100000 steps with 2946 reset in 188 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 91/91 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 104 transition count 91
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 91
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-09 08:07:44] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 91 rows 104 cols
[2023-03-09 08:07:44] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-09 08:07:44] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/104 places, 91/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 199 ms. Remains : 104/104 places, 91/91 transitions.
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 91/91 transitions.
Applied a total of 0 rules in 0 ms. Remains 104 /104 variables (removed 0) and now considering 91/91 (removed 0) transitions.
// Phase 1: matrix 91 rows 104 cols
[2023-03-09 08:07:44] [INFO ] Computed 27 place invariants in 0 ms
[2023-03-09 08:07:44] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-09 08:07:44] [INFO ] Invariant cache hit.
[2023-03-09 08:07:44] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-09 08:07:45] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-03-09 08:07:45] [INFO ] Invariant cache hit.
[2023-03-09 08:07:45] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 104/104 places, 91/91 transitions.
Treatment of property AutoFlight-PT-12a-LTLCardinality-10 finished in 6415 ms.
[2023-03-09 08:07:45] [INFO ] Flatten gal took : 17 ms
[2023-03-09 08:07:45] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-09 08:07:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 265 places, 235 transitions and 665 arcs took 3 ms.
Total runtime 43083 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutoFlight-PT-12a
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/365
LTLCardinality

BK_STOP 1678349395788

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/365/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/365/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/365/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 4 (type EXCL) for 3 AutoFlight-PT-12a-LTLCardinality-10
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 4/32 AutoFlight-PT-12a-LTLCardinality-10 487111 m, 97422 m/sec, 3359054 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1800 6/32 AutoFlight-PT-12a-LTLCardinality-10 898876 m, 82353 m/sec, 6646784 t fired, .

Time elapsed: 10 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1800 9/32 AutoFlight-PT-12a-LTLCardinality-10 1330869 m, 86398 m/sec, 9877201 t fired, .

Time elapsed: 15 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1800 12/32 AutoFlight-PT-12a-LTLCardinality-10 1757187 m, 85263 m/sec, 13115188 t fired, .

Time elapsed: 20 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1800 15/32 AutoFlight-PT-12a-LTLCardinality-10 2154890 m, 79540 m/sec, 16355499 t fired, .

Time elapsed: 25 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1800 17/32 AutoFlight-PT-12a-LTLCardinality-10 2562286 m, 81479 m/sec, 19605975 t fired, .

Time elapsed: 30 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1800 20/32 AutoFlight-PT-12a-LTLCardinality-10 2953145 m, 78171 m/sec, 22841350 t fired, .

Time elapsed: 35 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1800 22/32 AutoFlight-PT-12a-LTLCardinality-10 3315881 m, 72547 m/sec, 26009981 t fired, .

Time elapsed: 40 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1800 24/32 AutoFlight-PT-12a-LTLCardinality-10 3661220 m, 69067 m/sec, 29224127 t fired, .

Time elapsed: 45 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1800 27/32 AutoFlight-PT-12a-LTLCardinality-10 4040543 m, 75864 m/sec, 32429475 t fired, .

Time elapsed: 50 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/1800 29/32 AutoFlight-PT-12a-LTLCardinality-10 4372170 m, 66325 m/sec, 35638799 t fired, .

Time elapsed: 55 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/1800 31/32 AutoFlight-PT-12a-LTLCardinality-10 4681056 m, 61777 m/sec, 38815409 t fired, .

Time elapsed: 60 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for AutoFlight-PT-12a-LTLCardinality-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 AutoFlight-PT-12a-LTLCardinality-00
lola: time limit : 3535 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3535 4/32 AutoFlight-PT-12a-LTLCardinality-00 483145 m, 96629 m/sec, 3355800 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3535 6/32 AutoFlight-PT-12a-LTLCardinality-00 895524 m, 82475 m/sec, 6671083 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3535 9/32 AutoFlight-PT-12a-LTLCardinality-00 1335150 m, 87925 m/sec, 9958019 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3535 12/32 AutoFlight-PT-12a-LTLCardinality-00 1765510 m, 86072 m/sec, 13230996 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3535 15/32 AutoFlight-PT-12a-LTLCardinality-00 2168399 m, 80577 m/sec, 16510222 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3535 17/32 AutoFlight-PT-12a-LTLCardinality-00 2579346 m, 82189 m/sec, 19799660 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3535 20/32 AutoFlight-PT-12a-LTLCardinality-00 2966691 m, 77469 m/sec, 23060900 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3535 22/32 AutoFlight-PT-12a-LTLCardinality-00 3332182 m, 73098 m/sec, 26255055 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3535 24/32 AutoFlight-PT-12a-LTLCardinality-00 3683183 m, 70200 m/sec, 29511422 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3535 27/32 AutoFlight-PT-12a-LTLCardinality-00 4066961 m, 76755 m/sec, 32759252 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3535 29/32 AutoFlight-PT-12a-LTLCardinality-00 4393138 m, 65235 m/sec, 35934177 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3535 31/32 AutoFlight-PT-12a-LTLCardinality-00 4702348 m, 61842 m/sec, 39110774 t fired, .

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for AutoFlight-PT-12a-LTLCardinality-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutoFlight-PT-12a-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
AutoFlight-PT-12a-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-12a-LTLCardinality-00: LTL unknown AGGR
AutoFlight-PT-12a-LTLCardinality-10: LTL unknown AGGR


Time elapsed: 130 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is AutoFlight-PT-12a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-oct2-167813595600467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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