fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r007-oct2-167813595800651
Last Updated
May 14, 2023

About the Execution of LoLa+red for AutonomousCar-PT-08b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
833.899 126268.00 168179.00 391.40 ?FFTTTTTFFTTTTFT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 936K
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 12:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 12:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 12:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 517K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-08b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678352585983

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 09:03:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 09:03:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 09:03:10] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2023-03-09 09:03:10] [INFO ] Transformed 357 places.
[2023-03-09 09:03:10] [INFO ] Transformed 1128 transitions.
[2023-03-09 09:03:10] [INFO ] Found NUPN structural information;
[2023-03-09 09:03:10] [INFO ] Parsed PT model containing 357 places and 1128 transitions and 9454 arcs in 410 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-08b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 357 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 1128/1128 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 309 transition count 1080
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 309 transition count 1080
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 0 with 256 rules applied. Total rules applied 352 place count 309 transition count 824
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 361 place count 300 transition count 815
Iterating global reduction 1 with 9 rules applied. Total rules applied 370 place count 300 transition count 815
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 371 place count 299 transition count 814
Iterating global reduction 1 with 1 rules applied. Total rules applied 372 place count 299 transition count 814
Applied a total of 372 rules in 100 ms. Remains 299 /357 variables (removed 58) and now considering 814/1128 (removed 314) transitions.
// Phase 1: matrix 814 rows 299 cols
[2023-03-09 09:03:11] [INFO ] Computed 13 place invariants in 24 ms
[2023-03-09 09:03:11] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-09 09:03:11] [INFO ] Invariant cache hit.
[2023-03-09 09:03:12] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 1686 ms to find 0 implicit places.
[2023-03-09 09:03:12] [INFO ] Invariant cache hit.
[2023-03-09 09:03:14] [INFO ] Dead Transitions using invariants and state equation in 1233 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 299/357 places, 814/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3041 ms. Remains : 299/357 places, 814/1128 transitions.
Support contains 15 out of 299 places after structural reductions.
[2023-03-09 09:03:14] [INFO ] Flatten gal took : 159 ms
[2023-03-09 09:03:14] [INFO ] Flatten gal took : 149 ms
[2023-03-09 09:03:15] [INFO ] Input system was already deterministic with 814 transitions.
Support contains 14 out of 299 places (down from 15) after GAL structural reductions.
Finished random walk after 1835 steps, including 16 resets, run visited all 8 properties in 99 ms. (steps per millisecond=18 )
FORMULA AutonomousCar-PT-08b-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 48 stabilizing places and 49 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p0&&F(!p1))))))'
Support contains 3 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 814/814 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 293 transition count 808
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 293 transition count 808
Applied a total of 12 rules in 18 ms. Remains 293 /299 variables (removed 6) and now considering 808/814 (removed 6) transitions.
// Phase 1: matrix 808 rows 293 cols
[2023-03-09 09:03:15] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-09 09:03:15] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-09 09:03:15] [INFO ] Invariant cache hit.
[2023-03-09 09:03:16] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
[2023-03-09 09:03:16] [INFO ] Invariant cache hit.
[2023-03-09 09:03:16] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 293/299 places, 808/814 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1341 ms. Remains : 293/299 places, 808/814 transitions.
Stuttering acceptance computed with spot in 391 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(NEQ s181 1), p1:(OR (EQ s212 0) (EQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2287 reset in 401 ms.
Product exploration explored 100000 steps with 2282 reset in 242 ms.
Computed a total of 47 stabilizing places and 48 stable transitions
Computed a total of 47 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 361 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 81 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 357 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 3 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 808/808 transitions.
Applied a total of 0 rules in 5 ms. Remains 293 /293 variables (removed 0) and now considering 808/808 (removed 0) transitions.
[2023-03-09 09:03:18] [INFO ] Invariant cache hit.
[2023-03-09 09:03:19] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-09 09:03:19] [INFO ] Invariant cache hit.
[2023-03-09 09:03:19] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 1035 ms to find 0 implicit places.
[2023-03-09 09:03:19] [INFO ] Invariant cache hit.
[2023-03-09 09:03:20] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1419 ms. Remains : 293/293 places, 808/808 transitions.
Computed a total of 47 stabilizing places and 48 stable transitions
Computed a total of 47 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 204 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 196 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=98 )
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 255 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 2282 reset in 225 ms.
Product exploration explored 100000 steps with 2276 reset in 197 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 3 out of 293 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 293/293 places, 808/808 transitions.
Graph (trivial) has 273 edges and 293 vertex of which 4 / 293 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 291 transition count 806
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 123 place count 291 transition count 788
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 123 place count 291 transition count 788
Deduced a syphon composed of 126 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 145 place count 291 transition count 788
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 235 place count 201 transition count 698
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 2 with 90 rules applied. Total rules applied 325 place count 201 transition count 698
Performed 80 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 117 places in 1 ms
Iterating global reduction 2 with 80 rules applied. Total rules applied 405 place count 201 transition count 708
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 407 place count 201 transition count 706
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 474 place count 134 transition count 527
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 3 with 67 rules applied. Total rules applied 541 place count 134 transition count 527
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 556 place count 134 transition count 512
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 564 place count 126 transition count 504
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 572 place count 126 transition count 504
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 573 place count 126 transition count 504
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 575 place count 124 transition count 502
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 577 place count 124 transition count 502
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 58 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 578 place count 124 transition count 504
Deduced a syphon composed of 58 places in 0 ms
Applied a total of 578 rules in 253 ms. Remains 124 /293 variables (removed 169) and now considering 504/808 (removed 304) transitions.
[2023-03-09 09:03:22] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 504 rows 124 cols
[2023-03-09 09:03:22] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-09 09:03:22] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/293 places, 504/808 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 654 ms. Remains : 124/293 places, 504/808 transitions.
Support contains 3 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 808/808 transitions.
Applied a total of 0 rules in 7 ms. Remains 293 /293 variables (removed 0) and now considering 808/808 (removed 0) transitions.
// Phase 1: matrix 808 rows 293 cols
[2023-03-09 09:03:22] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-09 09:03:23] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-09 09:03:23] [INFO ] Invariant cache hit.
[2023-03-09 09:03:23] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
[2023-03-09 09:03:23] [INFO ] Invariant cache hit.
[2023-03-09 09:03:24] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1400 ms. Remains : 293/293 places, 808/808 transitions.
Treatment of property AutonomousCar-PT-08b-LTLCardinality-00 finished in 8994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 814/814 transitions.
Graph (trivial) has 282 edges and 299 vertex of which 4 / 299 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 113 place count 296 transition count 699
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 155 rules applied. Total rules applied 268 place count 184 transition count 656
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 293 place count 159 transition count 656
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 293 place count 159 transition count 648
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 309 place count 151 transition count 648
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 313 place count 147 transition count 644
Iterating global reduction 3 with 4 rules applied. Total rules applied 317 place count 147 transition count 644
Performed 64 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 445 place count 83 transition count 579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 446 place count 83 transition count 578
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 462 place count 67 transition count 449
Iterating global reduction 4 with 16 rules applied. Total rules applied 478 place count 67 transition count 449
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 484 place count 67 transition count 443
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 5 with 4 rules applied. Total rules applied 488 place count 65 transition count 441
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 489 place count 65 transition count 440
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 490 place count 65 transition count 440
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 492 place count 63 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 493 place count 62 transition count 438
Applied a total of 493 rules in 156 ms. Remains 62 /299 variables (removed 237) and now considering 438/814 (removed 376) transitions.
// Phase 1: matrix 438 rows 62 cols
[2023-03-09 09:03:24] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 09:03:24] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-09 09:03:24] [INFO ] Invariant cache hit.
[2023-03-09 09:03:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 09:03:25] [INFO ] Implicit Places using invariants and state equation in 393 ms returned [57, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 742 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/299 places, 438/814 transitions.
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 2 place count 59 transition count 437
Applied a total of 2 rules in 35 ms. Remains 59 /60 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 59 cols
[2023-03-09 09:03:25] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-09 09:03:25] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-09 09:03:25] [INFO ] Invariant cache hit.
[2023-03-09 09:03:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:03:25] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/299 places, 437/814 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1536 ms. Remains : 59/299 places, 437/814 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s36 0) (EQ s20 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 88 reset in 152 ms.
Product exploration explored 100000 steps with 546 reset in 129 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 108 steps, including 7 resets, run visited all 1 properties in 3 ms. (steps per millisecond=36 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 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 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 437/437 transitions.
Applied a total of 0 rules in 20 ms. Remains 59 /59 variables (removed 0) and now considering 437/437 (removed 0) transitions.
[2023-03-09 09:03:26] [INFO ] Invariant cache hit.
[2023-03-09 09:03:26] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-09 09:03:26] [INFO ] Invariant cache hit.
[2023-03-09 09:03:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:03:27] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 972 ms to find 0 implicit places.
[2023-03-09 09:03:27] [INFO ] Redundant transitions in 67 ms returned [297]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 436 rows 59 cols
[2023-03-09 09:03:27] [INFO ] Computed 9 place invariants in 6 ms
[2023-03-09 09:03:27] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/59 places, 436/437 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 57 transition count 434
Applied a total of 2 rules in 23 ms. Remains 57 /59 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 57 cols
[2023-03-09 09:03:28] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-09 09:03:28] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-09 09:03:28] [INFO ] Invariant cache hit.
[2023-03-09 09:03:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:03:28] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/59 places, 434/437 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2012 ms. Remains : 57/59 places, 434/437 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 225 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 75 ms :[(NOT p0)]
Finished random walk after 33 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 217 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 55 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2289 reset in 195 ms.
Product exploration explored 100000 steps with 78 reset in 119 ms.
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 434/434 transitions.
Applied a total of 0 rules in 14 ms. Remains 57 /57 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2023-03-09 09:03:29] [INFO ] Invariant cache hit.
[2023-03-09 09:03:29] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-09 09:03:29] [INFO ] Invariant cache hit.
[2023-03-09 09:03:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:03:30] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2023-03-09 09:03:30] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-09 09:03:30] [INFO ] Invariant cache hit.
[2023-03-09 09:03:30] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 803 ms. Remains : 57/57 places, 434/434 transitions.
Treatment of property AutonomousCar-PT-08b-LTLCardinality-02 finished in 6272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 814/814 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 292 transition count 807
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 292 transition count 807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 291 transition count 806
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 291 transition count 806
Applied a total of 16 rules in 33 ms. Remains 291 /299 variables (removed 8) and now considering 806/814 (removed 8) transitions.
// Phase 1: matrix 806 rows 291 cols
[2023-03-09 09:03:30] [INFO ] Computed 13 place invariants in 11 ms
[2023-03-09 09:03:30] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-09 09:03:30] [INFO ] Invariant cache hit.
[2023-03-09 09:03:31] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
[2023-03-09 09:03:31] [INFO ] Invariant cache hit.
[2023-03-09 09:03:32] [INFO ] Dead Transitions using invariants and state equation in 964 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 291/299 places, 806/814 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2168 ms. Remains : 291/299 places, 806/814 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-07 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 s24 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 3731 reset in 177 ms.
Product exploration explored 100000 steps with 3727 reset in 227 ms.
Computed a total of 45 stabilizing places and 46 stable transitions
Computed a total of 45 stabilizing places and 46 stable transitions
Detected a total of 45/291 stabilizing places and 46/806 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 235 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 271 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 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
[2023-03-09 09:03:33] [INFO ] Invariant cache hit.
[2023-03-09 09:03:34] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-09 09:03:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:03:35] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2023-03-09 09:03:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:03:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-09 09:03:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:03:35] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2023-03-09 09:03:36] [INFO ] Deduced a trap composed of 67 places in 320 ms of which 4 ms to minimize.
[2023-03-09 09:03:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 411 ms
[2023-03-09 09:03:36] [INFO ] Computed and/alt/rep : 248/467/248 causal constraints (skipped 557 transitions) in 245 ms.
[2023-03-09 09:03:37] [INFO ] Added : 76 causal constraints over 16 iterations in 1247 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 806/806 transitions.
Graph (trivial) has 275 edges and 291 vertex of which 4 / 291 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 288 transition count 701
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 149 rules applied. Total rules applied 252 place count 186 transition count 654
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 29 rules applied. Total rules applied 281 place count 158 transition count 653
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 282 place count 157 transition count 653
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 282 place count 157 transition count 645
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 298 place count 149 transition count 645
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 299 place count 148 transition count 644
Iterating global reduction 4 with 1 rules applied. Total rules applied 300 place count 148 transition count 644
Performed 66 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 432 place count 82 transition count 577
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 433 place count 82 transition count 576
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 450 place count 65 transition count 439
Iterating global reduction 5 with 17 rules applied. Total rules applied 467 place count 65 transition count 439
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 475 place count 65 transition count 431
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 6 with 4 rules applied. Total rules applied 479 place count 63 transition count 429
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 481 place count 61 transition count 427
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 482 place count 60 transition count 427
Applied a total of 482 rules in 100 ms. Remains 60 /291 variables (removed 231) and now considering 427/806 (removed 379) transitions.
// Phase 1: matrix 427 rows 60 cols
[2023-03-09 09:03:37] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 09:03:38] [INFO ] Implicit Places using invariants in 471 ms returned []
[2023-03-09 09:03:38] [INFO ] Invariant cache hit.
[2023-03-09 09:03:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 09:03:38] [INFO ] Implicit Places using invariants and state equation in 703 ms returned [55, 59]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1214 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/291 places, 427/806 transitions.
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 2 place count 57 transition count 426
Applied a total of 2 rules in 50 ms. Remains 57 /58 variables (removed 1) and now considering 426/427 (removed 1) transitions.
// Phase 1: matrix 426 rows 57 cols
[2023-03-09 09:03:38] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-09 09:03:39] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-09 09:03:39] [INFO ] Invariant cache hit.
[2023-03-09 09:03:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:03:39] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/291 places, 426/806 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2004 ms. Remains : 57/291 places, 426/806 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Detected a total of 3/57 stabilizing places and 4/426 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 228 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 45 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 211 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
[2023-03-09 09:03:40] [INFO ] Invariant cache hit.
[2023-03-09 09:03:40] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-09 09:03:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:03:40] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-09 09:03:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:03:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-09 09:03:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:03:40] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-09 09:03:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:03:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-09 09:03:41] [INFO ] Deduced a trap composed of 18 places in 319 ms of which 32 ms to minimize.
[2023-03-09 09:03:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2023-03-09 09:03:41] [INFO ] Computed and/alt/rep : 6/7/6 causal constraints (skipped 418 transitions) in 178 ms.
[2023-03-09 09:03:41] [INFO ] Added : 0 causal constraints over 0 iterations in 199 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 39961 reset in 174 ms.
Product exploration explored 100000 steps with 39946 reset in 197 ms.
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 426/426 transitions.
Applied a total of 0 rules in 18 ms. Remains 57 /57 variables (removed 0) and now considering 426/426 (removed 0) transitions.
[2023-03-09 09:03:41] [INFO ] Invariant cache hit.
[2023-03-09 09:03:41] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-09 09:03:41] [INFO ] Invariant cache hit.
[2023-03-09 09:03:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:03:42] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2023-03-09 09:03:42] [INFO ] Redundant transitions in 25 ms returned [295]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 425 rows 57 cols
[2023-03-09 09:03:42] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-09 09:03:42] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/57 places, 425/426 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 55 transition count 423
Applied a total of 2 rules in 16 ms. Remains 55 /57 variables (removed 2) and now considering 423/425 (removed 2) transitions.
// Phase 1: matrix 423 rows 55 cols
[2023-03-09 09:03:42] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-09 09:03:42] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-09 09:03:42] [INFO ] Invariant cache hit.
[2023-03-09 09:03:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:03:43] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/57 places, 423/426 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1507 ms. Remains : 55/57 places, 423/426 transitions.
Treatment of property AutonomousCar-PT-08b-LTLCardinality-07 finished in 12788 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(F(p1)&&G(p2))))'
Support contains 4 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 814/814 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 294 transition count 809
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 294 transition count 809
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 293 transition count 808
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 293 transition count 808
Applied a total of 12 rules in 17 ms. Remains 293 /299 variables (removed 6) and now considering 808/814 (removed 6) transitions.
// Phase 1: matrix 808 rows 293 cols
[2023-03-09 09:03:43] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-09 09:03:43] [INFO ] Implicit Places using invariants in 463 ms returned []
[2023-03-09 09:03:43] [INFO ] Invariant cache hit.
[2023-03-09 09:03:44] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
[2023-03-09 09:03:44] [INFO ] Invariant cache hit.
[2023-03-09 09:03:44] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 293/299 places, 808/814 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1481 ms. Remains : 293/299 places, 808/814 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(AND (EQ s24 0) (EQ s227 1)), p0:(AND (EQ s141 0) (EQ s138 1)), p1:(OR (EQ s138 0) (EQ s141 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-08b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLCardinality-14 finished in 1703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p0&&F(!p1))))))'
Found a Shortening insensitive property : AutonomousCar-PT-08b-LTLCardinality-00
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Support contains 3 out of 299 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 299/299 places, 814/814 transitions.
Graph (trivial) has 279 edges and 299 vertex of which 4 / 299 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 296 transition count 701
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 154 rules applied. Total rules applied 265 place count 186 transition count 657
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 291 place count 160 transition count 657
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 291 place count 160 transition count 648
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 309 place count 151 transition count 648
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 313 place count 147 transition count 644
Iterating global reduction 3 with 4 rules applied. Total rules applied 317 place count 147 transition count 644
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 318 place count 146 transition count 636
Iterating global reduction 3 with 1 rules applied. Total rules applied 319 place count 146 transition count 636
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 2 rules applied. Total rules applied 321 place count 146 transition count 634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 322 place count 145 transition count 634
Performed 61 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 5 with 122 rules applied. Total rules applied 444 place count 84 transition count 572
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 445 place count 84 transition count 571
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 460 place count 69 transition count 451
Iterating global reduction 6 with 15 rules applied. Total rules applied 475 place count 69 transition count 451
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 482 place count 69 transition count 444
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 7 with 4 rules applied. Total rules applied 486 place count 67 transition count 442
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 487 place count 67 transition count 442
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 489 place count 65 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 490 place count 64 transition count 440
Applied a total of 490 rules in 129 ms. Remains 64 /299 variables (removed 235) and now considering 440/814 (removed 374) transitions.
// Phase 1: matrix 440 rows 64 cols
[2023-03-09 09:03:45] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 09:03:45] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-09 09:03:45] [INFO ] Invariant cache hit.
[2023-03-09 09:03:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 09:03:46] [INFO ] Implicit Places using invariants and state equation in 500 ms returned [59, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 714 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 62/299 places, 440/814 transitions.
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 2 place count 61 transition count 439
Applied a total of 2 rules in 8 ms. Remains 61 /62 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 61 cols
[2023-03-09 09:03:46] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-09 09:03:46] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-09 09:03:46] [INFO ] Invariant cache hit.
[2023-03-09 09:03:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:03:47] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1241 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 61/299 places, 439/814 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2092 ms. Remains : 61/299 places, 439/814 transitions.
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(NEQ s39 1), p1:(OR (EQ s49 0) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 39959 reset in 163 ms.
Product exploration explored 100000 steps with 39999 reset in 159 ms.
Computed a total of 3 stabilizing places and 6 stable transitions
Computed a total of 3 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 347 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 34 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 383 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 439/439 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 439/439 (removed 0) transitions.
[2023-03-09 09:03:48] [INFO ] Invariant cache hit.
[2023-03-09 09:03:49] [INFO ] Implicit Places using invariants in 815 ms returned []
[2023-03-09 09:03:49] [INFO ] Invariant cache hit.
[2023-03-09 09:03:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:03:50] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
[2023-03-09 09:03:50] [INFO ] Invariant cache hit.
[2023-03-09 09:03:50] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1572 ms. Remains : 61/61 places, 439/439 transitions.
Computed a total of 3 stabilizing places and 6 stable transitions
Computed a total of 3 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 3 factoid took 212 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 68 steps, including 3 resets, run visited all 2 properties in 1 ms. (steps per millisecond=68 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 363 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 40038 reset in 140 ms.
Product exploration explored 100000 steps with 39973 reset in 219 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 439/439 transitions.
Applied a total of 0 rules in 33 ms. Remains 61 /61 variables (removed 0) and now considering 439/439 (removed 0) transitions.
[2023-03-09 09:03:52] [INFO ] Redundant transitions in 33 ms returned [299]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 438 rows 61 cols
[2023-03-09 09:03:52] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-09 09:03:52] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/61 places, 438/439 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 440
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 18 ms. Remains 61 /61 variables (removed 0) and now considering 440/438 (removed -2) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/61 places, 440/439 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 337 ms. Remains : 61/61 places, 440/439 transitions.
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 439/439 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 439/439 (removed 0) transitions.
// Phase 1: matrix 439 rows 61 cols
[2023-03-09 09:03:52] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-09 09:03:52] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-09 09:03:52] [INFO ] Invariant cache hit.
[2023-03-09 09:03:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:03:53] [INFO ] Implicit Places using invariants and state equation in 703 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
[2023-03-09 09:03:53] [INFO ] Invariant cache hit.
[2023-03-09 09:03:53] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1355 ms. Remains : 61/61 places, 439/439 transitions.
Treatment of property AutonomousCar-PT-08b-LTLCardinality-00 finished in 8899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : AutonomousCar-PT-08b-LTLCardinality-07
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 299 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 299/299 places, 814/814 transitions.
Graph (trivial) has 283 edges and 299 vertex of which 4 / 299 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 296 transition count 701
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 156 rules applied. Total rules applied 267 place count 186 transition count 655
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 28 rules applied. Total rules applied 295 place count 159 transition count 654
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 296 place count 158 transition count 654
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 296 place count 158 transition count 646
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 312 place count 150 transition count 646
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 317 place count 145 transition count 641
Iterating global reduction 4 with 5 rules applied. Total rules applied 322 place count 145 transition count 641
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 323 place count 144 transition count 633
Iterating global reduction 4 with 1 rules applied. Total rules applied 324 place count 144 transition count 633
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 326 place count 144 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 327 place count 143 transition count 631
Performed 62 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 6 with 124 rules applied. Total rules applied 451 place count 81 transition count 568
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 452 place count 81 transition count 567
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 468 place count 65 transition count 438
Iterating global reduction 7 with 16 rules applied. Total rules applied 484 place count 65 transition count 438
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 491 place count 65 transition count 431
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 8 with 4 rules applied. Total rules applied 495 place count 63 transition count 429
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 497 place count 61 transition count 427
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 498 place count 60 transition count 427
Applied a total of 498 rules in 61 ms. Remains 60 /299 variables (removed 239) and now considering 427/814 (removed 387) transitions.
// Phase 1: matrix 427 rows 60 cols
[2023-03-09 09:03:54] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-09 09:03:54] [INFO ] Implicit Places using invariants in 524 ms returned []
[2023-03-09 09:03:54] [INFO ] Invariant cache hit.
[2023-03-09 09:03:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 09:03:55] [INFO ] Implicit Places using invariants and state equation in 452 ms returned [55, 59]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 991 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 58/299 places, 427/814 transitions.
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 2 place count 57 transition count 426
Applied a total of 2 rules in 20 ms. Remains 57 /58 variables (removed 1) and now considering 426/427 (removed 1) transitions.
// Phase 1: matrix 426 rows 57 cols
[2023-03-09 09:03:55] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-09 09:03:55] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-09 09:03:55] [INFO ] Invariant cache hit.
[2023-03-09 09:03:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:03:56] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 57/299 places, 426/814 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1912 ms. Remains : 57/299 places, 426/814 transitions.
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-07 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 s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 40003 reset in 110 ms.
Product exploration explored 100000 steps with 40022 reset in 189 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Detected a total of 3/57 stabilizing places and 4/426 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 240 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 344 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 83 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0)]
[2023-03-09 09:03:57] [INFO ] Invariant cache hit.
[2023-03-09 09:03:57] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-09 09:03:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:03:57] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2023-03-09 09:03:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:03:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-09 09:03:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:03:58] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2023-03-09 09:03:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:03:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-09 09:03:58] [INFO ] Deduced a trap composed of 18 places in 407 ms of which 2 ms to minimize.
[2023-03-09 09:03:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 435 ms
[2023-03-09 09:03:58] [INFO ] Computed and/alt/rep : 6/7/6 causal constraints (skipped 418 transitions) in 77 ms.
[2023-03-09 09:03:58] [INFO ] Added : 0 causal constraints over 0 iterations in 130 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 426/426 transitions.
Applied a total of 0 rules in 15 ms. Remains 57 /57 variables (removed 0) and now considering 426/426 (removed 0) transitions.
[2023-03-09 09:03:58] [INFO ] Invariant cache hit.
[2023-03-09 09:03:59] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-09 09:03:59] [INFO ] Invariant cache hit.
[2023-03-09 09:03:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:03:59] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
[2023-03-09 09:03:59] [INFO ] Redundant transitions in 14 ms returned [295]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 425 rows 57 cols
[2023-03-09 09:03:59] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-09 09:03:59] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/57 places, 425/426 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 55 transition count 423
Applied a total of 2 rules in 17 ms. Remains 55 /57 variables (removed 2) and now considering 423/425 (removed 2) transitions.
// Phase 1: matrix 423 rows 55 cols
[2023-03-09 09:03:59] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-09 09:03:59] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-09 09:03:59] [INFO ] Invariant cache hit.
[2023-03-09 09:04:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 09:04:00] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/57 places, 423/426 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1685 ms. Remains : 55/57 places, 423/426 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/55 stabilizing places and 5/423 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
Treatment of property AutonomousCar-PT-08b-LTLCardinality-07 finished in 6360 ms.
FORMULA AutonomousCar-PT-08b-LTLCardinality-07 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2023-03-09 09:04:00] [INFO ] Flatten gal took : 95 ms
[2023-03-09 09:04:00] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-09 09:04:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 299 places, 814 transitions and 7290 arcs took 10 ms.
Total runtime 50307 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutonomousCar-PT-08b
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/380
LTLCardinality

