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-171620180100112.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-24b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180100112
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 22:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 120K Apr 12 22:14 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 538K 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-24b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-24b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716290450602

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-24b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 11:20:53] [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 11:20:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:20:53] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2024-05-21 11:20:53] [INFO ] Transformed 2230 places.
[2024-05-21 11:20:53] [INFO ] Transformed 2228 transitions.
[2024-05-21 11:20:53] [INFO ] Found NUPN structural information;
[2024-05-21 11:20:53] [INFO ] Parsed PT model containing 2230 places and 2228 transitions and 5186 arcs in 427 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 4 formulas.
FORMULA AutoFlight-PT-24b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 2230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Discarding 306 places :
Symmetric choice reduction at 0 with 306 rule applications. Total rules 306 place count 1924 transition count 1922
Iterating global reduction 0 with 306 rules applied. Total rules applied 612 place count 1924 transition count 1922
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 659 place count 1924 transition count 1875
Discarding 137 places :
Symmetric choice reduction at 1 with 137 rule applications. Total rules 796 place count 1787 transition count 1738
Iterating global reduction 1 with 137 rules applied. Total rules applied 933 place count 1787 transition count 1738
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 956 place count 1764 transition count 1715
Iterating global reduction 1 with 23 rules applied. Total rules applied 979 place count 1764 transition count 1715
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 1000 place count 1743 transition count 1694
Iterating global reduction 1 with 21 rules applied. Total rules applied 1021 place count 1743 transition count 1694
Applied a total of 1021 rules in 1349 ms. Remains 1743 /2230 variables (removed 487) and now considering 1694/2228 (removed 534) transitions.
// Phase 1: matrix 1694 rows 1743 cols
[2024-05-21 11:20:55] [INFO ] Computed 148 invariants in 56 ms
[2024-05-21 11:20:56] [INFO ] Implicit Places using invariants in 1271 ms returned []
[2024-05-21 11:20:56] [INFO ] Invariant cache hit.
[2024-05-21 11:21:00] [INFO ] Implicit Places using invariants and state equation in 3538 ms returned []
Implicit Place search using SMT with State Equation took 4882 ms to find 0 implicit places.
[2024-05-21 11:21:00] [INFO ] Invariant cache hit.
[2024-05-21 11:21:02] [INFO ] Dead Transitions using invariants and state equation in 2069 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1743/2230 places, 1694/2228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8304 ms. Remains : 1743/2230 places, 1694/2228 transitions.
Support contains 30 out of 1743 places after structural reductions.
[2024-05-21 11:21:02] [INFO ] Flatten gal took : 241 ms
[2024-05-21 11:21:02] [INFO ] Flatten gal took : 112 ms
[2024-05-21 11:21:03] [INFO ] Input system was already deterministic with 1694 transitions.
Support contains 27 out of 1743 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 572 ms. (steps per millisecond=17 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-21 11:21:03] [INFO ] Invariant cache hit.
[2024-05-21 11:21:04] [INFO ] After 492ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 11:21:05] [INFO ] [Nat]Absence check using 147 positive place invariants in 204 ms returned sat
[2024-05-21 11:21:05] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-21 11:21:07] [INFO ] After 1853ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-21 11:21:08] [INFO ] Deduced a trap composed of 33 places in 1307 ms of which 10 ms to minimize.
[2024-05-21 11:21:10] [INFO ] Deduced a trap composed of 67 places in 1168 ms of which 1 ms to minimize.
[2024-05-21 11:21:10] [INFO ] Deduced a trap composed of 29 places in 434 ms of which 2 ms to minimize.
[2024-05-21 11:21:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3333 ms
[2024-05-21 11:21:11] [INFO ] Deduced a trap composed of 224 places in 1049 ms of which 5 ms to minimize.
[2024-05-21 11:21:12] [INFO ] Deduced a trap composed of 191 places in 819 ms of which 2 ms to minimize.
[2024-05-21 11:21:13] [INFO ] Deduced a trap composed of 216 places in 889 ms of which 2 ms to minimize.
[2024-05-21 11:21:14] [INFO ] Deduced a trap composed of 209 places in 964 ms of which 3 ms to minimize.
[2024-05-21 11:21:16] [INFO ] Deduced a trap composed of 289 places in 1001 ms of which 4 ms to minimize.
[2024-05-21 11:21:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5416 ms
[2024-05-21 11:21:18] [INFO ] Deduced a trap composed of 252 places in 1240 ms of which 2 ms to minimize.
[2024-05-21 11:21:19] [INFO ] Deduced a trap composed of 268 places in 1037 ms of which 2 ms to minimize.
[2024-05-21 11:21:20] [INFO ] Deduced a trap composed of 273 places in 868 ms of which 2 ms to minimize.
[2024-05-21 11:21:21] [INFO ] Deduced a trap composed of 255 places in 1000 ms of which 2 ms to minimize.
[2024-05-21 11:21:22] [INFO ] Deduced a trap composed of 261 places in 1233 ms of which 2 ms to minimize.
[2024-05-21 11:21:23] [INFO ] Deduced a trap composed of 197 places in 1088 ms of which 1 ms to minimize.
[2024-05-21 11:21:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 7157 ms
[2024-05-21 11:21:24] [INFO ] Deduced a trap composed of 96 places in 396 ms of which 1 ms to minimize.
[2024-05-21 11:21:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 588 ms
[2024-05-21 11:21:24] [INFO ] After 19223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 858 ms.
[2024-05-21 11:21:25] [INFO ] After 21168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 1 properties in 361 ms.
Support contains 7 out of 1743 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Drop transitions removed 627 transitions
Trivial Post-agglo rules discarded 627 transitions
Performed 627 trivial Post agglomeration. Transition count delta: 627
Iterating post reduction 0 with 627 rules applied. Total rules applied 627 place count 1743 transition count 1067
Reduce places removed 627 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 700 rules applied. Total rules applied 1327 place count 1116 transition count 994
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1376 place count 1068 transition count 993
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1377 place count 1067 transition count 993
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 199 Pre rules applied. Total rules applied 1377 place count 1067 transition count 794
Deduced a syphon composed of 199 places in 6 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 398 rules applied. Total rules applied 1775 place count 868 transition count 794
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1779 place count 864 transition count 790
Iterating global reduction 4 with 4 rules applied. Total rules applied 1783 place count 864 transition count 790
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1783 place count 864 transition count 788
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1787 place count 862 transition count 788
Performed 339 Post agglomeration using F-continuation condition with reduction of 46 identical transitions.
Deduced a syphon composed of 339 places in 1 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 4 with 678 rules applied. Total rules applied 2465 place count 523 transition count 403
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 2467 place count 523 transition count 401
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2471 place count 521 transition count 399
Free-agglomeration rule applied 95 times.
Iterating global reduction 4 with 95 rules applied. Total rules applied 2566 place count 521 transition count 304
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 4 with 95 rules applied. Total rules applied 2661 place count 426 transition count 304
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2662 place count 425 transition count 303
Reduce places removed 113 places and 0 transitions.
Drop transitions removed 175 transitions
Trivial Post-agglo rules discarded 175 transitions
Performed 175 trivial Post agglomeration. Transition count delta: 175
Iterating post reduction 5 with 288 rules applied. Total rules applied 2950 place count 312 transition count 128
Reduce places removed 175 places and 0 transitions.
Iterating post reduction 6 with 175 rules applied. Total rules applied 3125 place count 137 transition count 128
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 45 Pre rules applied. Total rules applied 3125 place count 137 transition count 83
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 7 with 90 rules applied. Total rules applied 3215 place count 92 transition count 83
Applied a total of 3215 rules in 820 ms. Remains 92 /1743 variables (removed 1651) and now considering 83/1694 (removed 1611) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 822 ms. Remains : 92/1743 places, 83/1694 transitions.
Finished random walk after 111 steps, including 1 resets, run visited all 4 properties in 9 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutoFlight-PT-24b-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 429 stabilizing places and 429 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' '!(F(G((X(p1)||p0))))'
Support contains 4 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1732 transition count 1683
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1732 transition count 1683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1732 transition count 1682
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 1727 transition count 1677
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 1727 transition count 1677
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1726 transition count 1676
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1726 transition count 1676
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1725 transition count 1675
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1725 transition count 1675
Applied a total of 37 rules in 581 ms. Remains 1725 /1743 variables (removed 18) and now considering 1675/1694 (removed 19) transitions.
// Phase 1: matrix 1675 rows 1725 cols
[2024-05-21 11:21:27] [INFO ] Computed 148 invariants in 23 ms
[2024-05-21 11:21:28] [INFO ] Implicit Places using invariants in 949 ms returned []
[2024-05-21 11:21:28] [INFO ] Invariant cache hit.
[2024-05-21 11:21:33] [INFO ] Implicit Places using invariants and state equation in 4785 ms returned []
Implicit Place search using SMT with State Equation took 5736 ms to find 0 implicit places.
[2024-05-21 11:21:33] [INFO ] Invariant cache hit.
[2024-05-21 11:21:35] [INFO ] Dead Transitions using invariants and state equation in 2064 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1725/1743 places, 1675/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8386 ms. Remains : 1725/1743 places, 1675/1694 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 388 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s224 0) (EQ s96 1)), p1:(OR (EQ s234 0) (EQ s203 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 93 reset in 745 ms.
Product exploration explored 100000 steps with 93 reset in 516 ms.
Computed a total of 415 stabilizing places and 415 stable transitions
Computed a total of 415 stabilizing places and 415 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 139 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 11:21:37] [INFO ] Invariant cache hit.
[2024-05-21 11:21:38] [INFO ] After 495ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 11:21:39] [INFO ] [Nat]Absence check using 147 positive place invariants in 182 ms returned sat
[2024-05-21 11:21:39] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-21 11:21:40] [INFO ] After 1333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 11:21:41] [INFO ] Deduced a trap composed of 281 places in 974 ms of which 2 ms to minimize.
[2024-05-21 11:21:42] [INFO ] Deduced a trap composed of 281 places in 999 ms of which 2 ms to minimize.
[2024-05-21 11:21:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2325 ms
[2024-05-21 11:21:44] [INFO ] Deduced a trap composed of 188 places in 1148 ms of which 2 ms to minimize.
[2024-05-21 11:21:45] [INFO ] Deduced a trap composed of 194 places in 1028 ms of which 1 ms to minimize.
[2024-05-21 11:21:46] [INFO ] Deduced a trap composed of 187 places in 811 ms of which 2 ms to minimize.
[2024-05-21 11:21:47] [INFO ] Deduced a trap composed of 197 places in 902 ms of which 2 ms to minimize.
[2024-05-21 11:21:48] [INFO ] Deduced a trap composed of 170 places in 982 ms of which 1 ms to minimize.
[2024-05-21 11:21:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5445 ms
[2024-05-21 11:21:48] [INFO ] After 9295ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 176 ms.
[2024-05-21 11:21:48] [INFO ] After 10231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 885 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=126 )
Parikh walk visited 2 properties in 35 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 436 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1725 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1725/1725 places, 1675/1675 transitions.
Applied a total of 0 rules in 165 ms. Remains 1725 /1725 variables (removed 0) and now considering 1675/1675 (removed 0) transitions.
[2024-05-21 11:21:49] [INFO ] Invariant cache hit.
[2024-05-21 11:21:50] [INFO ] Implicit Places using invariants in 1004 ms returned []
[2024-05-21 11:21:50] [INFO ] Invariant cache hit.
[2024-05-21 11:21:53] [INFO ] Implicit Places using invariants and state equation in 3160 ms returned []
Implicit Place search using SMT with State Equation took 4174 ms to find 0 implicit places.
[2024-05-21 11:21:53] [INFO ] Invariant cache hit.
[2024-05-21 11:21:55] [INFO ] Dead Transitions using invariants and state equation in 2181 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6524 ms. Remains : 1725/1725 places, 1675/1675 transitions.
Computed a total of 415 stabilizing places and 415 stable transitions
Computed a total of 415 stabilizing places and 415 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 175 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 11:21:56] [INFO ] Invariant cache hit.
[2024-05-21 11:21:56] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 11:21:57] [INFO ] [Nat]Absence check using 147 positive place invariants in 132 ms returned sat
[2024-05-21 11:21:57] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-21 11:21:58] [INFO ] After 1222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 11:21:59] [INFO ] Deduced a trap composed of 281 places in 711 ms of which 2 ms to minimize.
[2024-05-21 11:22:00] [INFO ] Deduced a trap composed of 281 places in 672 ms of which 1 ms to minimize.
[2024-05-21 11:22:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1686 ms
[2024-05-21 11:22:00] [INFO ] Deduced a trap composed of 188 places in 685 ms of which 2 ms to minimize.
[2024-05-21 11:22:01] [INFO ] Deduced a trap composed of 194 places in 809 ms of which 2 ms to minimize.
[2024-05-21 11:22:02] [INFO ] Deduced a trap composed of 187 places in 916 ms of which 2 ms to minimize.
[2024-05-21 11:22:03] [INFO ] Deduced a trap composed of 197 places in 861 ms of which 2 ms to minimize.
[2024-05-21 11:22:04] [INFO ] Deduced a trap composed of 170 places in 853 ms of which 2 ms to minimize.
[2024-05-21 11:22:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4769 ms
[2024-05-21 11:22:05] [INFO ] After 7865ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 217 ms.
[2024-05-21 11:22:05] [INFO ] After 8587ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 877 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=125 )
Parikh walk visited 2 properties in 31 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 304 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 93 reset in 366 ms.
Product exploration explored 100000 steps with 93 reset in 444 ms.
Built C files in :
/tmp/ltsmin5915242344329011374
[2024-05-21 11:22:06] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5915242344329011374
Running compilation step : cd /tmp/ltsmin5915242344329011374;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5915242344329011374;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5915242344329011374;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1725 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1725/1725 places, 1675/1675 transitions.
Applied a total of 0 rules in 116 ms. Remains 1725 /1725 variables (removed 0) and now considering 1675/1675 (removed 0) transitions.
[2024-05-21 11:22:10] [INFO ] Invariant cache hit.
[2024-05-21 11:22:10] [INFO ] Implicit Places using invariants in 853 ms returned []
[2024-05-21 11:22:10] [INFO ] Invariant cache hit.
[2024-05-21 11:22:14] [INFO ] Implicit Places using invariants and state equation in 3067 ms returned []
Implicit Place search using SMT with State Equation took 3922 ms to find 0 implicit places.
[2024-05-21 11:22:14] [INFO ] Invariant cache hit.
[2024-05-21 11:22:16] [INFO ] Dead Transitions using invariants and state equation in 2146 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6187 ms. Remains : 1725/1725 places, 1675/1675 transitions.
Built C files in :
/tmp/ltsmin13292219949933227568
[2024-05-21 11:22:16] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13292219949933227568
Running compilation step : cd /tmp/ltsmin13292219949933227568;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13292219949933227568;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13292219949933227568;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 11:22:19] [INFO ] Flatten gal took : 91 ms
[2024-05-21 11:22:19] [INFO ] Flatten gal took : 89 ms
[2024-05-21 11:22:19] [INFO ] Time to serialize gal into /tmp/LTL11556461060470199362.gal : 13 ms
[2024-05-21 11:22:19] [INFO ] Time to serialize properties into /tmp/LTL11264802491576144456.prop : 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/LTL11556461060470199362.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7489190969672809871.hoa' '-atoms' '/tmp/LTL11264802491576144456.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...319
Loading property file /tmp/LTL11264802491576144456.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7489190969672809871.hoa
Detected timeout of ITS tools.
[2024-05-21 11:22:34] [INFO ] Flatten gal took : 87 ms
[2024-05-21 11:22:34] [INFO ] Flatten gal took : 64 ms
[2024-05-21 11:22:34] [INFO ] Time to serialize gal into /tmp/LTL15560700887728795329.gal : 10 ms
[2024-05-21 11:22:34] [INFO ] Time to serialize properties into /tmp/LTL17713237527648568657.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15560700887728795329.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17713237527648568657.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...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("((p293==0)||(p96==1))")||(X("((p307==0)||(p258==1))"))))))
Formula 0 simplified : GF(!"((p293==0)||(p96==1))" & X!"((p307==0)||(p258==1))")
Detected timeout of ITS tools.
[2024-05-21 11:22:49] [INFO ] Flatten gal took : 50 ms
[2024-05-21 11:22:49] [INFO ] Applying decomposition
[2024-05-21 11:22:49] [INFO ] Flatten gal took : 50 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/graph1868240435024233223.txt' '-o' '/tmp/graph1868240435024233223.bin' '-w' '/tmp/graph1868240435024233223.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1868240435024233223.bin' '-l' '-1' '-v' '-w' '/tmp/graph1868240435024233223.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:22:50] [INFO ] Decomposing Gal with order
[2024-05-21 11:22:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:22:50] [INFO ] Removed a total of 331 redundant transitions.
[2024-05-21 11:22:50] [INFO ] Flatten gal took : 190 ms
[2024-05-21 11:22:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2024-05-21 11:22:50] [INFO ] Time to serialize gal into /tmp/LTL15330097799242796228.gal : 32 ms
[2024-05-21 11:22:50] [INFO ] Time to serialize properties into /tmp/LTL16077857951937885055.ltl : 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/LTL15330097799242796228.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16077857951937885055.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...256
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i13.u96.p293==0)||(i11.u41.p96==1))")||(X("((i16.u101.p307==0)||(i13.u87.p258==1))"))))))
Formula 0 simplified : GF(!"((i13.u96.p293==0)||(i11.u41.p96==1))" & X!"((i16.u101.p307==0)||(i13.u87.p258==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11259600227518409040
[2024-05-21 11:23:05] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11259600227518409040
Running compilation step : cd /tmp/ltsmin11259600227518409040;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11259600227518409040;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11259600227518409040;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutoFlight-PT-24b-LTLCardinality-01 finished in 101850 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 1743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 629 transitions
Trivial Post-agglo rules discarded 629 transitions
Performed 629 trivial Post agglomeration. Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 1742 transition count 1064
Reduce places removed 629 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 702 rules applied. Total rules applied 1331 place count 1113 transition count 991
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1379 place count 1065 transition count 991
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 1379 place count 1065 transition count 793
Deduced a syphon composed of 198 places in 4 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 1775 place count 867 transition count 793
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1784 place count 858 transition count 784
Iterating global reduction 3 with 9 rules applied. Total rules applied 1793 place count 858 transition count 784
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1793 place count 858 transition count 779
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1803 place count 853 transition count 779
Performed 340 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 3 with 680 rules applied. Total rules applied 2483 place count 513 transition count 391
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2484 place count 512 transition count 390
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 3 with 72 rules applied. Total rules applied 2556 place count 464 transition count 366
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 2580 place count 440 transition count 366
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2580 place count 440 transition count 342
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2628 place count 416 transition count 342
Applied a total of 2628 rules in 270 ms. Remains 416 /1743 variables (removed 1327) and now considering 342/1694 (removed 1352) transitions.
// Phase 1: matrix 342 rows 416 cols
[2024-05-21 11:23:09] [INFO ] Computed 100 invariants in 2 ms
[2024-05-21 11:23:09] [INFO ] Implicit Places using invariants in 367 ms returned [169, 243, 317, 326, 330, 334, 338, 342, 346, 350, 354, 358, 362, 366, 370, 374, 378, 382, 386, 390, 394, 398, 402, 406, 410, 415]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 369 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 390/1743 places, 342/1694 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 366 transition count 318
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 366 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 365 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 365 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 364 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 364 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 363 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 363 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 362 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 362 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 361 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 361 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 360 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 360 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 359 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 359 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 358 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 358 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 357 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 357 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 356 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 356 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 355 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 355 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 354 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 354 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 353 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 353 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 352 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 352 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 351 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 351 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 350 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 350 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 349 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 349 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 348 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 348 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 347 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 347 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 346 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 346 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 345 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 345 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 344 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 344 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 343 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 343 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 342 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 342 transition count 294
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 100 place count 340 transition count 292
Applied a total of 100 rules in 159 ms. Remains 340 /390 variables (removed 50) and now considering 292/342 (removed 50) transitions.
// Phase 1: matrix 292 rows 340 cols
[2024-05-21 11:23:09] [INFO ] Computed 74 invariants in 1 ms
[2024-05-21 11:23:10] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-21 11:23:10] [INFO ] Invariant cache hit.
[2024-05-21 11:23:10] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 821 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 340/1743 places, 292/1694 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1620 ms. Remains : 340/1743 places, 292/1694 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-02 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:(OR (EQ s294 0) (EQ s24 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 74 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-02 finished in 1712 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(p0)))'
Support contains 2 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1733 transition count 1684
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1733 transition count 1684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1733 transition count 1683
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 1730 transition count 1680
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 1730 transition count 1680
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1729 transition count 1679
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1729 transition count 1679
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1728 transition count 1678
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1728 transition count 1678
Applied a total of 31 rules in 581 ms. Remains 1728 /1743 variables (removed 15) and now considering 1678/1694 (removed 16) transitions.
// Phase 1: matrix 1678 rows 1728 cols
[2024-05-21 11:23:11] [INFO ] Computed 148 invariants in 11 ms
[2024-05-21 11:23:12] [INFO ] Implicit Places using invariants in 763 ms returned []
[2024-05-21 11:23:12] [INFO ] Invariant cache hit.
[2024-05-21 11:23:14] [INFO ] Implicit Places using invariants and state equation in 2972 ms returned []
Implicit Place search using SMT with State Equation took 3737 ms to find 0 implicit places.
[2024-05-21 11:23:14] [INFO ] Invariant cache hit.
[2024-05-21 11:23:16] [INFO ] Dead Transitions using invariants and state equation in 1873 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1728/1743 places, 1678/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6193 ms. Remains : 1728/1743 places, 1678/1694 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s337 0) (EQ s516 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 94 reset in 464 ms.
Entered a terminal (fully accepting) state of product in 38121 steps with 35 reset in 181 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-03 finished in 6949 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((G(p1)||p0))))'
Support contains 6 out of 1743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 625 transitions
Trivial Post-agglo rules discarded 625 transitions
Performed 625 trivial Post agglomeration. Transition count delta: 625
Iterating post reduction 0 with 625 rules applied. Total rules applied 625 place count 1742 transition count 1068
Reduce places removed 625 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 698 rules applied. Total rules applied 1323 place count 1117 transition count 995
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 50 rules applied. Total rules applied 1373 place count 1069 transition count 993
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1375 place count 1067 transition count 993
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 200 Pre rules applied. Total rules applied 1375 place count 1067 transition count 793
Deduced a syphon composed of 200 places in 5 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 4 with 400 rules applied. Total rules applied 1775 place count 867 transition count 793
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1784 place count 858 transition count 784
Iterating global reduction 4 with 9 rules applied. Total rules applied 1793 place count 858 transition count 784
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 1793 place count 858 transition count 779
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1803 place count 853 transition count 779
Performed 332 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 332 places in 1 ms
Reduce places removed 332 places and 0 transitions.
Iterating global reduction 4 with 664 rules applied. Total rules applied 2467 place count 521 transition count 399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2468 place count 520 transition count 398
Reduce places removed 28 places and 0 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 4 with 42 rules applied. Total rules applied 2510 place count 492 transition count 384
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 2524 place count 478 transition count 384
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 2524 place count 478 transition count 370
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 2552 place count 464 transition count 370
Applied a total of 2552 rules in 234 ms. Remains 464 /1743 variables (removed 1279) and now considering 370/1694 (removed 1324) transitions.
// Phase 1: matrix 370 rows 464 cols
[2024-05-21 11:23:17] [INFO ] Computed 120 invariants in 2 ms
[2024-05-21 11:23:18] [INFO ] Implicit Places using invariants in 363 ms returned [386, 392, 398, 404, 408, 412, 416, 420, 424, 428, 432, 436, 440, 444, 448, 458, 463]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 366 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 447/1743 places, 370/1694 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 432 transition count 355
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 432 transition count 355
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 52 place count 421 transition count 344
Applied a total of 52 rules in 36 ms. Remains 421 /447 variables (removed 26) and now considering 344/370 (removed 26) transitions.
// Phase 1: matrix 344 rows 421 cols
[2024-05-21 11:23:18] [INFO ] Computed 103 invariants in 3 ms
[2024-05-21 11:23:18] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-21 11:23:18] [INFO ] Invariant cache hit.
[2024-05-21 11:23:18] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-21 11:23:20] [INFO ] Implicit Places using invariants and state equation in 1659 ms returned [174, 176, 178, 180, 182, 184, 186, 188, 190]
Discarding 9 places :
Implicit Place search using SMT with State Equation took 1964 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 412/1743 places, 344/1694 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 412 transition count 335
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 403 transition count 335
Applied a total of 18 rules in 14 ms. Remains 403 /412 variables (removed 9) and now considering 335/344 (removed 9) transitions.
// Phase 1: matrix 335 rows 403 cols
[2024-05-21 11:23:20] [INFO ] Computed 94 invariants in 2 ms
[2024-05-21 11:23:20] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-21 11:23:20] [INFO ] Invariant cache hit.
[2024-05-21 11:23:21] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-05-21 11:23:22] [INFO ] Implicit Places using invariants and state equation in 1805 ms returned []
Implicit Place search using SMT with State Equation took 2212 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 403/1743 places, 335/1694 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4828 ms. Remains : 403/1743 places, 335/1694 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s3 0) (EQ s356 1)), p0:(OR (EQ s399 0) (EQ s274 1) (AND (NEQ s1 0) (NEQ s42 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1269 reset in 463 ms.
Product exploration explored 100000 steps with 1290 reset in 693 ms.
Computed a total of 21 stabilizing places and 10 stable transitions
Computed a total of 21 stabilizing places and 10 stable transitions
Detected a total of 21/403 stabilizing places and 10/335 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 220 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2140 steps, including 25 resets, run visited all 2 properties in 12 ms. (steps per millisecond=178 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 276 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 335/335 transitions.
Applied a total of 0 rules in 10 ms. Remains 403 /403 variables (removed 0) and now considering 335/335 (removed 0) transitions.
[2024-05-21 11:23:24] [INFO ] Invariant cache hit.
[2024-05-21 11:23:24] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-05-21 11:23:24] [INFO ] Invariant cache hit.
[2024-05-21 11:23:25] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-05-21 11:23:26] [INFO ] Implicit Places using invariants and state equation in 1499 ms returned []
Implicit Place search using SMT with State Equation took 1935 ms to find 0 implicit places.
[2024-05-21 11:23:26] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-21 11:23:26] [INFO ] Invariant cache hit.
[2024-05-21 11:23:26] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2344 ms. Remains : 403/403 places, 335/335 transitions.
Computed a total of 21 stabilizing places and 10 stable transitions
Computed a total of 21 stabilizing places and 10 stable transitions
Detected a total of 21/403 stabilizing places and 10/335 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 216 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 361 steps, including 4 resets, run visited all 2 properties in 4 ms. (steps per millisecond=90 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 276 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1291 reset in 594 ms.
Product exploration explored 100000 steps with 1271 reset in 483 ms.
Built C files in :
/tmp/ltsmin509146221129506475
[2024-05-21 11:23:28] [INFO ] Computing symmetric may disable matrix : 335 transitions.
[2024-05-21 11:23:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:23:28] [INFO ] Computing symmetric may enable matrix : 335 transitions.
[2024-05-21 11:23:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:23:28] [INFO ] Computing Do-Not-Accords matrix : 335 transitions.
[2024-05-21 11:23:28] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:23:28] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin509146221129506475
Running compilation step : cd /tmp/ltsmin509146221129506475;'/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 1097 ms.
Running link step : cd /tmp/ltsmin509146221129506475;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin509146221129506475;'/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/stateBased690165940533782047.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 335/335 transitions.
Applied a total of 0 rules in 10 ms. Remains 403 /403 variables (removed 0) and now considering 335/335 (removed 0) transitions.
[2024-05-21 11:23:43] [INFO ] Invariant cache hit.
[2024-05-21 11:23:44] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-21 11:23:44] [INFO ] Invariant cache hit.
[2024-05-21 11:23:44] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-05-21 11:23:45] [INFO ] Implicit Places using invariants and state equation in 1576 ms returned []
Implicit Place search using SMT with State Equation took 1950 ms to find 0 implicit places.
[2024-05-21 11:23:45] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-21 11:23:45] [INFO ] Invariant cache hit.
[2024-05-21 11:23:46] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2531 ms. Remains : 403/403 places, 335/335 transitions.
Built C files in :
/tmp/ltsmin3377096443528372147
[2024-05-21 11:23:46] [INFO ] Computing symmetric may disable matrix : 335 transitions.
[2024-05-21 11:23:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:23:46] [INFO ] Computing symmetric may enable matrix : 335 transitions.
[2024-05-21 11:23:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:23:46] [INFO ] Computing Do-Not-Accords matrix : 335 transitions.
[2024-05-21 11:23:46] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:23:46] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3377096443528372147
Running compilation step : cd /tmp/ltsmin3377096443528372147;'/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 1836 ms.
Running link step : cd /tmp/ltsmin3377096443528372147;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3377096443528372147;'/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/stateBased15151358720336162959.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 11:24:01] [INFO ] Flatten gal took : 15 ms
[2024-05-21 11:24:01] [INFO ] Flatten gal took : 13 ms
[2024-05-21 11:24:01] [INFO ] Time to serialize gal into /tmp/LTL5062633126497469652.gal : 4 ms
[2024-05-21 11:24:01] [INFO ] Time to serialize properties into /tmp/LTL1025484568379471667.prop : 8 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/LTL5062633126497469652.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8688941291243936653.hoa' '-atoms' '/tmp/LTL1025484568379471667.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...317
Loading property file /tmp/LTL1025484568379471667.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8688941291243936653.hoa
Detected timeout of ITS tools.
[2024-05-21 11:24:16] [INFO ] Flatten gal took : 12 ms
[2024-05-21 11:24:16] [INFO ] Flatten gal took : 14 ms
[2024-05-21 11:24:16] [INFO ] Time to serialize gal into /tmp/LTL11097396702081506378.gal : 3 ms
[2024-05-21 11:24:16] [INFO ] Time to serialize properties into /tmp/LTL7392496158711643987.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/LTL11097396702081506378.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7392496158711643987.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(("((p2204==0)||(p1710==1))")||((G("((p65==0)||(p1920==1))"))||("((p32!=0)&&(p328!=1))"))))))
Formula 0 simplified : G(F!"((p65==0)||(p1920==1))" & FG(!"((p32!=0)&&(p328!=1))" & !"((p2204==0)||(p1710==1))"))
Detected timeout of ITS tools.
[2024-05-21 11:24:31] [INFO ] Flatten gal took : 13 ms
[2024-05-21 11:24:31] [INFO ] Applying decomposition
[2024-05-21 11:24:31] [INFO ] Flatten gal took : 12 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/graph1510069151691935852.txt' '-o' '/tmp/graph1510069151691935852.bin' '-w' '/tmp/graph1510069151691935852.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1510069151691935852.bin' '-l' '-1' '-v' '-w' '/tmp/graph1510069151691935852.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:24:31] [INFO ] Decomposing Gal with order
[2024-05-21 11:24:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:24:31] [INFO ] Removed a total of 52 redundant transitions.
[2024-05-21 11:24:31] [INFO ] Flatten gal took : 29 ms
[2024-05-21 11:24:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 29 ms.
[2024-05-21 11:24:31] [INFO ] Time to serialize gal into /tmp/LTL2113919328347305197.gal : 7 ms
[2024-05-21 11:24:31] [INFO ] Time to serialize properties into /tmp/LTL8179940576192995644.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/LTL2113919328347305197.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8179940576192995644.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...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i3.u156.p2204==0)||(i2.i0.i6.u117.p1710==1))")||((G("((i1.u1.p65==0)||(i13.u154.p1920==1))"))||("((i6.u0.p32!=0)&&(i13.u18....171
Formula 0 simplified : G(F!"((i1.u1.p65==0)||(i13.u154.p1920==1))" & FG(!"((i3.u156.p2204==0)||(i2.i0.i6.u117.p1710==1))" & !"((i6.u0.p32!=0)&&(i13.u18.p32...164
Reverse transition relation is NOT exact ! Due to transitions t1206_t1213_t1220_t1229_t1236_t1243_t1251_t1258_t1265_t1273_t1280_t1287_t1295_t1302_t1309_t13...1284
Computing Next relation with stutter on 2.01327e+09 deadlock states
11 unique states visited
11 strongly connected components in search stack
12 transitions explored
11 items max in DFS search stack
1133 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,11.4308,304356,1,0,683589,15534,5586,885889,770,82175,691370
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-24b-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-24b-LTLCardinality-04 finished in 87377 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 1 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1731 transition count 1682
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1731 transition count 1682
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1731 transition count 1681
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 1726 transition count 1676
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 1726 transition count 1676
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1725 transition count 1675
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1725 transition count 1675
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1724 transition count 1674
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1724 transition count 1674
Applied a total of 39 rules in 536 ms. Remains 1724 /1743 variables (removed 19) and now considering 1674/1694 (removed 20) transitions.
// Phase 1: matrix 1674 rows 1724 cols
[2024-05-21 11:24:45] [INFO ] Computed 148 invariants in 9 ms
[2024-05-21 11:24:46] [INFO ] Implicit Places using invariants in 888 ms returned []
[2024-05-21 11:24:46] [INFO ] Invariant cache hit.
[2024-05-21 11:24:49] [INFO ] Implicit Places using invariants and state equation in 3097 ms returned []
Implicit Place search using SMT with State Equation took 3999 ms to find 0 implicit places.
[2024-05-21 11:24:49] [INFO ] Invariant cache hit.
[2024-05-21 11:24:51] [INFO ] Dead Transitions using invariants and state equation in 2255 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1724/1743 places, 1674/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6797 ms. Remains : 1724/1743 places, 1674/1694 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s986 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 1975 ms.
Product exploration explored 100000 steps with 50000 reset in 1902 ms.
Computed a total of 414 stabilizing places and 414 stable transitions
Computed a total of 414 stabilizing places and 414 stable transitions
Detected a total of 414/1724 stabilizing places and 414/1674 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 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-24b-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-24b-LTLCardinality-05 finished in 10884 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))||(p1 U (p2||G(p1)))))'
Support contains 3 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1732 transition count 1683
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1732 transition count 1683
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 1727 transition count 1678
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 1727 transition count 1678
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1726 transition count 1677
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1726 transition count 1677
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1725 transition count 1676
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1725 transition count 1676
Applied a total of 36 rules in 521 ms. Remains 1725 /1743 variables (removed 18) and now considering 1676/1694 (removed 18) transitions.
// Phase 1: matrix 1676 rows 1725 cols
[2024-05-21 11:24:56] [INFO ] Computed 148 invariants in 8 ms
[2024-05-21 11:24:57] [INFO ] Implicit Places using invariants in 930 ms returned []
[2024-05-21 11:24:57] [INFO ] Invariant cache hit.
[2024-05-21 11:25:00] [INFO ] Implicit Places using invariants and state equation in 3225 ms returned []
Implicit Place search using SMT with State Equation took 4162 ms to find 0 implicit places.
[2024-05-21 11:25:00] [INFO ] Invariant cache hit.
[2024-05-21 11:25:02] [INFO ] Dead Transitions using invariants and state equation in 2257 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1725/1743 places, 1676/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6944 ms. Remains : 1725/1743 places, 1676/1694 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1102 0) (EQ s1607 1)), p2:(AND (NOT (OR (EQ s1607 0) (EQ s1102 1))) (NEQ s586 1)), p1:(NEQ s586 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 972 reset in 387 ms.
Product exploration explored 100000 steps with 989 reset in 364 ms.
Computed a total of 414 stabilizing places and 414 stable transitions
Computed a total of 414 stabilizing places and 414 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 112 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 9 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 359 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0)]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) 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 5) seen :0
Running SMT prover for 5 properties.
[2024-05-21 11:25:04] [INFO ] Invariant cache hit.
[2024-05-21 11:25:05] [INFO ] [Real]Absence check using 147 positive place invariants in 131 ms returned sat
[2024-05-21 11:25:05] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-21 11:25:06] [INFO ] After 1540ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2024-05-21 11:25:06] [INFO ] [Nat]Absence check using 147 positive place invariants in 136 ms returned sat
[2024-05-21 11:25:06] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-21 11:25:07] [INFO ] After 1090ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :1
[2024-05-21 11:25:08] [INFO ] Deduced a trap composed of 27 places in 995 ms of which 3 ms to minimize.
[2024-05-21 11:25:10] [INFO ] Deduced a trap composed of 104 places in 1054 ms of which 6 ms to minimize.
[2024-05-21 11:25:11] [INFO ] Deduced a trap composed of 133 places in 1024 ms of which 1 ms to minimize.
[2024-05-21 11:25:12] [INFO ] Deduced a trap composed of 245 places in 902 ms of which 2 ms to minimize.
[2024-05-21 11:25:13] [INFO ] Deduced a trap composed of 206 places in 915 ms of which 2 ms to minimize.
[2024-05-21 11:25:14] [INFO ] Deduced a trap composed of 214 places in 812 ms of which 1 ms to minimize.
[2024-05-21 11:25:15] [INFO ] Deduced a trap composed of 252 places in 860 ms of which 3 ms to minimize.
[2024-05-21 11:25:16] [INFO ] Deduced a trap composed of 281 places in 995 ms of which 2 ms to minimize.
[2024-05-21 11:25:17] [INFO ] Deduced a trap composed of 281 places in 870 ms of which 2 ms to minimize.
[2024-05-21 11:25:18] [INFO ] Deduced a trap composed of 281 places in 867 ms of which 1 ms to minimize.
[2024-05-21 11:25:19] [INFO ] Deduced a trap composed of 255 places in 924 ms of which 3 ms to minimize.
[2024-05-21 11:25:20] [INFO ] Deduced a trap composed of 292 places in 943 ms of which 2 ms to minimize.
[2024-05-21 11:25:21] [INFO ] Deduced a trap composed of 281 places in 855 ms of which 1 ms to minimize.
[2024-05-21 11:25:22] [INFO ] Deduced a trap composed of 246 places in 970 ms of which 2 ms to minimize.
[2024-05-21 11:25:23] [INFO ] Deduced a trap composed of 249 places in 871 ms of which 2 ms to minimize.
[2024-05-21 11:25:23] [INFO ] Deduced a trap composed of 250 places in 790 ms of which 1 ms to minimize.
[2024-05-21 11:25:24] [INFO ] Deduced a trap composed of 281 places in 854 ms of which 2 ms to minimize.
[2024-05-21 11:25:25] [INFO ] Deduced a trap composed of 214 places in 941 ms of which 2 ms to minimize.
[2024-05-21 11:25:26] [INFO ] Deduced a trap composed of 255 places in 806 ms of which 3 ms to minimize.
[2024-05-21 11:25:27] [INFO ] Deduced a trap composed of 286 places in 845 ms of which 2 ms to minimize.
[2024-05-21 11:25:27] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 20020 ms
[2024-05-21 11:25:28] [INFO ] After 21215ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 154 ms.
[2024-05-21 11:25:28] [INFO ] After 21849ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 201 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=100 )
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 1725 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1725/1725 places, 1676/1676 transitions.
Drop transitions removed 623 transitions
Trivial Post-agglo rules discarded 623 transitions
Performed 623 trivial Post agglomeration. Transition count delta: 623
Iterating post reduction 0 with 623 rules applied. Total rules applied 623 place count 1725 transition count 1053
Reduce places removed 623 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 695 rules applied. Total rules applied 1318 place count 1102 transition count 981
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1367 place count 1054 transition count 980
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1368 place count 1053 transition count 980
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 200 Pre rules applied. Total rules applied 1368 place count 1053 transition count 780
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 4 with 400 rules applied. Total rules applied 1768 place count 853 transition count 780
Performed 339 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 4 with 678 rules applied. Total rules applied 2446 place count 514 transition count 393
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2447 place count 514 transition count 392
Free-agglomeration rule applied 95 times.
Iterating global reduction 4 with 95 rules applied. Total rules applied 2542 place count 514 transition count 297
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 4 with 95 rules applied. Total rules applied 2637 place count 419 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2638 place count 418 transition count 296
Reduce places removed 119 places and 0 transitions.
Drop transitions removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 5 with 327 rules applied. Total rules applied 2965 place count 299 transition count 88
Reduce places removed 208 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 209 rules applied. Total rules applied 3174 place count 91 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3175 place count 90 transition count 87
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 27 Pre rules applied. Total rules applied 3175 place count 90 transition count 60
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 8 with 54 rules applied. Total rules applied 3229 place count 63 transition count 60
Applied a total of 3229 rules in 161 ms. Remains 63 /1725 variables (removed 1662) and now considering 60/1676 (removed 1616) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 63/1725 places, 60/1676 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT p0))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F p0), (F (AND p0 p1 p2))]
Knowledge based reduction with 10 factoid took 446 ms. Reduced automaton from 9 states, 29 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 352 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false]
Stuttering acceptance computed with spot in 356 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false]
Support contains 3 out of 1725 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1725/1725 places, 1676/1676 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 622 transitions
Trivial Post-agglo rules discarded 622 transitions
Performed 622 trivial Post agglomeration. Transition count delta: 622
Iterating post reduction 0 with 622 rules applied. Total rules applied 622 place count 1724 transition count 1053
Reduce places removed 622 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 694 rules applied. Total rules applied 1316 place count 1102 transition count 981
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1365 place count 1054 transition count 980
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1366 place count 1053 transition count 980
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 200 Pre rules applied. Total rules applied 1366 place count 1053 transition count 780
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 4 with 400 rules applied. Total rules applied 1766 place count 853 transition count 780
Performed 339 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 4 with 678 rules applied. Total rules applied 2444 place count 514 transition count 393
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2445 place count 513 transition count 392
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 4 with 72 rules applied. Total rules applied 2517 place count 465 transition count 368
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2541 place count 441 transition count 368
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2541 place count 441 transition count 344
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2589 place count 417 transition count 344
Applied a total of 2589 rules in 151 ms. Remains 417 /1725 variables (removed 1308) and now considering 344/1676 (removed 1332) transitions.
// Phase 1: matrix 344 rows 417 cols
[2024-05-21 11:25:29] [INFO ] Computed 100 invariants in 2 ms
[2024-05-21 11:25:30] [INFO ] Implicit Places using invariants in 385 ms returned [169, 243, 317, 321, 325, 329, 333, 337, 341, 345, 349, 353, 357, 361, 365, 369, 373, 377, 387, 391, 395, 399, 403, 407, 411, 416]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 387 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 391/1725 places, 344/1676 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 367 transition count 320
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 367 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 366 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 366 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 365 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 365 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 364 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 364 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 363 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 363 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 362 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 362 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 361 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 361 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 360 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 360 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 359 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 359 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 358 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 358 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 357 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 357 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 356 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 356 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 355 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 355 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 354 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 354 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 353 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 353 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 352 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 352 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 351 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 351 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 350 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 350 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 349 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 349 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 348 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 348 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 347 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 347 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 346 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 346 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 345 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 345 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 344 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 344 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 343 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 343 transition count 296
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 100 place count 341 transition count 294
Applied a total of 100 rules in 135 ms. Remains 341 /391 variables (removed 50) and now considering 294/344 (removed 50) transitions.
// Phase 1: matrix 294 rows 341 cols
[2024-05-21 11:25:30] [INFO ] Computed 74 invariants in 1 ms
[2024-05-21 11:25:30] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-21 11:25:30] [INFO ] Invariant cache hit.
[2024-05-21 11:25:31] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 341/1725 places, 294/1676 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1608 ms. Remains : 341/1725 places, 294/1676 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 762 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 349 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false, false]
Incomplete random walk after 10000 steps, including 120 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 11:25:32] [INFO ] Invariant cache hit.
[2024-05-21 11:25:32] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2024-05-21 11:25:32] [INFO ] [Nat]Absence check using 74 positive place invariants in 21 ms returned sat
[2024-05-21 11:25:32] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 p2)), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 11 factoid took 1193 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 367 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), false, false, false, false]
Stuttering acceptance computed with spot in 352 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), false, false, false, false]
Stuttering acceptance computed with spot in 348 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), false, false, false, false]
Product exploration explored 100000 steps with 2277 reset in 655 ms.
Product exploration explored 100000 steps with 2292 reset in 723 ms.
Built C files in :
/tmp/ltsmin17142249695722897572
[2024-05-21 11:25:36] [INFO ] Computing symmetric may disable matrix : 294 transitions.
[2024-05-21 11:25:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:25:36] [INFO ] Computing symmetric may enable matrix : 294 transitions.
[2024-05-21 11:25:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:25:36] [INFO ] Computing Do-Not-Accords matrix : 294 transitions.
[2024-05-21 11:25:36] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:25:36] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17142249695722897572
Running compilation step : cd /tmp/ltsmin17142249695722897572;'/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 895 ms.
Running link step : cd /tmp/ltsmin17142249695722897572;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17142249695722897572;'/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/stateBased8382769125351420705.hoa' '--buchi-type=spotba'
LTSmin run took 1628 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-24b-LTLCardinality-06 finished in 43112 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 1 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1732 transition count 1683
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1732 transition count 1683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1732 transition count 1682
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 1728 transition count 1678
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 1728 transition count 1678
Applied a total of 31 rules in 316 ms. Remains 1728 /1743 variables (removed 15) and now considering 1678/1694 (removed 16) transitions.
// Phase 1: matrix 1678 rows 1728 cols
[2024-05-21 11:25:39] [INFO ] Computed 148 invariants in 8 ms
[2024-05-21 11:25:40] [INFO ] Implicit Places using invariants in 880 ms returned []
[2024-05-21 11:25:40] [INFO ] Invariant cache hit.
[2024-05-21 11:25:43] [INFO ] Implicit Places using invariants and state equation in 3256 ms returned []
Implicit Place search using SMT with State Equation took 4143 ms to find 0 implicit places.
[2024-05-21 11:25:43] [INFO ] Invariant cache hit.
[2024-05-21 11:25:45] [INFO ] Dead Transitions using invariants and state equation in 2213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1728/1743 places, 1678/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6674 ms. Remains : 1728/1743 places, 1678/1694 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s413 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]]
Stuttering criterion allowed to conclude after 1062 steps with 0 reset in 4 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-08 finished in 6774 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)))'
Support contains 2 out of 1743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 625 transitions
Trivial Post-agglo rules discarded 625 transitions
Performed 625 trivial Post agglomeration. Transition count delta: 625
Iterating post reduction 0 with 625 rules applied. Total rules applied 625 place count 1742 transition count 1068
Reduce places removed 625 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 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 1 with 694 rules applied. Total rules applied 1319 place count 1117 transition count 999
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 46 rules applied. Total rules applied 1365 place count 1072 transition count 998
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1366 place count 1071 transition count 998
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 200 Pre rules applied. Total rules applied 1366 place count 1071 transition count 798
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 4 with 400 rules applied. Total rules applied 1766 place count 871 transition count 798
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1776 place count 861 transition count 788
Iterating global reduction 4 with 10 rules applied. Total rules applied 1786 place count 861 transition count 788
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 1786 place count 861 transition count 783
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1796 place count 856 transition count 783
Performed 340 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 4 with 680 rules applied. Total rules applied 2476 place count 516 transition count 395
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2478 place count 515 transition count 395
Applied a total of 2478 rules in 176 ms. Remains 515 /1743 variables (removed 1228) and now considering 395/1694 (removed 1299) transitions.
// Phase 1: matrix 395 rows 515 cols
[2024-05-21 11:25:45] [INFO ] Computed 148 invariants in 2 ms
[2024-05-21 11:25:46] [INFO ] Implicit Places using invariants in 890 ms returned [169, 170, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 218, 219, 220, 221, 295, 369, 375, 381, 387, 393, 399, 405, 411, 417, 423, 429, 435, 441, 447, 453, 459, 465, 471, 477, 483, 489, 495, 501, 507, 514]
Discarding 73 places :
Implicit Place search using SMT only with invariants took 893 ms to find 73 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 442/1743 places, 395/1694 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 442 transition count 349
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 396 transition count 349
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 117 place count 371 transition count 324
Iterating global reduction 2 with 25 rules applied. Total rules applied 142 place count 371 transition count 324
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 370 transition count 323
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 370 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 145 place count 369 transition count 322
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 369 transition count 322
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 147 place count 368 transition count 321
Iterating global reduction 2 with 1 rules applied. Total rules applied 148 place count 368 transition count 321
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 367 transition count 320
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 367 transition count 320
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 366 transition count 319
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 366 transition count 319
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 365 transition count 318
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 365 transition count 318
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 364 transition count 317
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 364 transition count 317
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 363 transition count 316
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 363 transition count 316
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 362 transition count 315
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 362 transition count 315
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 361 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 361 transition count 314
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 360 transition count 313
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 360 transition count 313
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 359 transition count 312
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 359 transition count 312
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 358 transition count 311
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 358 transition count 311
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 357 transition count 310
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 357 transition count 310
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 356 transition count 309
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 356 transition count 309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 355 transition count 308
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 355 transition count 308
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 354 transition count 307
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 354 transition count 307
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 353 transition count 306
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 353 transition count 306
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 352 transition count 305
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 352 transition count 305
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 351 transition count 304
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 351 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 350 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 350 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 349 transition count 302
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 349 transition count 302
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 348 transition count 301
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 348 transition count 301
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 189 place count 347 transition count 300
Iterating global reduction 2 with 1 rules applied. Total rules applied 190 place count 347 transition count 300
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 192 place count 346 transition count 299
Applied a total of 192 rules in 134 ms. Remains 346 /442 variables (removed 96) and now considering 299/395 (removed 96) transitions.
// Phase 1: matrix 299 rows 346 cols
[2024-05-21 11:25:46] [INFO ] Computed 75 invariants in 2 ms
[2024-05-21 11:25:47] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-21 11:25:47] [INFO ] Invariant cache hit.
[2024-05-21 11:25:47] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 11:25:48] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 1097 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 346/1743 places, 299/1694 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2301 ms. Remains : 346/1743 places, 299/1694 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s170 0) (EQ s174 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1196 reset in 529 ms.
Product exploration explored 100000 steps with 1192 reset in 581 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 232 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=116 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 346 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 346/346 places, 299/299 transitions.
Applied a total of 0 rules in 9 ms. Remains 346 /346 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2024-05-21 11:25:49] [INFO ] Invariant cache hit.
[2024-05-21 11:25:49] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-21 11:25:49] [INFO ] Invariant cache hit.
[2024-05-21 11:25:50] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 11:25:50] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1099 ms to find 0 implicit places.
[2024-05-21 11:25:50] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 11:25:50] [INFO ] Invariant cache hit.
[2024-05-21 11:25:51] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1411 ms. Remains : 346/346 places, 299/299 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1197 reset in 522 ms.
Product exploration explored 100000 steps with 1197 reset in 587 ms.
Built C files in :
/tmp/ltsmin15686725286009606589
[2024-05-21 11:25:52] [INFO ] Computing symmetric may disable matrix : 299 transitions.
[2024-05-21 11:25:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:25:52] [INFO ] Computing symmetric may enable matrix : 299 transitions.
[2024-05-21 11:25:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:25:52] [INFO ] Computing Do-Not-Accords matrix : 299 transitions.
[2024-05-21 11:25:52] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:25:52] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15686725286009606589
Running compilation step : cd /tmp/ltsmin15686725286009606589;'/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 920 ms.
Running link step : cd /tmp/ltsmin15686725286009606589;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15686725286009606589;'/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/stateBased15484015978505821434.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 346 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 346/346 places, 299/299 transitions.
Applied a total of 0 rules in 7 ms. Remains 346 /346 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2024-05-21 11:26:07] [INFO ] Invariant cache hit.
[2024-05-21 11:26:07] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-21 11:26:07] [INFO ] Invariant cache hit.
[2024-05-21 11:26:08] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 11:26:08] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 1062 ms to find 0 implicit places.
[2024-05-21 11:26:08] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 11:26:08] [INFO ] Invariant cache hit.
[2024-05-21 11:26:09] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1340 ms. Remains : 346/346 places, 299/299 transitions.
Built C files in :
/tmp/ltsmin12345233860080827376
[2024-05-21 11:26:09] [INFO ] Computing symmetric may disable matrix : 299 transitions.
[2024-05-21 11:26:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:26:09] [INFO ] Computing symmetric may enable matrix : 299 transitions.
[2024-05-21 11:26:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:26:09] [INFO ] Computing Do-Not-Accords matrix : 299 transitions.
[2024-05-21 11:26:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:26:09] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12345233860080827376
Running compilation step : cd /tmp/ltsmin12345233860080827376;'/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 817 ms.
Running link step : cd /tmp/ltsmin12345233860080827376;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12345233860080827376;'/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/stateBased15831772164489437736.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 11:26:24] [INFO ] Flatten gal took : 11 ms
[2024-05-21 11:26:24] [INFO ] Flatten gal took : 10 ms
[2024-05-21 11:26:24] [INFO ] Time to serialize gal into /tmp/LTL1349063190948852084.gal : 2 ms
[2024-05-21 11:26:24] [INFO ] Time to serialize properties into /tmp/LTL12404810670570720009.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/LTL1349063190948852084.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17857304969684506071.hoa' '-atoms' '/tmp/LTL12404810670570720009.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...319
Loading property file /tmp/LTL12404810670570720009.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17857304969684506071.hoa
Detected timeout of ITS tools.
[2024-05-21 11:26:39] [INFO ] Flatten gal took : 10 ms
[2024-05-21 11:26:39] [INFO ] Flatten gal took : 9 ms
[2024-05-21 11:26:39] [INFO ] Time to serialize gal into /tmp/LTL8904201249234266311.gal : 3 ms
[2024-05-21 11:26:39] [INFO ] Time to serialize properties into /tmp/LTL1489138597128808851.ltl : 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/LTL8904201249234266311.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1489138597128808851.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...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((p1083==0)||(p1443==1))"))))
Formula 0 simplified : GF!"((p1083==0)||(p1443==1))"
Detected timeout of ITS tools.
[2024-05-21 11:26:54] [INFO ] Flatten gal took : 9 ms
[2024-05-21 11:26:54] [INFO ] Applying decomposition
[2024-05-21 11:26:54] [INFO ] Flatten gal took : 10 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/graph4637121797726503160.txt' '-o' '/tmp/graph4637121797726503160.bin' '-w' '/tmp/graph4637121797726503160.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4637121797726503160.bin' '-l' '-1' '-v' '-w' '/tmp/graph4637121797726503160.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:26:54] [INFO ] Decomposing Gal with order
[2024-05-21 11:26:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:26:54] [INFO ] Removed a total of 78 redundant transitions.
[2024-05-21 11:26:54] [INFO ] Flatten gal took : 37 ms
[2024-05-21 11:26:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 11 ms.
[2024-05-21 11:26:54] [INFO ] Time to serialize gal into /tmp/LTL2136490057055681578.gal : 6 ms
[2024-05-21 11:26:54] [INFO ] Time to serialize properties into /tmp/LTL13784596384080662296.ltl : 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/LTL2136490057055681578.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13784596384080662296.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 : !((F(G("((i14.u73.p1083==0)||(i16.u74.p1443==1))"))))
Formula 0 simplified : GF!"((i14.u73.p1083==0)||(i16.u74.p1443==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.61061e+09 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10772076616481693446
[2024-05-21 11:27:09] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10772076616481693446
Running compilation step : cd /tmp/ltsmin10772076616481693446;'/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 660 ms.
Running link step : cd /tmp/ltsmin10772076616481693446;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10772076616481693446;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutoFlight-PT-24b-LTLCardinality-10 finished in 98835 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)))'
Support contains 1 out of 1743 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 1742 transition count 1065
Reduce places removed 628 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 701 rules applied. Total rules applied 1329 place count 1114 transition count 992
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1377 place count 1066 transition count 992
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 1377 place count 1066 transition count 793
Deduced a syphon composed of 199 places in 4 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 1775 place count 867 transition count 793
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1784 place count 858 transition count 784
Iterating global reduction 3 with 9 rules applied. Total rules applied 1793 place count 858 transition count 784
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1793 place count 858 transition count 780
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1801 place count 854 transition count 780
Performed 341 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 341 places in 0 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 3 with 682 rules applied. Total rules applied 2483 place count 513 transition count 391
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2484 place count 512 transition count 390
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 3 with 72 rules applied. Total rules applied 2556 place count 464 transition count 366
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 2580 place count 440 transition count 366
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2580 place count 440 transition count 342
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2628 place count 416 transition count 342
Applied a total of 2628 rules in 168 ms. Remains 416 /1743 variables (removed 1327) and now considering 342/1694 (removed 1352) transitions.
// Phase 1: matrix 342 rows 416 cols
[2024-05-21 11:27:24] [INFO ] Computed 100 invariants in 1 ms
[2024-05-21 11:27:25] [INFO ] Implicit Places using invariants in 414 ms returned [170, 244, 318, 322, 326, 330, 334, 338, 342, 346, 350, 354, 358, 362, 366, 370, 374, 378, 382, 386, 390, 394, 398, 402, 406, 410, 415]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 416 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 389/1743 places, 342/1694 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 364 transition count 317
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 364 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 363 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 363 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 362 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 362 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 361 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 361 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 360 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 360 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 359 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 359 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 358 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 358 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 357 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 357 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 356 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 356 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 355 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 355 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 354 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 354 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 353 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 353 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 352 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 352 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 351 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 351 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 350 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 350 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 349 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 349 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 348 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 348 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 347 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 347 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 346 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 346 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 345 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 345 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 344 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 344 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 343 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 343 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 342 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 342 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 341 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 341 transition count 294
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 340 transition count 293
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 340 transition count 293
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 100 place count 339 transition count 292
Applied a total of 100 rules in 127 ms. Remains 339 /389 variables (removed 50) and now considering 292/342 (removed 50) transitions.
// Phase 1: matrix 292 rows 339 cols
[2024-05-21 11:27:25] [INFO ] Computed 73 invariants in 1 ms
[2024-05-21 11:27:25] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-21 11:27:25] [INFO ] Invariant cache hit.
[2024-05-21 11:27:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 11:27:26] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 900 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 339/1743 places, 292/1694 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1611 ms. Remains : 339/1743 places, 292/1694 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s138 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1236 reset in 460 ms.
Product exploration explored 100000 steps with 1228 reset in 514 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/339 stabilizing places and 2/292 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 54 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=27 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 291 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 1 out of 339 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 339/339 places, 292/292 transitions.
Applied a total of 0 rules in 6 ms. Remains 339 /339 variables (removed 0) and now considering 292/292 (removed 0) transitions.
[2024-05-21 11:27:27] [INFO ] Invariant cache hit.
[2024-05-21 11:27:28] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-21 11:27:28] [INFO ] Invariant cache hit.
[2024-05-21 11:27:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 11:27:28] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
[2024-05-21 11:27:28] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 11:27:28] [INFO ] Invariant cache hit.
[2024-05-21 11:27:29] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1144 ms. Remains : 339/339 places, 292/292 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/339 stabilizing places and 2/292 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 170 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 195 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1229 reset in 488 ms.
Product exploration explored 100000 steps with 1228 reset in 565 ms.
Built C files in :
/tmp/ltsmin4615719756566627247
[2024-05-21 11:27:30] [INFO ] Computing symmetric may disable matrix : 292 transitions.
[2024-05-21 11:27:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:27:30] [INFO ] Computing symmetric may enable matrix : 292 transitions.
[2024-05-21 11:27:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:27:30] [INFO ] Computing Do-Not-Accords matrix : 292 transitions.
[2024-05-21 11:27:30] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:27:30] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4615719756566627247
Running compilation step : cd /tmp/ltsmin4615719756566627247;'/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 867 ms.
Running link step : cd /tmp/ltsmin4615719756566627247;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4615719756566627247;'/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/stateBased17950031179734983130.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 339 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 339/339 places, 292/292 transitions.
Applied a total of 0 rules in 10 ms. Remains 339 /339 variables (removed 0) and now considering 292/292 (removed 0) transitions.
[2024-05-21 11:27:45] [INFO ] Invariant cache hit.
[2024-05-21 11:27:46] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-21 11:27:46] [INFO ] Invariant cache hit.
[2024-05-21 11:27:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 11:27:46] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
[2024-05-21 11:27:46] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 11:27:46] [INFO ] Invariant cache hit.
[2024-05-21 11:27:46] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1145 ms. Remains : 339/339 places, 292/292 transitions.
Built C files in :
/tmp/ltsmin9567130449013820282
[2024-05-21 11:27:46] [INFO ] Computing symmetric may disable matrix : 292 transitions.
[2024-05-21 11:27:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:27:46] [INFO ] Computing symmetric may enable matrix : 292 transitions.
[2024-05-21 11:27:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:27:46] [INFO ] Computing Do-Not-Accords matrix : 292 transitions.
[2024-05-21 11:27:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 11:27:46] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9567130449013820282
Running compilation step : cd /tmp/ltsmin9567130449013820282;'/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 805 ms.
Running link step : cd /tmp/ltsmin9567130449013820282;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9567130449013820282;'/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/stateBased2242014030097057270.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 11:28:02] [INFO ] Flatten gal took : 7 ms
[2024-05-21 11:28:02] [INFO ] Flatten gal took : 7 ms
[2024-05-21 11:28:02] [INFO ] Time to serialize gal into /tmp/LTL5075689410923647656.gal : 2 ms
[2024-05-21 11:28:02] [INFO ] Time to serialize properties into /tmp/LTL17396946069443178325.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/LTL5075689410923647656.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6598219490440571329.hoa' '-atoms' '/tmp/LTL17396946069443178325.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/LTL17396946069443178325.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6598219490440571329.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t26, t311.t369, Intersection with reachable at each step enabled. (destroyed/reverse/int...181
Computing Next relation with stutter on 1.61061e+09 deadlock states
Detected timeout of ITS tools.
[2024-05-21 11:28:17] [INFO ] Flatten gal took : 8 ms
[2024-05-21 11:28:17] [INFO ] Flatten gal took : 7 ms
[2024-05-21 11:28:17] [INFO ] Time to serialize gal into /tmp/LTL10558213407443738793.gal : 3 ms
[2024-05-21 11:28:17] [INFO ] Time to serialize properties into /tmp/LTL18299565331546600489.ltl : 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/LTL10558213407443738793.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18299565331546600489.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...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(p884!=1)"))))
Formula 0 simplified : GF!"(p884!=1)"
Reverse transition relation is NOT exact ! Due to transitions t1, t26, t311.t369, Intersection with reachable at each step enabled. (destroyed/reverse/int...181
Computing Next relation with stutter on 1.61061e+09 deadlock states
Detected timeout of ITS tools.
[2024-05-21 11:28:32] [INFO ] Flatten gal took : 7 ms
[2024-05-21 11:28:32] [INFO ] Applying decomposition
[2024-05-21 11:28:32] [INFO ] Flatten gal took : 7 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/graph17611002486689900826.txt' '-o' '/tmp/graph17611002486689900826.bin' '-w' '/tmp/graph17611002486689900826.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17611002486689900826.bin' '-l' '-1' '-v' '-w' '/tmp/graph17611002486689900826.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:28:32] [INFO ] Decomposing Gal with order
[2024-05-21 11:28:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:28:32] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-21 11:28:32] [INFO ] Flatten gal took : 17 ms
[2024-05-21 11:28:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 11:28:32] [INFO ] Time to serialize gal into /tmp/LTL2947756128621567449.gal : 5 ms
[2024-05-21 11:28:32] [INFO ] Time to serialize properties into /tmp/LTL2738343147915108754.ltl : 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/LTL2947756128621567449.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2738343147915108754.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...254
Read 1 LTL properties
Checking formula 0 : !((F(G("(i7.u59.p884!=1)"))))
Formula 0 simplified : GF!"(i7.u59.p884!=1)"
Reverse transition relation is NOT exact ! Due to transitions t311_t369, i0.t26, i7.t1, Intersection with reachable at each step enabled. (destroyed/rever...187
Computing Next relation with stutter on 1.61061e+09 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
109 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.1409,52772,1,0,63099,27499,3614,147868,1209,96626,66668
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-24b-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-24b-LTLCardinality-13 finished in 68981 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(p0)))'
Support contains 2 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1733 transition count 1684
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1733 transition count 1684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1733 transition count 1683
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 1728 transition count 1678
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 1728 transition count 1678
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1727 transition count 1677
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1727 transition count 1677
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1726 transition count 1676
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1726 transition count 1676
Applied a total of 35 rules in 513 ms. Remains 1726 /1743 variables (removed 17) and now considering 1676/1694 (removed 18) transitions.
// Phase 1: matrix 1676 rows 1726 cols
[2024-05-21 11:28:34] [INFO ] Computed 148 invariants in 11 ms
[2024-05-21 11:28:34] [INFO ] Implicit Places using invariants in 868 ms returned []
[2024-05-21 11:28:34] [INFO ] Invariant cache hit.
[2024-05-21 11:28:38] [INFO ] Implicit Places using invariants and state equation in 3044 ms returned []
Implicit Place search using SMT with State Equation took 3912 ms to find 0 implicit places.
[2024-05-21 11:28:38] [INFO ] Invariant cache hit.
[2024-05-21 11:28:40] [INFO ] Dead Transitions using invariants and state equation in 2294 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1726/1743 places, 1676/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6720 ms. Remains : 1726/1743 places, 1676/1694 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s501 0) (EQ s280 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 61410 steps with 57 reset in 231 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-LTLCardinality-15 finished in 7060 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((X(p1)||p0))))'
Found a Lengthening insensitive property : AutoFlight-PT-24b-LTLCardinality-01
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1743 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1743/1743 places, 1694/1694 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 626 transitions
Trivial Post-agglo rules discarded 626 transitions
Performed 626 trivial Post agglomeration. Transition count delta: 626
Iterating post reduction 0 with 626 rules applied. Total rules applied 626 place count 1742 transition count 1067
Reduce places removed 626 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 699 rules applied. Total rules applied 1325 place count 1116 transition count 994
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1374 place count 1068 transition count 993
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1375 place count 1067 transition count 993
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 199 Pre rules applied. Total rules applied 1375 place count 1067 transition count 794
Deduced a syphon composed of 199 places in 4 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 398 rules applied. Total rules applied 1773 place count 868 transition count 794
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1782 place count 859 transition count 785
Iterating global reduction 4 with 9 rules applied. Total rules applied 1791 place count 859 transition count 785
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 1791 place count 859 transition count 780
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1801 place count 854 transition count 780
Performed 338 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 338 places in 1 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 4 with 676 rules applied. Total rules applied 2477 place count 516 transition count 394
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2478 place count 515 transition count 393
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 4 with 72 rules applied. Total rules applied 2550 place count 467 transition count 369
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2574 place count 443 transition count 369
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2574 place count 443 transition count 345
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2622 place count 419 transition count 345
Applied a total of 2622 rules in 174 ms. Remains 419 /1743 variables (removed 1324) and now considering 345/1694 (removed 1349) transitions.
// Phase 1: matrix 345 rows 419 cols
[2024-05-21 11:28:41] [INFO ] Computed 100 invariants in 1 ms
[2024-05-21 11:28:41] [INFO ] Implicit Places using invariants in 383 ms returned [173, 247, 321, 325, 329, 333, 337, 341, 345, 349, 353, 357, 361, 365, 369, 373, 377, 381, 385, 389, 393, 397, 401, 405, 409, 413, 418]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 389 ms to find 27 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 392/1743 places, 345/1694 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 367 transition count 320
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 367 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 366 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 366 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 365 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 365 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 364 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 364 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 363 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 363 transition count 316
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 60 place count 362 transition count 315
Applied a total of 60 rules in 34 ms. Remains 362 /392 variables (removed 30) and now considering 315/345 (removed 30) transitions.
// Phase 1: matrix 315 rows 362 cols
[2024-05-21 11:28:41] [INFO ] Computed 73 invariants in 2 ms
[2024-05-21 11:28:41] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-21 11:28:41] [INFO ] Invariant cache hit.
[2024-05-21 11:28:42] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 11:28:42] [INFO ] Implicit Places using invariants and state equation in 1111 ms returned []
Implicit Place search using SMT with State Equation took 1474 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 362/1743 places, 315/1694 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2071 ms. Remains : 362/1743 places, 315/1694 transitions.
Running random walk in product with property : AutoFlight-PT-24b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s35 0) (EQ s1 1)), p1:(OR (EQ s38 0) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1204 reset in 381 ms.
Product exploration explored 100000 steps with 1209 reset in 428 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 130 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 120 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 11:28:44] [INFO ] Invariant cache hit.
[2024-05-21 11:28:44] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 11:28:44] [INFO ] [Nat]Absence check using 73 positive place invariants in 21 ms returned sat
[2024-05-21 11:28:44] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 11:28:44] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 11:28:44] [INFO ] After 59ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 11:28:44] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-05-21 11:28:44] [INFO ] After 500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 315/315 transitions.
Free-agglomeration rule applied 121 times.
Iterating global reduction 0 with 121 rules applied. Total rules applied 121 place count 362 transition count 194
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t260.t373 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 116 edges and 196 vertex of which 14 / 196 are part of one of the 1 SCC in 4 ms
Free SCC test removed 13 places
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 86 rules applied. Total rules applied 207 place count 183 transition count 109
Reduce places removed 83 places and 0 transitions.
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 109 rules applied. Total rules applied 316 place count 100 transition count 83
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 316 place count 100 transition count 79
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 324 place count 96 transition count 79
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 327 place count 96 transition count 76
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 331 place count 93 transition count 75
Applied a total of 331 rules in 24 ms. Remains 93 /362 variables (removed 269) and now considering 75/315 (removed 240) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 93/362 places, 75/315 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Finished Best-First random walk after 194 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=194 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 294 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 315/315 transitions.
Applied a total of 0 rules in 3 ms. Remains 362 /362 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2024-05-21 11:28:45] [INFO ] Invariant cache hit.
[2024-05-21 11:28:45] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-21 11:28:45] [INFO ] Invariant cache hit.
[2024-05-21 11:28:45] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 11:28:46] [INFO ] Implicit Places using invariants and state equation in 1128 ms returned []
Implicit Place search using SMT with State Equation took 1470 ms to find 0 implicit places.
[2024-05-21 11:28:46] [INFO ] Invariant cache hit.
[2024-05-21 11:28:47] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1792 ms. Remains : 362/362 places, 315/315 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 126 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 116 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 11:28:47] [INFO ] Invariant cache hit.
[2024-05-21 11:28:47] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 11:28:47] [INFO ] [Nat]Absence check using 73 positive place invariants in 23 ms returned sat
[2024-05-21 11:28:47] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 11:28:47] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 11:28:47] [INFO ] After 58ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 11:28:48] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-21 11:28:48] [INFO ] After 513ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 315/315 transitions.
Free-agglomeration rule applied 121 times.
Iterating global reduction 0 with 121 rules applied. Total rules applied 121 place count 362 transition count 194
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t260.t373 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 116 edges and 196 vertex of which 14 / 196 are part of one of the 1 SCC in 0 ms
Free SCC test removed 13 places
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 86 rules applied. Total rules applied 207 place count 183 transition count 109
Reduce places removed 83 places and 0 transitions.
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 109 rules applied. Total rules applied 316 place count 100 transition count 83
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 316 place count 100 transition count 79
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 324 place count 96 transition count 79
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 327 place count 96 transition count 76
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 331 place count 93 transition count 75
Applied a total of 331 rules in 17 ms. Remains 93 /362 variables (removed 269) and now considering 75/315 (removed 240) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 93/362 places, 75/315 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
Finished Best-First random walk after 245 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=245 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 293 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1195 reset in 374 ms.
Product exploration explored 100000 steps with 1191 reset in 430 ms.
Built C files in :
/tmp/ltsmin6786952732268080393
[2024-05-21 11:28:49] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6786952732268080393
Running compilation step : cd /tmp/ltsmin6786952732268080393;'/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 755 ms.
Running link step : cd /tmp/ltsmin6786952732268080393;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6786952732268080393;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17964396156519601416.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 315/315 transitions.
Applied a total of 0 rules in 4 ms. Remains 362 /362 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2024-05-21 11:29:04] [INFO ] Invariant cache hit.
[2024-05-21 11:29:05] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-21 11:29:05] [INFO ] Invariant cache hit.
[2024-05-21 11:29:05] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 11:29:06] [INFO ] Implicit Places using invariants and state equation in 1081 ms returned []
Implicit Place search using SMT with State Equation took 1402 ms to find 0 implicit places.
[2024-05-21 11:29:06] [INFO ] Invariant cache hit.
[2024-05-21 11:29:06] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1676 ms. Remains : 362/362 places, 315/315 transitions.
Built C files in :
/tmp/ltsmin1388371056030637894
[2024-05-21 11:29:06] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1388371056030637894
Running compilation step : cd /tmp/ltsmin1388371056030637894;'/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 747 ms.
Running link step : cd /tmp/ltsmin1388371056030637894;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1388371056030637894;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3280570609373554619.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 11:29:21] [INFO ] Flatten gal took : 8 ms
[2024-05-21 11:29:21] [INFO ] Flatten gal took : 7 ms
[2024-05-21 11:29:21] [INFO ] Time to serialize gal into /tmp/LTL9611605793817907648.gal : 2 ms
[2024-05-21 11:29:21] [INFO ] Time to serialize properties into /tmp/LTL9620144256613390253.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/LTL9611605793817907648.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17880500193727190176.hoa' '-atoms' '/tmp/LTL9620144256613390253.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/LTL9620144256613390253.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17880500193727190176.hoa
Reverse transition relation is NOT exact ! Due to transitions t225, t251, t252, Intersection with reachable at each step enabled. (destroyed/reverse/inter...179
Detected timeout of ITS tools.
[2024-05-21 11:29:36] [INFO ] Flatten gal took : 7 ms
[2024-05-21 11:29:36] [INFO ] Flatten gal took : 7 ms
[2024-05-21 11:29:36] [INFO ] Time to serialize gal into /tmp/LTL1603566065799301837.gal : 4 ms
[2024-05-21 11:29:36] [INFO ] Time to serialize properties into /tmp/LTL6120455350437532685.ltl : 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/LTL1603566065799301837.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6120455350437532685.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...275
Read 1 LTL properties
Checking formula 0 : !((F(G(("((p293==0)||(p96==1))")||(X("((p307==0)||(p258==1))"))))))
Formula 0 simplified : GF(!"((p293==0)||(p96==1))" & X!"((p307==0)||(p258==1))")
Reverse transition relation is NOT exact ! Due to transitions t225, t251, t252, Intersection with reachable at each step enabled. (destroyed/reverse/inter...179
Detected timeout of ITS tools.
[2024-05-21 11:29:51] [INFO ] Flatten gal took : 8 ms
[2024-05-21 11:29:51] [INFO ] Applying decomposition
[2024-05-21 11:29:51] [INFO ] Flatten gal took : 7 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/graph3463624153214213742.txt' '-o' '/tmp/graph3463624153214213742.bin' '-w' '/tmp/graph3463624153214213742.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3463624153214213742.bin' '-l' '-1' '-v' '-w' '/tmp/graph3463624153214213742.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:29:51] [INFO ] Decomposing Gal with order
[2024-05-21 11:29:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:29:51] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-21 11:29:51] [INFO ] Flatten gal took : 26 ms
[2024-05-21 11:29:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 11:29:51] [INFO ] Time to serialize gal into /tmp/LTL10890664741515293956.gal : 5 ms
[2024-05-21 11:29:51] [INFO ] Time to serialize properties into /tmp/LTL4258679285021692134.ltl : 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/LTL10890664741515293956.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4258679285021692134.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 : !((F(G(("((i1.u14.p293==0)||(i2.u0.p96==1))")||(X("((i10.u15.p307==0)||(i1.u11.p258==1))"))))))
Formula 0 simplified : GF(!"((i1.u14.p293==0)||(i2.u0.p96==1))" & X!"((i10.u15.p307==0)||(i1.u11.p258==1))")
Reverse transition relation is NOT exact ! Due to transitions t251, i2.t252, i10.u15.t225, Intersection with reachable at each step enabled. (destroyed/re...190
Computing Next relation with stutter on 1.94616e+09 deadlock states
3 unique states visited
2 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
93 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.02372,46124,1,0,55864,26205,4504,100751,1260,92113,75906
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property AutoFlight-PT-24b-LTLCardinality-01 finished in 72211 ms.
FORMULA AutoFlight-PT-24b-LTLCardinality-01 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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)))'
[2024-05-21 11:29:52] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin53242471582827331
[2024-05-21 11:29:53] [INFO ] Too many transitions (1694) to apply POR reductions. Disabling POR matrices.
[2024-05-21 11:29:53] [INFO ] Applying decomposition
[2024-05-21 11:29:53] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin53242471582827331
Running compilation step : cd /tmp/ltsmin53242471582827331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
[2024-05-21 11:29:53] [INFO ] Flatten gal took : 33 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/graph10248696335115538060.txt' '-o' '/tmp/graph10248696335115538060.bin' '-w' '/tmp/graph10248696335115538060.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10248696335115538060.bin' '-l' '-1' '-v' '-w' '/tmp/graph10248696335115538060.weights' '-q' '0' '-e' '0.001'
[2024-05-21 11:29:53] [INFO ] Decomposing Gal with order
[2024-05-21 11:29:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:29:53] [INFO ] Removed a total of 324 redundant transitions.
[2024-05-21 11:29:53] [INFO ] Flatten gal took : 130 ms
[2024-05-21 11:29:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-21 11:29:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality18347994402267410981.gal : 24 ms
[2024-05-21 11:29:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality13809083162773522857.ltl : 71 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/LTLCardinality18347994402267410981.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13809083162773522857.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...278
Read 1 LTL properties
Checking formula 0 : !((F(G("((i34.u302.p1083==0)||(i25.u406.p1443==1))"))))
Formula 0 simplified : GF!"((i34.u302.p1083==0)||(i25.u406.p1443==1))"
Compilation finished in 5311 ms.
Running link step : cd /tmp/ltsmin53242471582827331;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin53242471582827331;'/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' '--ltl' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 11:52:54] [INFO ] Applying decomposition
[2024-05-21 11:52:55] [INFO ] Flatten gal took : 354 ms
[2024-05-21 11:52:55] [INFO ] Decomposing Gal with order
[2024-05-21 11:52:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 11:52:57] [INFO ] Removed a total of 50 redundant transitions.
[2024-05-21 11:52:57] [INFO ] Flatten gal took : 187 ms
[2024-05-21 11:53:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 694 labels/synchronizations in 2712 ms.
[2024-05-21 11:53:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality16105147833930200263.gal : 152 ms
[2024-05-21 11:53:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality15083588760160360830.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/LTLCardinality16105147833930200263.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15083588760160360830.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...278
Read 1 LTL properties
Checking formula 0 : !((F(G("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...218
Formula 0 simplified : GF!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....212
Detected timeout of ITS tools.
[2024-05-21 12:16:04] [INFO ] Flatten gal took : 573 ms
[2024-05-21 12:16:06] [INFO ] Input system was already deterministic with 1694 transitions.
[2024-05-21 12:16:06] [INFO ] Transformed 1743 places.
[2024-05-21 12:16:06] [INFO ] Transformed 1694 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 12:16:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality13348250285437713398.gal : 28 ms
[2024-05-21 12:16:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality3849947851442141845.ltl : 12 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/LTLCardinality13348250285437713398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3849947851442141845.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((p1083==0)||(p1443==1))"))))
Formula 0 simplified : GF!"((p1083==0)||(p1443==1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12035308 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15740048 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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-24b"
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-24b, 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-171620180100112"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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