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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.9K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 22:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K 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 70K 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-03b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-03b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716275452616

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-03b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 07:10:55] [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 07:10:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 07:10:55] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-05-21 07:10:55] [INFO ] Transformed 298 places.
[2024-05-21 07:10:55] [INFO ] Transformed 296 transitions.
[2024-05-21 07:10:55] [INFO ] Found NUPN structural information;
[2024-05-21 07:10:55] [INFO ] Parsed PT model containing 298 places and 296 transitions and 692 arcs in 204 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.
Initial state reduction rules removed 1 formulas.
FORMULA AutoFlight-PT-03b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-03b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 296/296 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 263 transition count 261
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 263 transition count 261
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 73 place count 263 transition count 258
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 87 place count 249 transition count 244
Iterating global reduction 1 with 14 rules applied. Total rules applied 101 place count 249 transition count 244
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 247 transition count 242
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 247 transition count 242
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 245 transition count 240
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 245 transition count 240
Applied a total of 109 rules in 118 ms. Remains 245 /298 variables (removed 53) and now considering 240/296 (removed 56) transitions.
// Phase 1: matrix 240 rows 245 cols
[2024-05-21 07:10:55] [INFO ] Computed 22 invariants in 40 ms
[2024-05-21 07:10:56] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-05-21 07:10:56] [INFO ] Invariant cache hit.
[2024-05-21 07:10:56] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 960 ms to find 0 implicit places.
[2024-05-21 07:10:56] [INFO ] Invariant cache hit.
[2024-05-21 07:10:57] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 245/298 places, 240/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1428 ms. Remains : 245/298 places, 240/296 transitions.
Support contains 19 out of 245 places after structural reductions.
[2024-05-21 07:10:57] [INFO ] Flatten gal took : 101 ms
[2024-05-21 07:10:57] [INFO ] Flatten gal took : 35 ms
[2024-05-21 07:10:57] [INFO ] Input system was already deterministic with 240 transitions.
Incomplete random walk after 10000 steps, including 63 resets, run finished after 562 ms. (steps per millisecond=17 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 07:10:58] [INFO ] Invariant cache hit.
[2024-05-21 07:10:58] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2024-05-21 07:10:58] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 07:10:58] [INFO ] After 157ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-21 07:10:58] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 27 ms to minimize.
[2024-05-21 07:10:59] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2024-05-21 07:10:59] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 1 ms to minimize.
[2024-05-21 07:10:59] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-05-21 07:10:59] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-21 07:10:59] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 1 ms to minimize.
[2024-05-21 07:10:59] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2024-05-21 07:10:59] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-05-21 07:10:59] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 0 ms to minimize.
[2024-05-21 07:10:59] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1076 ms
[2024-05-21 07:10:59] [INFO ] After 1257ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 07:10:59] [INFO ] After 1429ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 07:10:59] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2024-05-21 07:10:59] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 07:11:00] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 07:11:00] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2024-05-21 07:11:00] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-05-21 07:11:00] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-21 07:11:00] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 1 ms to minimize.
[2024-05-21 07:11:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 408 ms
[2024-05-21 07:11:00] [INFO ] After 612ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-21 07:11:00] [INFO ] After 765ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 37 ms.
Support contains 3 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 240/240 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 245 transition count 158
Reduce places removed 82 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 94 rules applied. Total rules applied 176 place count 163 transition count 146
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 182 place count 157 transition count 146
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 182 place count 157 transition count 113
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 248 place count 124 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 250 place count 122 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 252 place count 122 transition count 111
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 252 place count 122 transition count 110
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 254 place count 121 transition count 110
Performed 46 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 346 place count 75 transition count 58
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 358 place count 75 transition count 46
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 370 place count 63 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 371 place count 62 transition count 45
Reduce places removed 12 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 26 rules applied. Total rules applied 397 place count 50 transition count 31
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 411 place count 36 transition count 31
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 411 place count 36 transition count 23
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 427 place count 28 transition count 23
Applied a total of 427 rules in 111 ms. Remains 28 /245 variables (removed 217) and now considering 23/240 (removed 217) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 28/245 places, 23/240 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 63 stabilizing places and 63 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(p0)))'
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 240/240 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 244 transition count 159
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 91 rules applied. Total rules applied 171 place count 164 transition count 148
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 177 place count 159 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 178 place count 158 transition count 147
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 178 place count 158 transition count 113
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 246 place count 124 transition count 113
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 249 place count 121 transition count 110
Iterating global reduction 4 with 3 rules applied. Total rules applied 252 place count 121 transition count 110
Performed 46 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 344 place count 75 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 345 place count 74 transition count 57
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 350 place count 70 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 351 place count 69 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 351 place count 69 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 357 place count 66 transition count 53
Applied a total of 357 rules in 79 ms. Remains 66 /245 variables (removed 179) and now considering 53/240 (removed 187) transitions.
// Phase 1: matrix 53 rows 66 cols
[2024-05-21 07:11:01] [INFO ] Computed 18 invariants in 5 ms
[2024-05-21 07:11:01] [INFO ] Implicit Places using invariants in 96 ms returned [28, 39, 50, 55, 59, 65]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 99 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/245 places, 53/240 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 56 transition count 49
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 56 transition count 49
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 55 transition count 48
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 55 transition count 48
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 54 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 54 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 53 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 53 transition count 46
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 16 place count 52 transition count 45
Applied a total of 16 rules in 15 ms. Remains 52 /60 variables (removed 8) and now considering 45/53 (removed 8) transitions.
// Phase 1: matrix 45 rows 52 cols
[2024-05-21 07:11:01] [INFO ] Computed 12 invariants in 10 ms
[2024-05-21 07:11:01] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 07:11:01] [INFO ] Invariant cache hit.
[2024-05-21 07:11:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 07:11:01] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/245 places, 45/240 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 340 ms. Remains : 52/245 places, 45/240 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 237 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-01 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 s8 0) (EQ s27 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 5194 reset in 378 ms.
Product exploration explored 100000 steps with 5195 reset in 265 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 205 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 34 ms :[(NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 210 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 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 52 /52 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-05-21 07:11:02] [INFO ] Invariant cache hit.
[2024-05-21 07:11:02] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 07:11:02] [INFO ] Invariant cache hit.
[2024-05-21 07:11:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 07:11:03] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-05-21 07:11:03] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 07:11:03] [INFO ] Invariant cache hit.
[2024-05-21 07:11:03] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 267 ms. Remains : 52/52 places, 45/45 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Computed a total of 4 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 227 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 50 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 201 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5209 reset in 156 ms.
Stack based approach found an accepted trace after 41405 steps with 2165 reset with depth 13 and stack size 13 in 141 ms.
FORMULA AutoFlight-PT-03b-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-03b-LTLCardinality-01 finished in 3067 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((G(p1)||p0))))'
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 240/240 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 237 transition count 232
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 237 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 237 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 236 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 236 transition count 228
Applied a total of 21 rules in 14 ms. Remains 236 /245 variables (removed 9) and now considering 228/240 (removed 12) transitions.
// Phase 1: matrix 228 rows 236 cols
[2024-05-21 07:11:04] [INFO ] Computed 22 invariants in 9 ms
[2024-05-21 07:11:04] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-21 07:11:04] [INFO ] Invariant cache hit.
[2024-05-21 07:11:04] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2024-05-21 07:11:04] [INFO ] Invariant cache hit.
[2024-05-21 07:11:04] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/245 places, 228/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 642 ms. Remains : 236/245 places, 228/240 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (EQ s141 0) (EQ s41 1)), p0:(OR (EQ s41 0) (EQ s141 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 527 ms.
Product exploration explored 100000 steps with 50000 reset in 369 ms.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-03b-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-03b-LTLCardinality-03 finished in 1804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F((p1&&X((p2 U p3))))))))'
Support contains 5 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 240/240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 239 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 239 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 239 transition count 232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 237 transition count 230
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 237 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 236 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 236 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 235 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 235 transition count 228
Applied a total of 22 rules in 27 ms. Remains 235 /245 variables (removed 10) and now considering 228/240 (removed 12) transitions.
// Phase 1: matrix 228 rows 235 cols
[2024-05-21 07:11:05] [INFO ] Computed 22 invariants in 3 ms
[2024-05-21 07:11:06] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-21 07:11:06] [INFO ] Invariant cache hit.
[2024-05-21 07:11:06] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2024-05-21 07:11:06] [INFO ] Invariant cache hit.
[2024-05-21 07:11:06] [INFO ] Dead Transitions using invariants and state equation in 310 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/245 places, 228/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 971 ms. Remains : 235/245 places, 228/240 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s119 1), p1:(EQ s91 1), p3:(EQ s134 1), p2:(OR (EQ s65 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1723 reset in 288 ms.
Product exploration explored 100000 steps with 1753 reset in 237 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 115 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Finished random walk after 708 steps, including 4 resets, run visited all 5 properties in 10 ms. (steps per millisecond=70 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2)))), (F (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 305 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
[2024-05-21 07:11:08] [INFO ] Invariant cache hit.
[2024-05-21 07:11:08] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2024-05-21 07:11:08] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 07:11:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:11:09] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2024-05-21 07:11:09] [INFO ] Computed and/alt/rep : 227/325/227 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-21 07:11:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:11:09] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2024-05-21 07:11:09] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 07:11:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:11:09] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-21 07:11:09] [INFO ] Computed and/alt/rep : 227/325/227 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-21 07:11:11] [INFO ] Added : 220 causal constraints over 44 iterations in 1582 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-05-21 07:11:11] [INFO ] Invariant cache hit.
[2024-05-21 07:11:11] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2024-05-21 07:11:11] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-21 07:11:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:11:11] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2024-05-21 07:11:11] [INFO ] Computed and/alt/rep : 227/325/227 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-21 07:11:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:11:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2024-05-21 07:11:11] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 07:11:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:11:12] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2024-05-21 07:11:12] [INFO ] Computed and/alt/rep : 227/325/227 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-21 07:11:13] [INFO ] Added : 215 causal constraints over 43 iterations in 1173 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 228/228 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2024-05-21 07:11:13] [INFO ] Invariant cache hit.
[2024-05-21 07:11:13] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-21 07:11:13] [INFO ] Invariant cache hit.
[2024-05-21 07:11:13] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2024-05-21 07:11:13] [INFO ] Invariant cache hit.
[2024-05-21 07:11:13] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 657 ms. Remains : 235/235 places, 228/228 transitions.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 109 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Finished random walk after 3336 steps, including 20 resets, run visited all 5 properties in 16 ms. (steps per millisecond=208 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2)))), (F (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 263 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
[2024-05-21 07:11:14] [INFO ] Invariant cache hit.
[2024-05-21 07:11:15] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2024-05-21 07:11:15] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-21 07:11:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:11:15] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2024-05-21 07:11:15] [INFO ] Computed and/alt/rep : 227/325/227 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-21 07:11:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:11:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2024-05-21 07:11:15] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 07:11:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:11:15] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-21 07:11:15] [INFO ] Computed and/alt/rep : 227/325/227 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-21 07:11:16] [INFO ] Added : 220 causal constraints over 44 iterations in 1076 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-05-21 07:11:16] [INFO ] Invariant cache hit.
[2024-05-21 07:11:17] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2024-05-21 07:11:17] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-21 07:11:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:11:17] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-21 07:11:17] [INFO ] Computed and/alt/rep : 227/325/227 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-21 07:11:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:11:17] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2024-05-21 07:11:17] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 07:11:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:11:17] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2024-05-21 07:11:17] [INFO ] Computed and/alt/rep : 227/325/227 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-21 07:11:18] [INFO ] Added : 215 causal constraints over 43 iterations in 1143 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 1752 reset in 244 ms.
Product exploration explored 100000 steps with 1716 reset in 291 ms.
Built C files in :
/tmp/ltsmin9550852776507700536
[2024-05-21 07:11:19] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9550852776507700536
Running compilation step : cd /tmp/ltsmin9550852776507700536;'/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 706 ms.
Running link step : cd /tmp/ltsmin9550852776507700536;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin9550852776507700536;'/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/stateBased5338593905165585023.hoa' '--buchi-type=spotba'
LTSmin run took 11346 ms.
FORMULA AutoFlight-PT-03b-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-03b-LTLCardinality-05 finished in 26108 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)||F(p1))))'
Support contains 4 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 240/240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 239 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 239 transition count 234
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 239 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 237 transition count 229
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 237 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 236 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 236 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 235 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 235 transition count 227
Applied a total of 23 rules in 19 ms. Remains 235 /245 variables (removed 10) and now considering 227/240 (removed 13) transitions.
// Phase 1: matrix 227 rows 235 cols
[2024-05-21 07:11:31] [INFO ] Computed 22 invariants in 2 ms
[2024-05-21 07:11:32] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 07:11:32] [INFO ] Invariant cache hit.
[2024-05-21 07:11:32] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-05-21 07:11:32] [INFO ] Invariant cache hit.
[2024-05-21 07:11:32] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/245 places, 227/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 700 ms. Remains : 235/245 places, 227/240 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s75 0) (EQ s180 1)), p0:(AND (EQ s66 0) (EQ s117 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 1430 reset in 182 ms.
Product exploration explored 100000 steps with 1458 reset in 158 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 126 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Finished random walk after 45 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 137 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
[2024-05-21 07:11:33] [INFO ] Invariant cache hit.
[2024-05-21 07:11:33] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2024-05-21 07:11:33] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 07:11:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:11:33] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2024-05-21 07:11:33] [INFO ] Computed and/alt/rep : 226/323/226 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-21 07:11:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:11:34] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2024-05-21 07:11:34] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 07:11:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:11:34] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-21 07:11:34] [INFO ] Computed and/alt/rep : 226/323/226 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-21 07:11:35] [INFO ] Added : 226 causal constraints over 46 iterations in 1152 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 235 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 227/227 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 234 transition count 148
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 87 rules applied. Total rules applied 165 place count 156 transition count 139
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 171 place count 150 transition count 139
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 171 place count 150 transition count 109
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 231 place count 120 transition count 109
Performed 46 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 323 place count 74 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 324 place count 74 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 325 place count 73 transition count 56
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 7 rules applied. Total rules applied 332 place count 68 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 334 place count 66 transition count 54
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 334 place count 66 transition count 51
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 340 place count 63 transition count 51
Applied a total of 340 rules in 41 ms. Remains 63 /235 variables (removed 172) and now considering 51/227 (removed 176) transitions.
// Phase 1: matrix 51 rows 63 cols
[2024-05-21 07:11:35] [INFO ] Computed 17 invariants in 1 ms
[2024-05-21 07:11:35] [INFO ] Implicit Places using invariants in 119 ms returned [25, 48, 52, 56, 62]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 121 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/235 places, 51/227 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 48
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 48
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 10 place count 53 transition count 46
Applied a total of 10 rules in 7 ms. Remains 53 /58 variables (removed 5) and now considering 46/51 (removed 5) transitions.
// Phase 1: matrix 46 rows 53 cols
[2024-05-21 07:11:35] [INFO ] Computed 12 invariants in 2 ms
[2024-05-21 07:11:35] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 07:11:35] [INFO ] Invariant cache hit.
[2024-05-21 07:11:35] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/235 places, 46/227 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 303 ms. Remains : 53/235 places, 46/227 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 160 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 215 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
[2024-05-21 07:11:36] [INFO ] Invariant cache hit.
[2024-05-21 07:11:36] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 07:11:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:11:36] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-21 07:11:36] [INFO ] Computed and/alt/rep : 29/41/29 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-21 07:11:36] [INFO ] Added : 5 causal constraints over 1 iterations in 20 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering criterion allowed to conclude after 29402 steps with 3541 reset in 72 ms.
FORMULA AutoFlight-PT-03b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLCardinality-08 finished in 4599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 240/240 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 239 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 239 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 239 transition count 233
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 237 transition count 231
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 237 transition count 231
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 236 transition count 230
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 236 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 235 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 235 transition count 229
Applied a total of 21 rules in 29 ms. Remains 235 /245 variables (removed 10) and now considering 229/240 (removed 11) transitions.
// Phase 1: matrix 229 rows 235 cols
[2024-05-21 07:11:36] [INFO ] Computed 22 invariants in 4 ms
[2024-05-21 07:11:36] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-21 07:11:36] [INFO ] Invariant cache hit.
[2024-05-21 07:11:36] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-21 07:11:36] [INFO ] Invariant cache hit.
[2024-05-21 07:11:37] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 235/245 places, 229/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 548 ms. Remains : 235/245 places, 229/240 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s19 0) (EQ s43 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 465 ms.
Product exploration explored 100000 steps with 50000 reset in 420 ms.
Computed a total of 57 stabilizing places and 57 stable transitions
Computed a total of 57 stabilizing places and 57 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 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-03b-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-03b-LTLCardinality-09 finished in 1672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 240/240 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 237 transition count 232
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 237 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 237 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 235 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 235 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 234 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 234 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 233 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 233 transition count 225
Applied a total of 27 rules in 15 ms. Remains 233 /245 variables (removed 12) and now considering 225/240 (removed 15) transitions.
// Phase 1: matrix 225 rows 233 cols
[2024-05-21 07:11:38] [INFO ] Computed 22 invariants in 2 ms
[2024-05-21 07:11:38] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 07:11:38] [INFO ] Invariant cache hit.
[2024-05-21 07:11:38] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-05-21 07:11:38] [INFO ] Invariant cache hit.
[2024-05-21 07:11:38] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 233/245 places, 225/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 547 ms. Remains : 233/245 places, 225/240 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s228 0) (EQ s20 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 462 ms.
Product exploration explored 100000 steps with 50000 reset in 400 ms.
Computed a total of 57 stabilizing places and 57 stable transitions
Computed a total of 57 stabilizing places and 57 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 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-03b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-03b-LTLCardinality-10 finished in 1529 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 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 240/240 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 238 transition count 233
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 238 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 238 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 237 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 237 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 236 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 236 transition count 228
Applied a total of 21 rules in 13 ms. Remains 236 /245 variables (removed 9) and now considering 228/240 (removed 12) transitions.
// Phase 1: matrix 228 rows 236 cols
[2024-05-21 07:11:39] [INFO ] Computed 22 invariants in 2 ms
[2024-05-21 07:11:39] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-21 07:11:39] [INFO ] Invariant cache hit.
[2024-05-21 07:11:40] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-05-21 07:11:40] [INFO ] Invariant cache hit.
[2024-05-21 07:11:40] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/245 places, 228/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 488 ms. Remains : 236/245 places, 228/240 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLCardinality-12 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 s138 0) (EQ s36 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 626 reset in 145 ms.
Product exploration explored 100000 steps with 625 reset in 172 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 62 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7501 steps, run visited all 1 properties in 47 ms. (steps per millisecond=159 )
Probabilistic random walk after 7501 steps, saw 2932 distinct states, run finished after 47 ms. (steps per millisecond=159 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-03b-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-03b-LTLCardinality-12 finished in 1306 ms.
All properties solved by simple procedures.
Total runtime 45705 ms.

BK_STOP 1716275502171

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

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