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.r009-oct2-167813597900451.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 ltsminxred
Input is AutoFlight-PT-06a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597900451
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 8.2K Feb 25 18:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 18:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 17:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 17:59 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.2K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 43K 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-06a-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-06a-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-06a-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-06a-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-06a-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-06a-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-06a-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-06a-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-06a-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-06a-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-06a-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-06a-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-06a-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-06a-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-06a-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-06a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678629471566

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-06a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 13:57:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 13:57:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:57:54] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2023-03-12 13:57:54] [INFO ] Transformed 157 places.
[2023-03-12 13:57:54] [INFO ] Transformed 155 transitions.
[2023-03-12 13:57:54] [INFO ] Found NUPN structural information;
[2023-03-12 13:57:54] [INFO ] Parsed PT model containing 157 places and 155 transitions and 500 arcs in 136 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 30 transitions
Reduce redundant transitions removed 30 transitions.
FORMULA AutoFlight-PT-06a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 125/125 transitions.
Applied a total of 0 rules in 17 ms. Remains 157 /157 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 157 cols
[2023-03-12 13:57:54] [INFO ] Computed 40 place invariants in 9 ms
[2023-03-12 13:57:54] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-03-12 13:57:54] [INFO ] Invariant cache hit.
[2023-03-12 13:57:55] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-12 13:57:55] [INFO ] Implicit Places using invariants and state equation in 359 ms returned [7, 14, 21, 28, 35, 48, 51, 54, 60, 92, 118, 124, 130, 136, 142, 148, 154, 156]
Discarding 18 places :
Implicit Place search using SMT with State Equation took 863 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/157 places, 125/125 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 134 transition count 120
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 134 transition count 120
Applied a total of 10 rules in 12 ms. Remains 134 /139 variables (removed 5) and now considering 120/125 (removed 5) transitions.
// Phase 1: matrix 120 rows 134 cols
[2023-03-12 13:57:55] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-12 13:57:55] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-12 13:57:55] [INFO ] Invariant cache hit.
[2023-03-12 13:57:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 13:57:55] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 134/157 places, 120/125 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1161 ms. Remains : 134/157 places, 120/125 transitions.
Support contains 19 out of 134 places after structural reductions.
[2023-03-12 13:57:55] [INFO ] Flatten gal took : 32 ms
[2023-03-12 13:57:55] [INFO ] Flatten gal took : 19 ms
[2023-03-12 13:57:55] [INFO ] Input system was already deterministic with 120 transitions.
Incomplete random walk after 10000 steps, including 274 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 13:57:56] [INFO ] Invariant cache hit.
[2023-03-12 13:57:56] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 13:57:56] [INFO ] [Nat]Absence check using 22 positive place invariants in 13 ms returned sat
[2023-03-12 13:57:56] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 13:57:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 13:57:56] [INFO ] After 20ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 13:57:56] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-12 13:57:56] [INFO ] After 183ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 3 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 4 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' '!(G(F(p0)))'
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 120/120 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 134 transition count 82
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 96 transition count 82
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 76 place count 96 transition count 74
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 92 place count 88 transition count 74
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 95 place count 85 transition count 71
Iterating global reduction 2 with 3 rules applied. Total rules applied 98 place count 85 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 84 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 84 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 83 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 83 transition count 69
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 130 place count 69 transition count 55
Applied a total of 130 rules in 32 ms. Remains 69 /134 variables (removed 65) and now considering 55/120 (removed 65) transitions.
// Phase 1: matrix 55 rows 69 cols
[2023-03-12 13:57:56] [INFO ] Computed 22 place invariants in 4 ms
[2023-03-12 13:57:56] [INFO ] Implicit Places using invariants in 121 ms returned [25, 26, 27, 28, 29, 30, 31, 33]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 123 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/134 places, 55/120 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 61 transition count 48
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 54 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 54 transition count 47
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 16 place count 53 transition count 47
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 18 place count 52 transition count 46
Applied a total of 18 rules in 10 ms. Remains 52 /61 variables (removed 9) and now considering 46/55 (removed 9) transitions.
// Phase 1: matrix 46 rows 52 cols
[2023-03-12 13:57:56] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-12 13:57:56] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-12 13:57:56] [INFO ] Invariant cache hit.
[2023-03-12 13:57:57] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-12 13:57:57] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/134 places, 46/120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 329 ms. Remains : 52/134 places, 46/120 transitions.
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06a-LTLCardinality-00 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:(EQ s25 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]]
Product exploration explored 100000 steps with 8867 reset in 302 ms.
Product exploration explored 100000 steps with 8889 reset in 228 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/52 stabilizing places and 1/46 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 235 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(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 p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 363 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
[2023-03-12 13:57:58] [INFO ] Invariant cache hit.
[2023-03-12 13:57:59] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-12 13:57:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:57:59] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-12 13:57:59] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-12 13:57:59] [INFO ] [Real]Added 13 Read/Feed constraints in 23 ms returned sat
[2023-03-12 13:57:59] [INFO ] Computed and/alt/rep : 45/158/45 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 13:57:59] [INFO ] Added : 0 causal constraints over 0 iterations in 47 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 46/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2023-03-12 13:57:59] [INFO ] Invariant cache hit.
[2023-03-12 13:57:59] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-12 13:57:59] [INFO ] Invariant cache hit.
[2023-03-12 13:57:59] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-12 13:57:59] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-12 13:57:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 13:57:59] [INFO ] Invariant cache hit.
[2023-03-12 13:57:59] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 288 ms. Remains : 52/52 places, 46/46 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/52 stabilizing places and 1/46 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(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 p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 345 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
[2023-03-12 13:58:00] [INFO ] Invariant cache hit.
[2023-03-12 13:58:00] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-12 13:58:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:58:00] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-12 13:58:00] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-12 13:58:00] [INFO ] [Real]Added 13 Read/Feed constraints in 32 ms returned sat
[2023-03-12 13:58:00] [INFO ] Computed and/alt/rep : 45/158/45 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 13:58:00] [INFO ] Added : 0 causal constraints over 0 iterations in 34 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8950 reset in 186 ms.
Product exploration explored 100000 steps with 8934 reset in 201 ms.
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 46/46 transitions.
Applied a total of 0 rules in 14 ms. Remains 52 /52 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2023-03-12 13:58:01] [INFO ] Invariant cache hit.
[2023-03-12 13:58:01] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-03-12 13:58:01] [INFO ] Invariant cache hit.
[2023-03-12 13:58:01] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-12 13:58:01] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2023-03-12 13:58:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 13:58:01] [INFO ] Invariant cache hit.
[2023-03-12 13:58:01] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 514 ms. Remains : 52/52 places, 46/46 transitions.
Treatment of property AutoFlight-PT-06a-LTLCardinality-00 finished in 5056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 120/120 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 130 transition count 77
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 88 place count 88 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 87 transition count 76
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 89 place count 87 transition count 70
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 106 place count 76 transition count 70
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 110 place count 76 transition count 66
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 114 place count 72 transition count 66
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 116 place count 70 transition count 64
Iterating global reduction 5 with 2 rules applied. Total rules applied 118 place count 70 transition count 64
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 146 place count 56 transition count 50
Applied a total of 146 rules in 46 ms. Remains 56 /134 variables (removed 78) and now considering 50/120 (removed 70) transitions.
// Phase 1: matrix 50 rows 56 cols
[2023-03-12 13:58:01] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-12 13:58:01] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-12 13:58:01] [INFO ] Invariant cache hit.
[2023-03-12 13:58:01] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-12 13:58:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 13:58:01] [INFO ] Invariant cache hit.
[2023-03-12 13:58:02] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/134 places, 50/120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 310 ms. Remains : 56/134 places, 50/120 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-06a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s26 1) (OR (EQ s24 0) (EQ s44 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLCardinality-01 finished in 363 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)))'
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 120/120 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 134 transition count 82
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 96 transition count 82
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 76 place count 96 transition count 74
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 92 place count 88 transition count 74
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 95 place count 85 transition count 71
Iterating global reduction 2 with 3 rules applied. Total rules applied 98 place count 85 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 84 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 84 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 83 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 83 transition count 69
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 130 place count 69 transition count 55
Applied a total of 130 rules in 11 ms. Remains 69 /134 variables (removed 65) and now considering 55/120 (removed 65) transitions.
// Phase 1: matrix 55 rows 69 cols
[2023-03-12 13:58:02] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-12 13:58:02] [INFO ] Implicit Places using invariants in 163 ms returned [26, 27, 28, 29, 30, 31, 32, 33]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 168 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/134 places, 55/120 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 61 transition count 47
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 53 transition count 47
Applied a total of 16 rules in 3 ms. Remains 53 /61 variables (removed 8) and now considering 47/55 (removed 8) transitions.
// Phase 1: matrix 47 rows 53 cols
[2023-03-12 13:58:02] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-12 13:58:02] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-12 13:58:02] [INFO ] Invariant cache hit.
[2023-03-12 13:58:02] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-12 13:58:02] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/134 places, 47/120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 415 ms. Remains : 53/134 places, 47/120 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-06a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4763 reset in 128 ms.
Product exploration explored 100000 steps with 4759 reset in 187 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/53 stabilizing places and 1/47 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 219 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-12 13:58:03] [INFO ] Invariant cache hit.
[2023-03-12 13:58:03] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-12 13:58:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:58:03] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-12 13:58:03] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-12 13:58:03] [INFO ] [Real]Added 14 Read/Feed constraints in 2 ms returned sat
[2023-03-12 13:58:03] [INFO ] Computed and/alt/rep : 46/153/46 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 13:58:03] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 47/47 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2023-03-12 13:58:03] [INFO ] Invariant cache hit.
[2023-03-12 13:58:03] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-12 13:58:03] [INFO ] Invariant cache hit.
[2023-03-12 13:58:03] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-12 13:58:03] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2023-03-12 13:58:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 13:58:04] [INFO ] Invariant cache hit.
[2023-03-12 13:58:04] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 430 ms. Remains : 53/53 places, 47/47 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/53 stabilizing places and 1/47 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 195 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2023-03-12 13:58:04] [INFO ] Invariant cache hit.
[2023-03-12 13:58:04] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-12 13:58:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:58:04] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-12 13:58:04] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-12 13:58:04] [INFO ] [Real]Added 14 Read/Feed constraints in 2 ms returned sat
[2023-03-12 13:58:04] [INFO ] Computed and/alt/rep : 46/153/46 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 13:58:04] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4749 reset in 164 ms.
Product exploration explored 100000 steps with 4732 reset in 107 ms.
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 47/47 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2023-03-12 13:58:05] [INFO ] Invariant cache hit.
[2023-03-12 13:58:05] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-12 13:58:05] [INFO ] Invariant cache hit.
[2023-03-12 13:58:05] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-12 13:58:05] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2023-03-12 13:58:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 13:58:05] [INFO ] Invariant cache hit.
[2023-03-12 13:58:05] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 406 ms. Remains : 53/53 places, 47/47 transitions.
Treatment of property AutoFlight-PT-06a-LTLCardinality-02 finished in 3375 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||X(F((G(p2)||p1)))))))'
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 120/120 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 132 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 132 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 131 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 131 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 130 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 130 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 129 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 129 transition count 115
Applied a total of 10 rules in 14 ms. Remains 129 /134 variables (removed 5) and now considering 115/120 (removed 5) transitions.
// Phase 1: matrix 115 rows 129 cols
[2023-03-12 13:58:05] [INFO ] Computed 22 place invariants in 14 ms
[2023-03-12 13:58:05] [INFO ] Implicit Places using invariants in 144 ms returned [37, 40, 49]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 145 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/134 places, 115/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 126 /126 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 161 ms. Remains : 126/134 places, 115/120 transitions.
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-06a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s108 1), p1:(OR (EQ s10 0) (EQ s120 1)), p2:(OR (EQ s67 0) (EQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25311 reset in 214 ms.
Stack based approach found an accepted trace after 2029 steps with 491 reset with depth 58 and stack size 58 in 5 ms.
FORMULA AutoFlight-PT-06a-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-06a-LTLCardinality-04 finished in 659 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' '!(((p0 U p1)||(G(p2)&&X(F(p0)))))'
Support contains 6 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 120/120 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 132 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 132 transition count 118
Applied a total of 4 rules in 2 ms. Remains 132 /134 variables (removed 2) and now considering 118/120 (removed 2) transitions.
// Phase 1: matrix 118 rows 132 cols
[2023-03-12 13:58:06] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-12 13:58:06] [INFO ] Implicit Places using invariants in 161 ms returned [37, 49]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 176 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 130/134 places, 118/120 transitions.
Applied a total of 0 rules in 8 ms. Remains 130 /130 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 187 ms. Remains : 130/134 places, 118/120 transitions.
Stuttering acceptance computed with spot in 482 ms :[true, (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-06a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p2:(AND (OR (EQ s1 0) (EQ s81 1)) (OR (EQ s122 0) (EQ s39 1))), p0:(OR (EQ s46 0) (EQ s2 1)), p1:(AND (NOT (OR (EQ s46 0) (EQ s2 1))) (OR (EQ s122 0) (EQ ...], 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7792 reset in 261 ms.
Product exploration explored 100000 steps with 7698 reset in 219 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (AND p0 p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p1) p0 p2)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 1391 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 277 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 118 rows 130 cols
[2023-03-12 13:58:09] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-12 13:58:09] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-12 13:58:09] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-12 13:58:09] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (AND p0 p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p1) p0 p2)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (NOT p2)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 17 factoid took 1371 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 118/118 transitions.
Applied a total of 0 rules in 10 ms. Remains 130 /130 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2023-03-12 13:58:11] [INFO ] Invariant cache hit.
[2023-03-12 13:58:11] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-12 13:58:11] [INFO ] Invariant cache hit.
[2023-03-12 13:58:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 13:58:11] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2023-03-12 13:58:11] [INFO ] Invariant cache hit.
[2023-03-12 13:58:11] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 504 ms. Remains : 130/130 places, 118/118 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 252 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 20 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F p1), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 347 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 7654 reset in 196 ms.
Product exploration explored 100000 steps with 7652 reset in 227 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 118/118 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 130 transition count 118
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 43 place count 130 transition count 118
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 130 transition count 118
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 86 place count 93 transition count 81
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 123 place count 93 transition count 81
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 136 place count 93 transition count 81
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 91 transition count 79
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 91 transition count 79
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 140 rules in 34 ms. Remains 91 /130 variables (removed 39) and now considering 79/118 (removed 39) transitions.
[2023-03-12 13:58:13] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 79 rows 91 cols
[2023-03-12 13:58:13] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-12 13:58:13] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/130 places, 79/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 91/130 places, 79/118 transitions.
Support contains 6 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 118/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 130 cols
[2023-03-12 13:58:13] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-12 13:58:14] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-12 13:58:14] [INFO ] Invariant cache hit.
[2023-03-12 13:58:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 13:58:14] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-12 13:58:14] [INFO ] Invariant cache hit.
[2023-03-12 13:58:14] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 130/130 places, 118/118 transitions.
Treatment of property AutoFlight-PT-06a-LTLCardinality-05 finished in 8160 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((p0||X(X(F(p0))))))'
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 120/120 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 130 transition count 73
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 95 place count 84 transition count 73
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 95 place count 84 transition count 67
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 113 place count 72 transition count 67
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 6 rules applied. Total rules applied 119 place count 72 transition count 61
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 125 place count 66 transition count 61
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 127 place count 64 transition count 59
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 64 transition count 59
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 157 place count 50 transition count 45
Applied a total of 157 rules in 10 ms. Remains 50 /134 variables (removed 84) and now considering 45/120 (removed 75) transitions.
// Phase 1: matrix 45 rows 50 cols
[2023-03-12 13:58:14] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-12 13:58:14] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-12 13:58:14] [INFO ] Invariant cache hit.
[2023-03-12 13:58:14] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-12 13:58:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 13:58:14] [INFO ] Invariant cache hit.
[2023-03-12 13:58:14] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/134 places, 45/120 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 239 ms. Remains : 50/134 places, 45/120 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-06a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLCardinality-06 finished in 347 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' '!((p0 U X(X(G(!p0)))))'
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 120/120 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 131 transition count 117
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 131 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 130 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 130 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 129 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 129 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 128 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 128 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 127 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 127 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 126 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 126 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 125 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 125 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 124 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 124 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 123 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 123 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 122 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 122 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 121 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 121 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 120 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 120 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 119 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 119 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 118 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 118 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 117 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 117 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 116 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 116 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 115 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 115 transition count 101
Applied a total of 38 rules in 51 ms. Remains 115 /134 variables (removed 19) and now considering 101/120 (removed 19) transitions.
// Phase 1: matrix 101 rows 115 cols
[2023-03-12 13:58:14] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-12 13:58:14] [INFO ] Implicit Places using invariants in 50 ms returned [37, 40, 49]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 52 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/134 places, 101/120 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 100
Applied a total of 2 rules in 2 ms. Remains 111 /112 variables (removed 1) and now considering 100/101 (removed 1) transitions.
// Phase 1: matrix 100 rows 111 cols
[2023-03-12 13:58:14] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-12 13:58:14] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-12 13:58:14] [INFO ] Invariant cache hit.
[2023-03-12 13:58:14] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/134 places, 100/120 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 364 ms. Remains : 111/134 places, 100/120 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, p0, p0, p0]
Running random walk in product with property : AutoFlight-PT-06a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s13 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06a-LTLCardinality-12 finished in 486 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)))'
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)))'
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' '!(((p0 U p1)||(G(p2)&&X(F(p0)))))'
Found a Shortening insensitive property : AutoFlight-PT-06a-LTLCardinality-05
Stuttering acceptance computed with spot in 401 ms :[true, (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Support contains 6 out of 134 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 134/134 places, 120/120 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 134 transition count 84
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 98 transition count 84
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 72 place count 98 transition count 76
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 90 transition count 76
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 88 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 88 transition count 74
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 118 place count 75 transition count 61
Applied a total of 118 rules in 10 ms. Remains 75 /134 variables (removed 59) and now considering 61/120 (removed 59) transitions.
// Phase 1: matrix 61 rows 75 cols
[2023-03-12 13:58:15] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-12 13:58:15] [INFO ] Implicit Places using invariants in 105 ms returned [26, 27, 29, 30, 31, 34, 35]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 106 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 68/134 places, 61/120 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 68 transition count 54
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 61 transition count 54
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 61 transition count 52
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 18 place count 59 transition count 52
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 20 place count 58 transition count 51
Applied a total of 20 rules in 3 ms. Remains 58 /68 variables (removed 10) and now considering 51/61 (removed 10) transitions.
// Phase 1: matrix 51 rows 58 cols
[2023-03-12 13:58:15] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-12 13:58:16] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-12 13:58:16] [INFO ] Invariant cache hit.
[2023-03-12 13:58:16] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-12 13:58:16] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 58/134 places, 51/120 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 398 ms. Remains : 58/134 places, 51/120 transitions.
Running random walk in product with property : AutoFlight-PT-06a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p2:(AND (OR (EQ s1 0) (EQ s35 1)) (OR (EQ s53 0) (EQ s26 1))), p0:(OR (EQ s27 0) (EQ s2 1)), p1:(AND (NOT (OR (EQ s27 0) (EQ s2 1))) (OR (EQ s53 0) (EQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9683 reset in 184 ms.
Stack based approach found an accepted trace after 6358 steps with 611 reset with depth 8 and stack size 8 in 14 ms.
Treatment of property AutoFlight-PT-06a-LTLCardinality-05 finished in 1140 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-12 13:58:16] [INFO ] Flatten gal took : 7 ms
[2023-03-12 13:58:16] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-12 13:58:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 134 places, 120 transitions and 333 arcs took 1 ms.
Total runtime 22408 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1317/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1317/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1317/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutoFlight-PT-06a-LTLCardinality-00
Could not compute solution for formula : AutoFlight-PT-06a-LTLCardinality-02
Could not compute solution for formula : AutoFlight-PT-06a-LTLCardinality-05

BK_STOP 1678629497062

--------------------
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
mcc2023
ltl formula name AutoFlight-PT-06a-LTLCardinality-00
ltl formula formula --ltl=/tmp/1317/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 134 places, 120 transitions and 333 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1317/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1317/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1317/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1317/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55d8afa9a3f4]
1: pnml2lts-mc(+0xa2496) [0x55d8afa9a496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f2f0848f140]
3: pnml2lts-mc(+0x405be5) [0x55d8afdfdbe5]
4: pnml2lts-mc(+0x16b3f9) [0x55d8afb633f9]
5: pnml2lts-mc(+0x164ac4) [0x55d8afb5cac4]
6: pnml2lts-mc(+0x272e0a) [0x55d8afc6ae0a]
7: pnml2lts-mc(+0xb61f0) [0x55d8afaae1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f2f082e24d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f2f082e267a]
10: pnml2lts-mc(+0xa1581) [0x55d8afa99581]
11: pnml2lts-mc(+0xa1910) [0x55d8afa99910]
12: pnml2lts-mc(+0xa32a2) [0x55d8afa9b2a2]
13: pnml2lts-mc(+0xa50f4) [0x55d8afa9d0f4]
14: pnml2lts-mc(+0xa516b) [0x55d8afa9d16b]
15: pnml2lts-mc(+0x3f34b3) [0x55d8afdeb4b3]
16: pnml2lts-mc(+0x7c63d) [0x55d8afa7463d]
17: pnml2lts-mc(+0x67d86) [0x55d8afa5fd86]
18: pnml2lts-mc(+0x60a8a) [0x55d8afa58a8a]
19: pnml2lts-mc(+0x5eb15) [0x55d8afa56b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f2f082cad0a]
21: pnml2lts-mc(+0x6075e) [0x55d8afa5875e]
ltl formula name AutoFlight-PT-06a-LTLCardinality-02
ltl formula formula --ltl=/tmp/1317/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 134 places, 120 transitions and 333 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1317/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1317/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1317/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1317/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x563ab94493f4]
1: pnml2lts-mc(+0xa2496) [0x563ab9449496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fbf1fe77140]
3: pnml2lts-mc(+0x405be5) [0x563ab97acbe5]
4: pnml2lts-mc(+0x16b3f9) [0x563ab95123f9]
5: pnml2lts-mc(+0x164ac4) [0x563ab950bac4]
6: pnml2lts-mc(+0x272e0a) [0x563ab9619e0a]
7: pnml2lts-mc(+0xb61f0) [0x563ab945d1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fbf1fcca4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fbf1fcca67a]
10: pnml2lts-mc(+0xa1581) [0x563ab9448581]
11: pnml2lts-mc(+0xa1910) [0x563ab9448910]
12: pnml2lts-mc(+0xa32a2) [0x563ab944a2a2]
13: pnml2lts-mc(+0xa50f4) [0x563ab944c0f4]
14: pnml2lts-mc(+0x3f34b3) [0x563ab979a4b3]
15: pnml2lts-mc(+0x7c63d) [0x563ab942363d]
16: pnml2lts-mc(+0x67d86) [0x563ab940ed86]
17: pnml2lts-mc(+0x60a8a) [0x563ab9407a8a]
18: pnml2lts-mc(+0x5eb15) [0x563ab9405b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fbf1fcb2d0a]
20: pnml2lts-mc(+0x6075e) [0x563ab940775e]
ltl formula name AutoFlight-PT-06a-LTLCardinality-05
ltl formula formula --ltl=/tmp/1317/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 134 places, 120 transitions and 333 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.020 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1317/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1317/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1317/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1317/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-06a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutoFlight-PT-06a, 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 r009-oct2-167813597900451"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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