Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r043-smll-171620180200127.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is AutoFlight-PT-96a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180200127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 07:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 13 07:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 04:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 13 04:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 629K May 18 16:42 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-96a-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-96a-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-96a-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-96a-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-96a-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-96a-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-96a-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-96a-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-96a-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-96a-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-96a-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-96a-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-96a-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-96a-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-96a-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-96a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716298079375

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-96a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 13:28:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 13:28:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:28:02] [INFO ] Load time of PNML (sax parser for PT used): 318 ms
[2024-05-21 13:28:02] [INFO ] Transformed 2251 places.
[2024-05-21 13:28:02] [INFO ] Transformed 2225 transitions.
[2024-05-21 13:28:02] [INFO ] Found NUPN structural information;
[2024-05-21 13:28:02] [INFO ] Parsed PT model containing 2251 places and 2225 transitions and 6914 arcs in 446 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 384 transitions
Reduce redundant transitions removed 384 transitions.
FORMULA AutoFlight-PT-96a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-96a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 2251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Applied a total of 0 rules in 609 ms. Remains 2251 /2251 variables (removed 0) and now considering 1841/1841 (removed 0) transitions.
// Phase 1: matrix 1841 rows 2251 cols
[2024-05-21 13:28:03] [INFO ] Computed 514 invariants in 77 ms
[2024-05-21 13:28:05] [INFO ] Implicit Places using invariants in 2114 ms returned []
[2024-05-21 13:28:05] [INFO ] Invariant cache hit.
[2024-05-21 13:28:07] [INFO ] Implicit Places using invariants and state equation in 1952 ms returned []
Implicit Place search using SMT with State Equation took 4113 ms to find 0 implicit places.
[2024-05-21 13:28:07] [INFO ] Invariant cache hit.
[2024-05-21 13:28:09] [INFO ] Dead Transitions using invariants and state equation in 1943 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6671 ms. Remains : 2251/2251 places, 1841/1841 transitions.
Support contains 24 out of 2251 places after structural reductions.
[2024-05-21 13:28:09] [INFO ] Flatten gal took : 324 ms
[2024-05-21 13:28:10] [INFO ] Flatten gal took : 160 ms
[2024-05-21 13:28:10] [INFO ] Input system was already deterministic with 1841 transitions.
Incomplete random walk after 10000 steps, including 38 resets, run finished after 814 ms. (steps per millisecond=12 ) properties (out of 17) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-21 13:28:12] [INFO ] Invariant cache hit.
[2024-05-21 13:28:13] [INFO ] [Real]Absence check using 513 positive place invariants in 166 ms returned sat
[2024-05-21 13:28:13] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 13:28:16] [INFO ] After 3173ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2024-05-21 13:28:16] [INFO ] State equation strengthened by 384 read => feed constraints.
[2024-05-21 13:28:16] [INFO ] After 152ms SMT Verify possible using 384 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 13:28:16] [INFO ] After 4624ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 13:28:17] [INFO ] [Nat]Absence check using 513 positive place invariants in 197 ms returned sat
[2024-05-21 13:28:17] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 13:28:20] [INFO ] After 2255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-21 13:28:21] [INFO ] After 1570ms SMT Verify possible using 384 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-21 13:28:23] [INFO ] After 3088ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1143 ms.
[2024-05-21 13:28:24] [INFO ] After 7797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 5 properties in 81 ms.
Support contains 1 out of 2251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Drop transitions removed 440 transitions
Trivial Post-agglo rules discarded 440 transitions
Performed 440 trivial Post agglomeration. Transition count delta: 440
Iterating post reduction 0 with 440 rules applied. Total rules applied 440 place count 2251 transition count 1401
Reduce places removed 440 places and 0 transitions.
Iterating post reduction 1 with 440 rules applied. Total rules applied 880 place count 1811 transition count 1401
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 136 Pre rules applied. Total rules applied 880 place count 1811 transition count 1265
Deduced a syphon composed of 136 places in 3 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 1152 place count 1675 transition count 1265
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 2 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 1440 place count 1531 transition count 1121
Free-agglomeration rule applied 144 times.
Iterating global reduction 2 with 144 rules applied. Total rules applied 1584 place count 1531 transition count 977
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 2 with 144 rules applied. Total rules applied 1728 place count 1387 transition count 977
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1729 place count 1386 transition count 976
Reduce places removed 408 places and 0 transitions.
Drop transitions removed 661 transitions
Trivial Post-agglo rules discarded 661 transitions
Performed 661 trivial Post agglomeration. Transition count delta: 661
Iterating post reduction 3 with 1069 rules applied. Total rules applied 2798 place count 978 transition count 315
Reduce places removed 661 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 662 rules applied. Total rules applied 3460 place count 317 transition count 314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3461 place count 316 transition count 314
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 104 Pre rules applied. Total rules applied 3461 place count 316 transition count 210
Deduced a syphon composed of 104 places in 0 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 6 with 208 rules applied. Total rules applied 3669 place count 212 transition count 210
Applied a total of 3669 rules in 893 ms. Remains 212 /2251 variables (removed 2039) and now considering 210/1841 (removed 1631) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 896 ms. Remains : 212/2251 places, 210/1841 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 169 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U G(p1)))))'
Support contains 3 out of 2251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Applied a total of 0 rules in 149 ms. Remains 2251 /2251 variables (removed 0) and now considering 1841/1841 (removed 0) transitions.
[2024-05-21 13:28:25] [INFO ] Invariant cache hit.
[2024-05-21 13:28:28] [INFO ] Implicit Places using invariants in 2193 ms returned []
[2024-05-21 13:28:28] [INFO ] Invariant cache hit.
[2024-05-21 13:28:30] [INFO ] Implicit Places using invariants and state equation in 2015 ms returned []
Implicit Place search using SMT with State Equation took 4213 ms to find 0 implicit places.
[2024-05-21 13:28:30] [INFO ] Invariant cache hit.
[2024-05-21 13:28:32] [INFO ] Dead Transitions using invariants and state equation in 2538 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6905 ms. Remains : 2251/2251 places, 1841/1841 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 350 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-96a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s1511 0) (EQ s2247 1)), p0:(EQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5340 steps with 19 reset in 269 ms.
FORMULA AutoFlight-PT-96a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96a-LTLCardinality-00 finished in 7629 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 168 places and 0 transitions.
Drop transitions removed 736 transitions
Trivial Post-agglo rules discarded 736 transitions
Performed 736 trivial Post agglomeration. Transition count delta: 736
Iterating post reduction 0 with 904 rules applied. Total rules applied 904 place count 2082 transition count 1104
Reduce places removed 736 places and 0 transitions.
Iterating post reduction 1 with 736 rules applied. Total rules applied 1640 place count 1346 transition count 1104
Performed 224 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 224 Pre rules applied. Total rules applied 1640 place count 1346 transition count 880
Deduced a syphon composed of 224 places in 0 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 2 with 544 rules applied. Total rules applied 2184 place count 1026 transition count 880
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 2184 place count 1026 transition count 784
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 2376 place count 930 transition count 784
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 2664 place count 786 transition count 640
Applied a total of 2664 rules in 171 ms. Remains 786 /2251 variables (removed 1465) and now considering 640/1841 (removed 1201) transitions.
// Phase 1: matrix 640 rows 786 cols
[2024-05-21 13:28:33] [INFO ] Computed 250 invariants in 15 ms
[2024-05-21 13:28:34] [INFO ] Implicit Places using invariants in 866 ms returned [313, 339, 353, 367, 393, 419, 433, 447, 451, 455, 459, 463, 467, 471, 475, 479, 483, 487, 491, 495, 499, 503, 507, 511, 515, 519, 523, 527, 531, 535, 539, 543, 547, 551, 555, 559, 563, 567, 571, 575, 579, 583, 587, 591, 595, 599, 603, 607, 611, 615, 619, 623, 627, 631, 635, 639, 641, 643, 645, 647, 649, 651, 653, 655, 657, 659, 661, 663, 667, 671, 675, 679, 683, 687, 691, 695, 699, 703, 707, 711, 713, 715, 717, 719, 721, 723, 725, 727, 729, 731, 733, 735, 739, 743, 747, 751, 755, 759, 763, 767, 771, 775, 779, 783, 785]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 870 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 681/2251 places, 640/1841 transitions.
Graph (trivial) has 352 edges and 681 vertex of which 25 / 681 are part of one of the 1 SCC in 3 ms
Free SCC test removed 24 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 80 place count 578 transition count 514
Iterating global reduction 0 with 79 rules applied. Total rules applied 159 place count 578 transition count 514
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 0 with 2 rules applied. Total rules applied 161 place count 577 transition count 513
Applied a total of 161 rules in 134 ms. Remains 577 /681 variables (removed 104) and now considering 513/640 (removed 127) transitions.
// Phase 1: matrix 513 rows 577 cols
[2024-05-21 13:28:34] [INFO ] Computed 145 invariants in 5 ms
[2024-05-21 13:28:34] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-05-21 13:28:34] [INFO ] Invariant cache hit.
[2024-05-21 13:28:35] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1378 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 577/2251 places, 513/1841 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2560 ms. Remains : 577/2251 places, 513/1841 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-96a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s319 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 0 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-96a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96a-LTLCardinality-05 finished in 2633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 2251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 168 places and 0 transitions.
Drop transitions removed 736 transitions
Trivial Post-agglo rules discarded 736 transitions
Performed 736 trivial Post agglomeration. Transition count delta: 736
Iterating post reduction 0 with 904 rules applied. Total rules applied 904 place count 2082 transition count 1104
Reduce places removed 736 places and 0 transitions.
Iterating post reduction 1 with 736 rules applied. Total rules applied 1640 place count 1346 transition count 1104
Performed 224 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 224 Pre rules applied. Total rules applied 1640 place count 1346 transition count 880
Deduced a syphon composed of 224 places in 0 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 2 with 544 rules applied. Total rules applied 2184 place count 1026 transition count 880
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 2184 place count 1026 transition count 784
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 2376 place count 930 transition count 784
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 2664 place count 786 transition count 640
Applied a total of 2664 rules in 197 ms. Remains 786 /2251 variables (removed 1465) and now considering 640/1841 (removed 1201) transitions.
// Phase 1: matrix 640 rows 786 cols
[2024-05-21 13:28:36] [INFO ] Computed 250 invariants in 7 ms
[2024-05-21 13:28:37] [INFO ] Implicit Places using invariants in 868 ms returned [313, 339, 353, 367, 393, 419, 433, 447, 451, 455, 459, 463, 467, 471, 475, 479, 483, 487, 491, 495, 499, 503, 507, 511, 515, 519, 523, 527, 531, 535, 539, 543, 547, 551, 555, 559, 563, 567, 571, 575, 579, 583, 587, 591, 595, 599, 603, 607, 611, 615, 619, 623, 627, 631, 635, 639, 641, 643, 645, 647, 649, 651, 653, 655, 657, 659, 661, 663, 667, 671, 675, 679, 683, 687, 691, 695, 699, 703, 707, 711, 713, 715, 717, 719, 721, 723, 725, 727, 729, 731, 733, 735, 739, 743, 747, 751, 755, 759, 763, 767, 771, 775, 779, 783, 785]
Discarding 105 places :
Implicit Place search using SMT only with invariants took 874 ms to find 105 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 681/2251 places, 640/1841 transitions.
Graph (trivial) has 351 edges and 681 vertex of which 25 / 681 are part of one of the 1 SCC in 3 ms
Free SCC test removed 24 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 79 place count 579 transition count 515
Iterating global reduction 0 with 78 rules applied. Total rules applied 157 place count 579 transition count 515
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 159 place count 578 transition count 514
Applied a total of 159 rules in 57 ms. Remains 578 /681 variables (removed 103) and now considering 514/640 (removed 126) transitions.
// Phase 1: matrix 514 rows 578 cols
[2024-05-21 13:28:37] [INFO ] Computed 145 invariants in 4 ms
[2024-05-21 13:28:37] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-21 13:28:37] [INFO ] Invariant cache hit.
[2024-05-21 13:28:38] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1368 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 578/2251 places, 514/1841 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2497 ms. Remains : 578/2251 places, 514/1841 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-96a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s530 0) (NEQ s343 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-96a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96a-LTLCardinality-06 finished in 2595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((G(p1) U !p2))))'
Support contains 4 out of 2251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Applied a total of 0 rules in 146 ms. Remains 2251 /2251 variables (removed 0) and now considering 1841/1841 (removed 0) transitions.
// Phase 1: matrix 1841 rows 2251 cols
[2024-05-21 13:28:38] [INFO ] Computed 514 invariants in 12 ms
[2024-05-21 13:28:40] [INFO ] Implicit Places using invariants in 1625 ms returned []
[2024-05-21 13:28:40] [INFO ] Invariant cache hit.
[2024-05-21 13:28:42] [INFO ] Implicit Places using invariants and state equation in 2017 ms returned []
Implicit Place search using SMT with State Equation took 3648 ms to find 0 implicit places.
[2024-05-21 13:28:42] [INFO ] Invariant cache hit.
[2024-05-21 13:28:44] [INFO ] Dead Transitions using invariants and state equation in 2368 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6165 ms. Remains : 2251/2251 places, 1841/1841 transitions.
Stuttering acceptance computed with spot in 359 ms :[p2, p2, p2, true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-96a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p2 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s385 1), p2:(OR (EQ s2029 0) (EQ s2231 1)), p1:(EQ s2031 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-96a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96a-LTLCardinality-08 finished in 6553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U p1))))'
Support contains 3 out of 2251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Drop transitions removed 440 transitions
Trivial Post-agglo rules discarded 440 transitions
Performed 440 trivial Post agglomeration. Transition count delta: 440
Iterating post reduction 0 with 440 rules applied. Total rules applied 440 place count 2251 transition count 1401
Reduce places removed 440 places and 0 transitions.
Iterating post reduction 1 with 440 rules applied. Total rules applied 880 place count 1811 transition count 1401
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 136 Pre rules applied. Total rules applied 880 place count 1811 transition count 1265
Deduced a syphon composed of 136 places in 1 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 1152 place count 1675 transition count 1265
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 2 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 1438 place count 1532 transition count 1122
Applied a total of 1438 rules in 253 ms. Remains 1532 /2251 variables (removed 719) and now considering 1122/1841 (removed 719) transitions.
// Phase 1: matrix 1122 rows 1532 cols
[2024-05-21 13:28:45] [INFO ] Computed 514 invariants in 7 ms
[2024-05-21 13:29:09] [INFO ] Implicit Places using invariants in 23817 ms returned [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 76, 81, 86, 91, 96, 101, 106, 111, 116, 121, 126, 131, 136, 141, 146, 151, 156, 161, 166, 171, 176, 181, 186, 191, 196, 201, 206, 211, 216, 221, 226, 231, 236, 241, 246, 251, 256, 261, 266, 271, 276, 281, 286, 291, 296, 301, 306, 311, 316, 321, 326, 331, 336, 341, 346, 351, 356, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 627, 701, 739, 777, 851, 925, 963, 1001, 1007, 1013, 1019, 1025, 1031, 1037, 1043, 1049, 1055, 1061, 1067, 1073, 1079, 1085, 1091, 1097, 1103, 1109, 1115, 1121, 1127, 1133, 1139, 1145, 1151, 1157, 1163, 1169, 1175, 1181, 1187, 1193, 1199, 1205, 1211, 1217, 1223, 1229, 1235, 1241, 1247, 1253, 1259, 1265, 1271, 1277, 1283, 1289, 1293, 1297, 1301, 1305, 1309, 1313, 1317, 1321, 1325, 1329, 1333, 1337, 1343, 1349, 1355, 1361, 1367, 1373, 1379, 1385, 1391, 1397, 1403, 1409, 1413, 1417, 1421, 1425, 1429, 1433, 1437, 1441, 1445, 1449, 1453, 1457, 1463, 1469, 1475, 1481, 1487, 1493, 1499, 1505, 1511, 1517, 1523, 1529, 1531]
Discarding 368 places :
Implicit Place search using SMT only with invariants took 23824 ms to find 368 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1164/2251 places, 1122/1841 transitions.
Graph (trivial) has 829 edges and 1164 vertex of which 73 / 1164 are part of one of the 1 SCC in 1 ms
Free SCC test removed 72 places
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 427 transitions
Trivial Post-agglo rules discarded 427 transitions
Performed 427 trivial Post agglomeration. Transition count delta: 427
Iterating post reduction 0 with 427 rules applied. Total rules applied 428 place count 1092 transition count 600
Reduce places removed 427 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 428 rules applied. Total rules applied 856 place count 665 transition count 599
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 857 place count 664 transition count 599
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 857 place count 664 transition count 597
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 861 place count 662 transition count 597
Discarding 78 places :
Symmetric choice reduction at 3 with 78 rule applications. Total rules 939 place count 584 transition count 519
Iterating global reduction 3 with 78 rules applied. Total rules applied 1017 place count 584 transition count 519
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 3 with 2 rules applied. Total rules applied 1019 place count 583 transition count 518
Applied a total of 1019 rules in 61 ms. Remains 583 /1164 variables (removed 581) and now considering 518/1122 (removed 604) transitions.
// Phase 1: matrix 518 rows 583 cols
[2024-05-21 13:29:09] [INFO ] Computed 146 invariants in 3 ms
[2024-05-21 13:29:09] [INFO ] Implicit Places using invariants in 490 ms returned []
[2024-05-21 13:29:09] [INFO ] Invariant cache hit.
[2024-05-21 13:29:10] [INFO ] State equation strengthened by 145 read => feed constraints.
[2024-05-21 13:29:11] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned []
Implicit Place search using SMT with State Equation took 2026 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 583/2251 places, 518/1841 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26165 ms. Remains : 583/2251 places, 518/1841 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-96a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s290 1), p0:(OR (EQ s58 0) (EQ s339 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 932 reset in 1081 ms.
Product exploration explored 100000 steps with 969 reset in 1186 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/583 stabilizing places and 1/518 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 171 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 65 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 13:29:14] [INFO ] Invariant cache hit.
[2024-05-21 13:29:14] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 13:29:14] [INFO ] [Nat]Absence check using 146 positive place invariants in 43 ms returned sat
[2024-05-21 13:29:15] [INFO ] After 291ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-21 13:29:15] [INFO ] State equation strengthened by 145 read => feed constraints.
[2024-05-21 13:29:15] [INFO ] After 56ms SMT Verify possible using 145 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2024-05-21 13:29:15] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-21 13:29:15] [INFO ] After 648ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 518/518 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 583 transition count 517
Free-agglomeration rule applied 224 times.
Iterating global reduction 1 with 224 rules applied. Total rules applied 225 place count 583 transition count 293
Reduce places removed 224 places and 0 transitions.
Iterating post reduction 1 with 224 rules applied. Total rules applied 449 place count 359 transition count 293
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 452 place count 356 transition count 290
Iterating global reduction 2 with 3 rules applied. Total rules applied 455 place count 356 transition count 290
Applied a total of 455 rules in 39 ms. Remains 356 /583 variables (removed 227) and now considering 290/518 (removed 228) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 356/583 places, 290/518 transitions.
Finished random walk after 395 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=79 )
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 368 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
[2024-05-21 13:29:16] [INFO ] Invariant cache hit.
[2024-05-21 13:29:16] [INFO ] [Real]Absence check using 146 positive place invariants in 262 ms returned sat
[2024-05-21 13:29:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 13:29:16] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2024-05-21 13:29:16] [INFO ] State equation strengthened by 145 read => feed constraints.
[2024-05-21 13:29:16] [INFO ] [Real]Added 145 Read/Feed constraints in 19 ms returned sat
[2024-05-21 13:29:17] [INFO ] Computed and/alt/rep : 436/1015/436 causal constraints (skipped 81 transitions) in 54 ms.
[2024-05-21 13:29:17] [INFO ] Added : 0 causal constraints over 0 iterations in 119 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 583 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 583/583 places, 518/518 transitions.
Applied a total of 0 rules in 17 ms. Remains 583 /583 variables (removed 0) and now considering 518/518 (removed 0) transitions.
[2024-05-21 13:29:17] [INFO ] Invariant cache hit.
[2024-05-21 13:29:17] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-21 13:29:17] [INFO ] Invariant cache hit.
[2024-05-21 13:29:17] [INFO ] State equation strengthened by 145 read => feed constraints.
[2024-05-21 13:29:19] [INFO ] Implicit Places using invariants and state equation in 1498 ms returned []
Implicit Place search using SMT with State Equation took 1899 ms to find 0 implicit places.
[2024-05-21 13:29:19] [INFO ] Redundant transitions in 35 ms returned []
[2024-05-21 13:29:19] [INFO ] Invariant cache hit.
[2024-05-21 13:29:19] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2531 ms. Remains : 583/583 places, 518/518 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/583 stabilizing places and 1/518 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 154 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 65 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 13:29:20] [INFO ] Invariant cache hit.
[2024-05-21 13:29:20] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 13:29:20] [INFO ] [Nat]Absence check using 146 positive place invariants in 37 ms returned sat
[2024-05-21 13:29:20] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-21 13:29:20] [INFO ] State equation strengthened by 145 read => feed constraints.
[2024-05-21 13:29:21] [INFO ] After 45ms SMT Verify possible using 145 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2024-05-21 13:29:21] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-21 13:29:21] [INFO ] After 575ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 128 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=32 )
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 518/518 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 583 transition count 517
Free-agglomeration rule applied 224 times.
Iterating global reduction 1 with 224 rules applied. Total rules applied 225 place count 583 transition count 293
Reduce places removed 224 places and 0 transitions.
Iterating post reduction 1 with 224 rules applied. Total rules applied 449 place count 359 transition count 293
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 452 place count 356 transition count 290
Iterating global reduction 2 with 3 rules applied. Total rules applied 455 place count 356 transition count 290
Applied a total of 455 rules in 37 ms. Remains 356 /583 variables (removed 227) and now considering 290/518 (removed 228) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 356/583 places, 290/518 transitions.
Finished random walk after 542 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=60 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 13 factoid took 315 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-96a-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-96a-LTLCardinality-09 finished in 36297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Applied a total of 0 rules in 141 ms. Remains 2251 /2251 variables (removed 0) and now considering 1841/1841 (removed 0) transitions.
// Phase 1: matrix 1841 rows 2251 cols
[2024-05-21 13:29:21] [INFO ] Computed 514 invariants in 11 ms
[2024-05-21 13:29:23] [INFO ] Implicit Places using invariants in 2006 ms returned []
[2024-05-21 13:29:23] [INFO ] Invariant cache hit.
[2024-05-21 13:29:25] [INFO ] Implicit Places using invariants and state equation in 1613 ms returned []
Implicit Place search using SMT with State Equation took 3623 ms to find 0 implicit places.
[2024-05-21 13:29:25] [INFO ] Invariant cache hit.
[2024-05-21 13:29:27] [INFO ] Dead Transitions using invariants and state equation in 1872 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5639 ms. Remains : 2251/2251 places, 1841/1841 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-96a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s495 0) (EQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 8863 ms.
Product exploration explored 100000 steps with 50000 reset in 9014 ms.
Computed a total of 169 stabilizing places and 1 stable transitions
Computed a total of 169 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-96a-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-96a-LTLCardinality-11 finished in 23652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||G(p1))))'
Support contains 3 out of 2251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 2251 transition count 1404
Reduce places removed 437 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 438 rules applied. Total rules applied 875 place count 1814 transition count 1403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 876 place count 1813 transition count 1403
Performed 135 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 135 Pre rules applied. Total rules applied 876 place count 1813 transition count 1268
Deduced a syphon composed of 135 places in 1 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 270 rules applied. Total rules applied 1146 place count 1678 transition count 1268
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 1 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 288 rules applied. Total rules applied 1434 place count 1534 transition count 1124
Applied a total of 1434 rules in 259 ms. Remains 1534 /2251 variables (removed 717) and now considering 1124/1841 (removed 717) transitions.
// Phase 1: matrix 1124 rows 1534 cols
[2024-05-21 13:29:45] [INFO ] Computed 514 invariants in 9 ms
[2024-05-21 13:29:47] [INFO ] Implicit Places using invariants in 1862 ms returned []
[2024-05-21 13:29:47] [INFO ] Invariant cache hit.
[2024-05-21 13:29:48] [INFO ] State equation strengthened by 623 read => feed constraints.
[2024-05-21 13:30:18] [INFO ] Performed 446/1534 implicitness test of which 132 returned IMPLICIT in 30 seconds.
[2024-05-21 13:30:48] [INFO ] Performed 1501/1534 implicitness test of which 336 returned IMPLICIT in 60 seconds.
[2024-05-21 13:30:49] [INFO ] Implicit Places using invariants and state equation in 62103 ms returned [5, 10, 25, 35, 45, 60, 70, 85, 95, 110, 120, 130, 135, 140, 165, 170, 180, 190, 220, 230, 235, 240, 245, 250, 255, 260, 265, 270, 275, 280, 285, 290, 295, 300, 305, 310, 315, 320, 325, 330, 335, 340, 345, 350, 355, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 627, 701, 739, 779, 853, 927, 965, 1003, 1009, 1015, 1021, 1027, 1033, 1039, 1045, 1051, 1057, 1063, 1069, 1075, 1081, 1087, 1093, 1099, 1105, 1111, 1117, 1123, 1129, 1135, 1141, 1147, 1153, 1159, 1165, 1171, 1177, 1183, 1189, 1195, 1201, 1207, 1213, 1219, 1225, 1231, 1237, 1243, 1249, 1255, 1261, 1267, 1273, 1279, 1285, 1291, 1295, 1299, 1303, 1307, 1311, 1315, 1319, 1323, 1327, 1331, 1335, 1339, 1345, 1351, 1357, 1363, 1369, 1375, 1381, 1387, 1393, 1399, 1405, 1411, 1415, 1419, 1423, 1427, 1431, 1435, 1439, 1443, 1447, 1451, 1455, 1459, 1465, 1471, 1477, 1483, 1489, 1495, 1501, 1507, 1513, 1519, 1525, 1531]
Discarding 341 places :
Implicit Place search using SMT with State Equation took 63974 ms to find 341 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1193/2251 places, 1124/1841 transitions.
Drop transitions removed 214 transitions
Trivial Post-agglo rules discarded 214 transitions
Performed 214 trivial Post agglomeration. Transition count delta: 214
Iterating post reduction 0 with 214 rules applied. Total rules applied 214 place count 1193 transition count 910
Reduce places removed 214 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 215 rules applied. Total rules applied 429 place count 979 transition count 909
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 430 place count 978 transition count 909
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 160 Pre rules applied. Total rules applied 430 place count 978 transition count 749
Deduced a syphon composed of 160 places in 0 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 320 rules applied. Total rules applied 750 place count 818 transition count 749
Discarding 103 places :
Symmetric choice reduction at 3 with 103 rule applications. Total rules 853 place count 715 transition count 646
Iterating global reduction 3 with 103 rules applied. Total rules applied 956 place count 715 transition count 646
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 979 place count 715 transition count 623
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 982 place count 712 transition count 620
Iterating global reduction 4 with 3 rules applied. Total rules applied 985 place count 712 transition count 620
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 988 place count 709 transition count 617
Iterating global reduction 4 with 3 rules applied. Total rules applied 991 place count 709 transition count 617
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 994 place count 706 transition count 614
Iterating global reduction 4 with 3 rules applied. Total rules applied 997 place count 706 transition count 614
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1000 place count 703 transition count 611
Iterating global reduction 4 with 3 rules applied. Total rules applied 1003 place count 703 transition count 611
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1006 place count 700 transition count 608
Iterating global reduction 4 with 3 rules applied. Total rules applied 1009 place count 700 transition count 608
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1012 place count 697 transition count 605
Iterating global reduction 4 with 3 rules applied. Total rules applied 1015 place count 697 transition count 605
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1018 place count 694 transition count 602
Iterating global reduction 4 with 3 rules applied. Total rules applied 1021 place count 694 transition count 602
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1024 place count 691 transition count 599
Iterating global reduction 4 with 3 rules applied. Total rules applied 1027 place count 691 transition count 599
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1030 place count 688 transition count 596
Iterating global reduction 4 with 3 rules applied. Total rules applied 1033 place count 688 transition count 596
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1036 place count 685 transition count 593
Iterating global reduction 4 with 3 rules applied. Total rules applied 1039 place count 685 transition count 593
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1042 place count 682 transition count 590
Iterating global reduction 4 with 3 rules applied. Total rules applied 1045 place count 682 transition count 590
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1048 place count 679 transition count 587
Iterating global reduction 4 with 3 rules applied. Total rules applied 1051 place count 679 transition count 587
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1053 place count 677 transition count 585
Iterating global reduction 4 with 2 rules applied. Total rules applied 1055 place count 677 transition count 585
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1057 place count 675 transition count 583
Iterating global reduction 4 with 2 rules applied. Total rules applied 1059 place count 675 transition count 583
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1060 place count 674 transition count 582
Iterating global reduction 4 with 1 rules applied. Total rules applied 1061 place count 674 transition count 582
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1062 place count 673 transition count 581
Iterating global reduction 4 with 1 rules applied. Total rules applied 1063 place count 673 transition count 581
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1064 place count 672 transition count 580
Iterating global reduction 4 with 1 rules applied. Total rules applied 1065 place count 672 transition count 580
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1066 place count 671 transition count 579
Iterating global reduction 4 with 1 rules applied. Total rules applied 1067 place count 671 transition count 579
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1068 place count 670 transition count 578
Iterating global reduction 4 with 1 rules applied. Total rules applied 1069 place count 670 transition count 578
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1070 place count 669 transition count 577
Iterating global reduction 4 with 1 rules applied. Total rules applied 1071 place count 669 transition count 577
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1072 place count 668 transition count 576
Iterating global reduction 4 with 1 rules applied. Total rules applied 1073 place count 668 transition count 576
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1074 place count 667 transition count 575
Iterating global reduction 4 with 1 rules applied. Total rules applied 1075 place count 667 transition count 575
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1076 place count 666 transition count 574
Iterating global reduction 4 with 1 rules applied. Total rules applied 1077 place count 666 transition count 574
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1078 place count 665 transition count 573
Iterating global reduction 4 with 1 rules applied. Total rules applied 1079 place count 665 transition count 573
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1080 place count 664 transition count 572
Iterating global reduction 4 with 1 rules applied. Total rules applied 1081 place count 664 transition count 572
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1082 place count 663 transition count 571
Iterating global reduction 4 with 1 rules applied. Total rules applied 1083 place count 663 transition count 571
Applied a total of 1083 rules in 379 ms. Remains 663 /1193 variables (removed 530) and now considering 571/1124 (removed 553) transitions.
// Phase 1: matrix 571 rows 663 cols
[2024-05-21 13:30:49] [INFO ] Computed 173 invariants in 4 ms
[2024-05-21 13:30:50] [INFO ] Implicit Places using invariants in 870 ms returned [13, 18, 27, 45, 50, 59, 68, 73, 82, 91, 96, 105, 114, 131, 136, 141, 146, 159, 168, 177, 182, 187, 192, 197, 206, 662]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 872 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 637/2251 places, 571/1841 transitions.
Graph (trivial) has 276 edges and 637 vertex of which 2 / 637 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 636 transition count 525
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 591 transition count 525
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 91 place count 591 transition count 523
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 95 place count 589 transition count 523
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 587 transition count 521
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 587 transition count 521
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 101 place count 586 transition count 520
Applied a total of 101 rules in 38 ms. Remains 586 /637 variables (removed 51) and now considering 520/571 (removed 51) transitions.
// Phase 1: matrix 520 rows 586 cols
[2024-05-21 13:30:50] [INFO ] Computed 147 invariants in 3 ms
[2024-05-21 13:30:51] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-05-21 13:30:51] [INFO ] Invariant cache hit.
[2024-05-21 13:30:51] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-21 13:30:52] [INFO ] Implicit Places using invariants and state equation in 1509 ms returned []
Implicit Place search using SMT with State Equation took 2045 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 586/2251 places, 520/1841 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 67567 ms. Remains : 586/2251 places, 520/1841 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-96a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s33 1) (OR (EQ s290 0) (EQ s354 1))), p1:(EQ s33 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 1291 reset in 929 ms.
Product exploration explored 100000 steps with 1242 reset in 1030 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/586 stabilizing places and 1/520 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-21 13:30:55] [INFO ] Invariant cache hit.
[2024-05-21 13:30:55] [INFO ] [Real]Absence check using 147 positive place invariants in 68 ms returned sat
[2024-05-21 13:30:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 13:30:56] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2024-05-21 13:30:56] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-21 13:30:56] [INFO ] [Real]Added 147 Read/Feed constraints in 21 ms returned sat
[2024-05-21 13:30:56] [INFO ] Computed and/alt/rep : 438/1019/438 causal constraints (skipped 81 transitions) in 55 ms.
[2024-05-21 13:30:56] [INFO ] Added : 0 causal constraints over 0 iterations in 117 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 520/520 transitions.
Applied a total of 0 rules in 15 ms. Remains 586 /586 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2024-05-21 13:30:56] [INFO ] Invariant cache hit.
[2024-05-21 13:30:56] [INFO ] Implicit Places using invariants in 551 ms returned []
[2024-05-21 13:30:56] [INFO ] Invariant cache hit.
[2024-05-21 13:30:57] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-21 13:30:58] [INFO ] Implicit Places using invariants and state equation in 1322 ms returned []
Implicit Place search using SMT with State Equation took 1875 ms to find 0 implicit places.
[2024-05-21 13:30:58] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-21 13:30:58] [INFO ] Invariant cache hit.
[2024-05-21 13:30:58] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2387 ms. Remains : 586/586 places, 520/520 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/586 stabilizing places and 1/520 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 3 factoid took 204 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-21 13:30:59] [INFO ] Invariant cache hit.
[2024-05-21 13:30:59] [INFO ] [Real]Absence check using 147 positive place invariants in 58 ms returned sat
[2024-05-21 13:30:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 13:31:00] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2024-05-21 13:31:00] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-21 13:31:00] [INFO ] [Real]Added 147 Read/Feed constraints in 20 ms returned sat
[2024-05-21 13:31:00] [INFO ] Computed and/alt/rep : 438/1019/438 causal constraints (skipped 81 transitions) in 56 ms.
[2024-05-21 13:31:00] [INFO ] Added : 0 causal constraints over 0 iterations in 117 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 1346 reset in 929 ms.
Product exploration explored 100000 steps with 1293 reset in 1039 ms.
Built C files in :
/tmp/ltsmin7883794603281609610
[2024-05-21 13:31:02] [INFO ] Computing symmetric may disable matrix : 520 transitions.
[2024-05-21 13:31:02] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:31:02] [INFO ] Computing symmetric may enable matrix : 520 transitions.
[2024-05-21 13:31:02] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:31:02] [INFO ] Computing Do-Not-Accords matrix : 520 transitions.
[2024-05-21 13:31:02] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:31:02] [INFO ] Built C files in 134ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7883794603281609610
Running compilation step : cd /tmp/ltsmin7883794603281609610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1951 ms.
Running link step : cd /tmp/ltsmin7883794603281609610;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin7883794603281609610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased777300115464254277.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 520/520 transitions.
Applied a total of 0 rules in 20 ms. Remains 586 /586 variables (removed 0) and now considering 520/520 (removed 0) transitions.
[2024-05-21 13:31:17] [INFO ] Invariant cache hit.
[2024-05-21 13:31:18] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-05-21 13:31:18] [INFO ] Invariant cache hit.
[2024-05-21 13:31:18] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-21 13:31:19] [INFO ] Implicit Places using invariants and state equation in 1449 ms returned []
Implicit Place search using SMT with State Equation took 1988 ms to find 0 implicit places.
[2024-05-21 13:31:19] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-21 13:31:19] [INFO ] Invariant cache hit.
[2024-05-21 13:31:20] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2559 ms. Remains : 586/586 places, 520/520 transitions.
Built C files in :
/tmp/ltsmin1088989563501268741
[2024-05-21 13:31:20] [INFO ] Computing symmetric may disable matrix : 520 transitions.
[2024-05-21 13:31:20] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:31:20] [INFO ] Computing symmetric may enable matrix : 520 transitions.
[2024-05-21 13:31:20] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:31:20] [INFO ] Computing Do-Not-Accords matrix : 520 transitions.
[2024-05-21 13:31:20] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:31:20] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1088989563501268741
Running compilation step : cd /tmp/ltsmin1088989563501268741;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1732 ms.
Running link step : cd /tmp/ltsmin1088989563501268741;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1088989563501268741;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12621469728572601985.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 13:31:35] [INFO ] Flatten gal took : 27 ms
[2024-05-21 13:31:35] [INFO ] Flatten gal took : 27 ms
[2024-05-21 13:31:35] [INFO ] Time to serialize gal into /tmp/LTL9874857207298368214.gal : 6 ms
[2024-05-21 13:31:35] [INFO ] Time to serialize properties into /tmp/LTL16137227707147631935.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9874857207298368214.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8367698366266789254.hoa' '-atoms' '/tmp/LTL16137227707147631935.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16137227707147631935.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8367698366266789254.hoa
Detected timeout of ITS tools.
[2024-05-21 13:31:50] [INFO ] Flatten gal took : 23 ms
[2024-05-21 13:31:50] [INFO ] Flatten gal took : 23 ms
[2024-05-21 13:31:50] [INFO ] Time to serialize gal into /tmp/LTL13149297196189107134.gal : 3 ms
[2024-05-21 13:31:50] [INFO ] Time to serialize properties into /tmp/LTL1001752118126607438.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13149297196189107134.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1001752118126607438.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((p56==1)&&((p688==0)||(p1216==1)))"))||(G("(p56==1)")))))
Formula 0 simplified : F(G!"((p56==1)&&((p688==0)||(p1216==1)))" & F!"(p56==1)")
Detected timeout of ITS tools.
[2024-05-21 13:32:05] [INFO ] Flatten gal took : 24 ms
[2024-05-21 13:32:05] [INFO ] Applying decomposition
[2024-05-21 13:32:05] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7654911161593024535.txt' '-o' '/tmp/graph7654911161593024535.bin' '-w' '/tmp/graph7654911161593024535.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7654911161593024535.bin' '-l' '-1' '-v' '-w' '/tmp/graph7654911161593024535.weights' '-q' '0' '-e' '0.001'
[2024-05-21 13:32:05] [INFO ] Decomposing Gal with order
[2024-05-21 13:32:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 13:32:06] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-21 13:32:06] [INFO ] Flatten gal took : 188 ms
[2024-05-21 13:32:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2024-05-21 13:32:06] [INFO ] Time to serialize gal into /tmp/LTL10522938605030255751.gal : 14 ms
[2024-05-21 13:32:06] [INFO ] Time to serialize properties into /tmp/LTL3913443064019940837.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10522938605030255751.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3913443064019940837.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F("((i0.u16.p56==1)&&((i21.u146.p688==0)||(i9.i0.i0.u171.p1216==1)))"))||(G("(i0.u16.p56==1)")))))
Formula 0 simplified : F(G!"((i0.u16.p56==1)&&((i21.u146.p688==0)||(i9.i0.i0.u171.p1216==1)))" & F!"(i0.u16.p56==1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 144 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
163 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.74034,62404,1,0,37220,96385,4494,66893,2796,424644,32748
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-96a-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-96a-LTLCardinality-12 finished in 143142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 2251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Drop transitions removed 440 transitions
Trivial Post-agglo rules discarded 440 transitions
Performed 440 trivial Post agglomeration. Transition count delta: 440
Iterating post reduction 0 with 440 rules applied. Total rules applied 440 place count 2251 transition count 1401
Reduce places removed 440 places and 0 transitions.
Iterating post reduction 1 with 440 rules applied. Total rules applied 880 place count 1811 transition count 1401
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 136 Pre rules applied. Total rules applied 880 place count 1811 transition count 1265
Deduced a syphon composed of 136 places in 2 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 1152 place count 1675 transition count 1265
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 1 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 1440 place count 1531 transition count 1121
Applied a total of 1440 rules in 243 ms. Remains 1531 /2251 variables (removed 720) and now considering 1121/1841 (removed 720) transitions.
// Phase 1: matrix 1121 rows 1531 cols
[2024-05-21 13:32:08] [INFO ] Computed 514 invariants in 10 ms
[2024-05-21 13:32:35] [INFO ] Implicit Places using invariants in 26556 ms returned [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 95, 100, 105, 110, 115, 120, 125, 130, 135, 140, 145, 150, 155, 160, 165, 170, 175, 180, 185, 190, 195, 200, 205, 210, 215, 220, 230, 235, 240, 245, 250, 255, 260, 265, 270, 275, 280, 285, 290, 295, 300, 305, 310, 315, 320, 325, 330, 335, 340, 345, 350, 355, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 626, 700, 738, 776, 850, 924, 962, 1000, 1006, 1012, 1018, 1024, 1030, 1036, 1042, 1048, 1054, 1060, 1066, 1072, 1078, 1084, 1090, 1096, 1102, 1108, 1114, 1120, 1126, 1132, 1138, 1144, 1150, 1156, 1162, 1168, 1174, 1180, 1186, 1192, 1198, 1204, 1210, 1216, 1222, 1228, 1234, 1240, 1246, 1252, 1258, 1264, 1270, 1276, 1282, 1288, 1292, 1296, 1300, 1304, 1308, 1312, 1316, 1320, 1324, 1328, 1332, 1336, 1342, 1348, 1354, 1360, 1366, 1372, 1378, 1384, 1390, 1396, 1402, 1408, 1412, 1416, 1420, 1424, 1428, 1432, 1436, 1440, 1444, 1448, 1452, 1456, 1462, 1468, 1474, 1480, 1486, 1492, 1498, 1504, 1510, 1516, 1522, 1528, 1530]
Discarding 368 places :
Implicit Place search using SMT only with invariants took 26565 ms to find 368 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1163/2251 places, 1121/1841 transitions.
Graph (trivial) has 825 edges and 1163 vertex of which 73 / 1163 are part of one of the 1 SCC in 1 ms
Free SCC test removed 72 places
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 422 transitions
Trivial Post-agglo rules discarded 422 transitions
Performed 422 trivial Post agglomeration. Transition count delta: 422
Iterating post reduction 0 with 422 rules applied. Total rules applied 423 place count 1091 transition count 604
Reduce places removed 422 places and 0 transitions.
Iterating post reduction 1 with 422 rules applied. Total rules applied 845 place count 669 transition count 604
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 845 place count 669 transition count 600
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 853 place count 665 transition count 600
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 932 place count 586 transition count 521
Iterating global reduction 2 with 79 rules applied. Total rules applied 1011 place count 586 transition count 521
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1012 place count 585 transition count 520
Iterating global reduction 2 with 1 rules applied. Total rules applied 1013 place count 585 transition count 520
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1014 place count 584 transition count 519
Iterating global reduction 2 with 1 rules applied. Total rules applied 1015 place count 584 transition count 519
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 1017 place count 583 transition count 518
Applied a total of 1017 rules in 66 ms. Remains 583 /1163 variables (removed 580) and now considering 518/1121 (removed 603) transitions.
// Phase 1: matrix 518 rows 583 cols
[2024-05-21 13:32:35] [INFO ] Computed 146 invariants in 3 ms
[2024-05-21 13:32:35] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-21 13:32:35] [INFO ] Invariant cache hit.
[2024-05-21 13:32:35] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-21 13:32:37] [INFO ] Implicit Places using invariants and state equation in 1537 ms returned []
Implicit Place search using SMT with State Equation took 1952 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 583/2251 places, 518/1841 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 28827 ms. Remains : 583/2251 places, 518/1841 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-96a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s109 0) (EQ s414 1)), p0:(OR (EQ s181 0) (EQ s578 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 147 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-96a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-96a-LTLCardinality-14 finished in 28944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)||X(p1)||(p2 U p1)))||G(p2))))'
Support contains 2 out of 2251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Applied a total of 0 rules in 145 ms. Remains 2251 /2251 variables (removed 0) and now considering 1841/1841 (removed 0) transitions.
// Phase 1: matrix 1841 rows 2251 cols
[2024-05-21 13:32:37] [INFO ] Computed 514 invariants in 8 ms
[2024-05-21 13:32:38] [INFO ] Implicit Places using invariants in 1621 ms returned []
[2024-05-21 13:32:38] [INFO ] Invariant cache hit.
[2024-05-21 13:32:40] [INFO ] Implicit Places using invariants and state equation in 1881 ms returned []
Implicit Place search using SMT with State Equation took 3513 ms to find 0 implicit places.
[2024-05-21 13:32:40] [INFO ] Invariant cache hit.
[2024-05-21 13:32:42] [INFO ] Dead Transitions using invariants and state equation in 2089 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5749 ms. Remains : 2251/2251 places, 1841/1841 transitions.
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-96a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s449 1), p0:(EQ s449 0), p1:(EQ s189 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 380 reset in 2097 ms.
Product exploration explored 100000 steps with 381 reset in 2388 ms.
Computed a total of 169 stabilizing places and 1 stable transitions
Computed a total of 169 stabilizing places and 1 stable transitions
Detected a total of 169/2251 stabilizing places and 1/1841 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 9 factoid took 242 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 13:32:49] [INFO ] Invariant cache hit.
[2024-05-21 13:32:49] [INFO ] [Real]Absence check using 513 positive place invariants in 186 ms returned sat
[2024-05-21 13:32:49] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 13:32:49] [INFO ] After 782ms SMT Verify possible using all constraints in real 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 (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0)))), (G (NOT (AND (NOT p1) p2 (NOT p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 19 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-96a-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-96a-LTLCardinality-15 finished in 12663 ms.
All properties solved by simple procedures.
Total runtime 287957 ms.

BK_STOP 1716298371000

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-96a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is AutoFlight-PT-96a, 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 r043-smll-171620180200127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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