FORMULA AutonomousCar-PT-08b-LTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutonomousCar-PT-08b-LTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678352712251

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-08b-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-08b-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-08b-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1200 4/32 AutonomousCar-PT-08b-LTLCardinality-00 498500 m, 99700 m/sec, 2502657 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-08b-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-08b-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-08b-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1200 7/32 AutonomousCar-PT-08b-LTLCardinality-00 946238 m, 89547 m/sec, 5051359 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-08b-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-08b-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-08b-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1200 10/32 AutonomousCar-PT-08b-LTLCardinality-00 1394314 m, 89615 m/sec, 7588673 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-08b-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-08b-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-08b-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1200 13/32 AutonomousCar-PT-08b-LTLCardinality-00 1837565 m, 88650 m/sec, 10121818 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-08b-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-08b-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-08b-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1200 17/32 AutonomousCar-PT-08b-LTLCardinality-00 2309885 m, 94464 m/sec, 12655472 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-08b-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-08b-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-08b-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/1200 20/32 AutonomousCar-PT-08b-LTLCardinality-00 2725721 m, 83167 m/sec, 15105411 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-08b-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-08b-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-08b-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/1200 23/32 AutonomousCar-PT-08b-LTLCardinality-00 3125436 m, 79943 m/sec, 17531858 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-08b-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-08b-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-08b-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/1200 26/32 AutonomousCar-PT-08b-LTLCardinality-00 3575543 m, 90021 m/sec, 20016452 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-08b-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-08b-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-08b-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/1200 29/32 AutonomousCar-PT-08b-LTLCardinality-00 3970635 m, 79018 m/sec, 22400670 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-08b-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
AutonomousCar-PT-08b-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-08b-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/1200 32/32 AutonomousCar-PT-08b-LTLCardinality-00 4404778 m, 86828 m/sec, 24867880 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for AutonomousCar-PT-08b-LTLCardinality-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-08b-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-08b-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
AutonomousCar-PT-08b-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 7 (type EXCL) for 6 AutonomousCar-PT-08b-LTLCardinality-07
lola: time limit : 1772 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for AutonomousCar-PT-08b-LTLCardinality-07
lola: result : true
lola: markings : 4956
lola: fired transitions : 17515
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 AutonomousCar-PT-08b-LTLCardinality-02
lola: time limit : 3545 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-08b-LTLCardinality-07: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-08b-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-08b-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3545 1/32 AutonomousCar-PT-08b-LTLCardinality-02 48964 m, 9792 m/sec, 266031 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-08b-LTLCardinality-07: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-08b-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-08b-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3545 1/32 AutonomousCar-PT-08b-LTLCardinality-02 103559 m, 10919 m/sec, 579000 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-08b-LTLCardinality-07: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
AutonomousCar-PT-08b-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
AutonomousCar-PT-08b-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3545 2/32 AutonomousCar-PT-08b-LTLCardinality-02 155280 m, 10344 m/sec, 872229 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: FINISHED task # 4 (type EXCL) for AutonomousCar-PT-08b-LTLCardinality-02
lola: result : false
lola: markings : 167670
lola: fired transitions : 942764
lola: time used : 17.000000
lola: memory pages used : 2
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-08b-LTLCardinality-00: LTL unknown AGGR
AutonomousCar-PT-08b-LTLCardinality-02: LTL false LTL model checker
AutonomousCar-PT-08b-LTLCardinality-07: LTL true LTL model checker


Time elapsed: 72 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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