Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 517K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1716312764535

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 17:32:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 17:32:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 17:32:47] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2024-05-21 17:32:47] [INFO ] Transformed 357 places.
[2024-05-21 17:32:47] [INFO ] Transformed 1128 transitions.
[2024-05-21 17:32:47] [INFO ] Found NUPN structural information;
[2024-05-21 17:32:47] [INFO ] Parsed PT model containing 357 places and 1128 transitions and 9454 arcs in 340 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA AutonomousCar-PT-08b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 357 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 357/357 places, 1128/1128 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 310 transition count 1081
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 310 transition count 1081
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 0 with 256 rules applied. Total rules applied 350 place count 310 transition count 825
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 359 place count 301 transition count 816
Iterating global reduction 1 with 9 rules applied. Total rules applied 368 place count 301 transition count 816
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 369 place count 300 transition count 815
Iterating global reduction 1 with 1 rules applied. Total rules applied 370 place count 300 transition count 815
Applied a total of 370 rules in 135 ms. Remains 300 /357 variables (removed 57) and now considering 815/1128 (removed 313) transitions.
// Phase 1: matrix 815 rows 300 cols
[2024-05-21 17:32:47] [INFO ] Computed 13 invariants in 34 ms
[2024-05-21 17:32:48] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-05-21 17:32:48] [INFO ] Invariant cache hit.
[2024-05-21 17:32:49] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1432 ms to find 0 implicit places.
[2024-05-21 17:32:49] [INFO ] Invariant cache hit.
[2024-05-21 17:32:49] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 300/357 places, 815/1128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2142 ms. Remains : 300/357 places, 815/1128 transitions.
Support contains 21 out of 300 places after structural reductions.
[2024-05-21 17:32:50] [INFO ] Flatten gal took : 207 ms
[2024-05-21 17:32:50] [INFO ] Flatten gal took : 120 ms
[2024-05-21 17:32:50] [INFO ] Input system was already deterministic with 815 transitions.
Incomplete random walk after 10000 steps, including 87 resets, run finished after 624 ms. (steps per millisecond=16 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 17:32:51] [INFO ] Invariant cache hit.
[2024-05-21 17:32:51] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 17:32:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-21 17:32:52] [INFO ] After 480ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 17:32:52] [INFO ] Deduced a trap composed of 41 places in 445 ms of which 15 ms to minimize.
[2024-05-21 17:32:53] [INFO ] Deduced a trap composed of 21 places in 525 ms of which 2 ms to minimize.
[2024-05-21 17:32:53] [INFO ] Deduced a trap composed of 45 places in 298 ms of which 1 ms to minimize.
[2024-05-21 17:32:53] [INFO ] Deduced a trap composed of 44 places in 255 ms of which 2 ms to minimize.
[2024-05-21 17:32:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1670 ms
[2024-05-21 17:32:54] [INFO ] Deduced a trap composed of 33 places in 419 ms of which 1 ms to minimize.
[2024-05-21 17:32:54] [INFO ] Deduced a trap composed of 31 places in 341 ms of which 1 ms to minimize.
[2024-05-21 17:32:55] [INFO ] Deduced a trap composed of 31 places in 288 ms of which 1 ms to minimize.
[2024-05-21 17:32:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1202 ms
[2024-05-21 17:32:55] [INFO ] After 3454ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 90 ms.
[2024-05-21 17:32:55] [INFO ] After 3744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 5 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 815/815 transitions.
Graph (trivial) has 280 edges and 300 vertex of which 4 / 300 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1329 edges and 298 vertex of which 296 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 113 rules applied. Total rules applied 115 place count 296 transition count 698
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 1 with 160 rules applied. Total rules applied 275 place count 185 transition count 649
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 304 place count 156 transition count 649
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 304 place count 156 transition count 643
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 316 place count 150 transition count 643
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 319 place count 147 transition count 640
Iterating global reduction 3 with 3 rules applied. Total rules applied 322 place count 147 transition count 640
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 323 place count 146 transition count 632
Iterating global reduction 3 with 1 rules applied. Total rules applied 324 place count 146 transition count 632
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 326 place count 146 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 327 place count 145 transition count 630
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 451 place count 83 transition count 568
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 452 place count 83 transition count 567
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 467 place count 68 transition count 446
Iterating global reduction 6 with 15 rules applied. Total rules applied 482 place count 68 transition count 446
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 488 place count 68 transition count 440
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 490 place count 67 transition count 439
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 499 place count 67 transition count 430
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 508 place count 58 transition count 430
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 509 place count 58 transition count 430
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 510 place count 57 transition count 429
Applied a total of 510 rules in 320 ms. Remains 57 /300 variables (removed 243) and now considering 429/815 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 320 ms. Remains : 57/300 places, 429/815 transitions.
Finished random walk after 95 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=31 )
Parikh walk visited 0 properties in 0 ms.
FORMULA AutonomousCar-PT-08b-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 49 stabilizing places and 50 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 815/815 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 293 transition count 808
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 293 transition count 808
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 291 transition count 806
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 291 transition count 806
Applied a total of 18 rules in 32 ms. Remains 291 /300 variables (removed 9) and now considering 806/815 (removed 9) transitions.
// Phase 1: matrix 806 rows 291 cols
[2024-05-21 17:32:55] [INFO ] Computed 13 invariants in 14 ms
[2024-05-21 17:32:56] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-21 17:32:56] [INFO ] Invariant cache hit.
[2024-05-21 17:32:56] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
[2024-05-21 17:32:56] [INFO ] Invariant cache hit.
[2024-05-21 17:32:57] [INFO ] Dead Transitions using invariants and state equation in 673 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 291/300 places, 806/815 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1642 ms. Remains : 291/300 places, 806/815 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 257 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s270 0) (EQ s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-08b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLCardinality-01 finished in 1975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (p1||G(p0)))))'
Support contains 3 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 815/815 transitions.
Graph (trivial) has 283 edges and 300 vertex of which 4 / 300 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 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 297 transition count 701
Reduce places removed 111 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 158 rules applied. Total rules applied 270 place count 186 transition count 654
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 298 place count 158 transition count 654
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 298 place count 158 transition count 648
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 310 place count 152 transition count 648
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 316 place count 146 transition count 642
Iterating global reduction 3 with 6 rules applied. Total rules applied 322 place count 146 transition count 642
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 322 place count 146 transition count 641
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 324 place count 145 transition count 641
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 325 place count 144 transition count 633
Iterating global reduction 3 with 1 rules applied. Total rules applied 326 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 3 with 2 rules applied. Total rules applied 328 place count 144 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 329 place count 143 transition count 631
Performed 60 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 5 with 120 rules applied. Total rules applied 449 place count 83 transition count 570
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 450 place count 83 transition count 569
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 465 place count 68 transition count 448
Iterating global reduction 6 with 15 rules applied. Total rules applied 480 place count 68 transition count 448
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 486 place count 68 transition count 442
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 490 place count 66 transition count 440
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 491 place count 66 transition count 440
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 493 place count 64 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 494 place count 63 transition count 438
Applied a total of 494 rules in 236 ms. Remains 63 /300 variables (removed 237) and now considering 438/815 (removed 377) transitions.
// Phase 1: matrix 438 rows 63 cols
[2024-05-21 17:32:58] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 17:32:58] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-21 17:32:58] [INFO ] Invariant cache hit.
[2024-05-21 17:32:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 17:32:58] [INFO ] Implicit Places using invariants and state equation in 493 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 690 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/300 places, 438/815 transitions.
Applied a total of 0 rules in 23 ms. Remains 62 /62 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 951 ms. Remains : 62/300 places, 438/815 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (NOT (OR (EQ s57 0) (EQ s11 1))) (NEQ s17 1)), p0:(NEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 154 reset in 520 ms.
Product exploration explored 100000 steps with 66 reset in 188 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/62 stabilizing places and 4/438 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 2 factoid took 322 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 354 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 438/438 transitions.
Applied a total of 0 rules in 20 ms. Remains 62 /62 variables (removed 0) and now considering 438/438 (removed 0) transitions.
// Phase 1: matrix 438 rows 62 cols
[2024-05-21 17:33:00] [INFO ] Computed 10 invariants in 5 ms
[2024-05-21 17:33:00] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-21 17:33:00] [INFO ] Invariant cache hit.
[2024-05-21 17:33:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 17:33:01] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
[2024-05-21 17:33:01] [INFO ] Redundant transitions in 47 ms returned [298]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 437 rows 62 cols
[2024-05-21 17:33:01] [INFO ] Computed 10 invariants in 4 ms
[2024-05-21 17:33:01] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/62 places, 437/438 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 21 ms. Remains 61 /62 variables (removed 1) and now considering 436/437 (removed 1) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1010 ms. Remains : 61/62 places, 436/438 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/61 stabilizing places and 2/436 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 202 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 223 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 121 reset in 104 ms.
Product exploration explored 100000 steps with 611 reset in 359 ms.
Built C files in :
/tmp/ltsmin2056413793481558082
[2024-05-21 17:33:02] [INFO ] Computing symmetric may disable matrix : 436 transitions.
[2024-05-21 17:33:02] [INFO ] Computation of Complete disable matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 17:33:02] [INFO ] Computing symmetric may enable matrix : 436 transitions.
[2024-05-21 17:33:02] [INFO ] Computation of Complete enable matrix. took 61 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 17:33:02] [INFO ] Computing Do-Not-Accords matrix : 436 transitions.
[2024-05-21 17:33:02] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 17:33:02] [INFO ] Built C files in 247ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2056413793481558082
Running compilation step : cd /tmp/ltsmin2056413793481558082;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2703 ms.
Running link step : cd /tmp/ltsmin2056413793481558082;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin2056413793481558082;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12523468306588255624.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 436/436 transitions.
Applied a total of 0 rules in 28 ms. Remains 61 /61 variables (removed 0) and now considering 436/436 (removed 0) transitions.
// Phase 1: matrix 436 rows 61 cols
[2024-05-21 17:33:17] [INFO ] Computed 10 invariants in 4 ms
[2024-05-21 17:33:17] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-21 17:33:17] [INFO ] Invariant cache hit.
[2024-05-21 17:33:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 17:33:18] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2024-05-21 17:33:18] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 17:33:18] [INFO ] Invariant cache hit.
[2024-05-21 17:33:18] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 917 ms. Remains : 61/61 places, 436/436 transitions.
Built C files in :
/tmp/ltsmin5729393468468099583
[2024-05-21 17:33:18] [INFO ] Computing symmetric may disable matrix : 436 transitions.
[2024-05-21 17:33:18] [INFO ] Computation of Complete disable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 17:33:18] [INFO ] Computing symmetric may enable matrix : 436 transitions.
[2024-05-21 17:33:18] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 17:33:18] [INFO ] Computing Do-Not-Accords matrix : 436 transitions.
[2024-05-21 17:33:18] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 17:33:18] [INFO ] Built C files in 123ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5729393468468099583
Running compilation step : cd /tmp/ltsmin5729393468468099583;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2580 ms.
Running link step : cd /tmp/ltsmin5729393468468099583;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin5729393468468099583;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1364388962805560686.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 17:33:33] [INFO ] Flatten gal took : 113 ms
[2024-05-21 17:33:34] [INFO ] Flatten gal took : 101 ms
[2024-05-21 17:33:34] [INFO ] Time to serialize gal into /tmp/LTL2092334725353944936.gal : 41 ms
[2024-05-21 17:33:34] [INFO ] Time to serialize properties into /tmp/LTL7973762157472495202.prop : 32 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2092334725353944936.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12737492890955849022.hoa' '-atoms' '/tmp/LTL7973762157472495202.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7973762157472495202.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12737492890955849022.hoa
Reverse transition relation is NOT exact ! Due to transitions t30, t68, t72, t94, t99, t121, t125, t147, t151, t173, t177, t202, t206, t228, t232, t255, t2...375
Computing Next relation with stutter on 165668 deadlock states
Detected timeout of ITS tools.
[2024-05-21 17:33:49] [INFO ] Flatten gal took : 83 ms
[2024-05-21 17:33:49] [INFO ] Flatten gal took : 67 ms
[2024-05-21 17:33:49] [INFO ] Time to serialize gal into /tmp/LTL8231944479836232987.gal : 8 ms
[2024-05-21 17:33:49] [INFO ] Time to serialize properties into /tmp/LTL4931092380887872365.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8231944479836232987.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4931092380887872365.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(("(p71!=1)")U((G("(p71!=1)"))||("((!((p325==0)||(p57==1)))&&(p71!=1))")))))
Formula 0 simplified : G(!"(p71!=1)" M !"((!((p325==0)||(p57==1)))&&(p71!=1))")
Reverse transition relation is NOT exact ! Due to transitions t30, t68, t72, t94, t99, t121, t125, t147, t151, t173, t177, t202, t206, t228, t232, t255, t2...375
Computing Next relation with stutter on 165668 deadlock states
Detected timeout of ITS tools.
[2024-05-21 17:34:04] [INFO ] Flatten gal took : 60 ms
[2024-05-21 17:34:04] [INFO ] Applying decomposition
[2024-05-21 17:34:04] [INFO ] Flatten gal took : 69 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14863923984787981407.txt' '-o' '/tmp/graph14863923984787981407.bin' '-w' '/tmp/graph14863923984787981407.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14863923984787981407.bin' '-l' '-1' '-v' '-w' '/tmp/graph14863923984787981407.weights' '-q' '0' '-e' '0.001'
[2024-05-21 17:34:05] [INFO ] Decomposing Gal with order
[2024-05-21 17:34:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 17:34:05] [INFO ] Removed a total of 2544 redundant transitions.
[2024-05-21 17:34:05] [INFO ] Flatten gal took : 168 ms
[2024-05-21 17:34:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 32 ms.
[2024-05-21 17:34:05] [INFO ] Time to serialize gal into /tmp/LTL14477459035584583390.gal : 9 ms
[2024-05-21 17:34:05] [INFO ] Time to serialize properties into /tmp/LTL10158858826701389341.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14477459035584583390.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10158858826701389341.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(("(u4.p71!=1)")U((G("(u4.p71!=1)"))||("((!((u18.p325==0)||(i1.u0.p57==1)))&&(u4.p71!=1))")))))
Formula 0 simplified : G(!"(u4.p71!=1)" M !"((!((u18.p325==0)||(i1.u0.p57==1)))&&(u4.p71!=1))")
Reverse transition relation is NOT exact ! Due to transitions t27_t812, t286_t22_t15_t16_t543_t281_t545_t282_t17_t18_t44_t45_t54_t55_t50_t51_t52, u4.t228, ...496
Computing Next relation with stutter on 165668 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8840798934580091476
[2024-05-21 17:34:20] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8840798934580091476
Running compilation step : cd /tmp/ltsmin8840798934580091476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1914 ms.
Running link step : cd /tmp/ltsmin8840798934580091476;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8840798934580091476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property AutonomousCar-PT-08b-LTLCardinality-02 finished in 97768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 815/815 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 294 transition count 809
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 294 transition count 809
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 292 transition count 807
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 292 transition count 807
Applied a total of 16 rules in 20 ms. Remains 292 /300 variables (removed 8) and now considering 807/815 (removed 8) transitions.
// Phase 1: matrix 807 rows 292 cols
[2024-05-21 17:34:35] [INFO ] Computed 13 invariants in 6 ms
[2024-05-21 17:34:35] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-21 17:34:35] [INFO ] Invariant cache hit.
[2024-05-21 17:34:36] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
[2024-05-21 17:34:36] [INFO ] Invariant cache hit.
[2024-05-21 17:34:37] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 292/300 places, 807/815 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1636 ms. Remains : 292/300 places, 807/815 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s4 0) (EQ s177 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 0 reset in 122 ms.
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-08b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLCardinality-05 finished in 1867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 815/815 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 294 transition count 809
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 294 transition count 809
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 292 transition count 807
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 292 transition count 807
Applied a total of 16 rules in 22 ms. Remains 292 /300 variables (removed 8) and now considering 807/815 (removed 8) transitions.
// Phase 1: matrix 807 rows 292 cols
[2024-05-21 17:34:37] [INFO ] Computed 13 invariants in 6 ms
[2024-05-21 17:34:37] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-21 17:34:37] [INFO ] Invariant cache hit.
[2024-05-21 17:34:38] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
[2024-05-21 17:34:38] [INFO ] Invariant cache hit.
[2024-05-21 17:34:39] [INFO ] Dead Transitions using invariants and state equation in 648 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 292/300 places, 807/815 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1579 ms. Remains : 292/300 places, 807/815 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s133 0) (EQ s204 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 387 ms.
Product exploration explored 100000 steps with 50000 reset in 353 ms.
Computed a total of 45 stabilizing places and 46 stable transitions
Computed a total of 45 stabilizing places and 46 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-08b-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08b-LTLCardinality-07 finished in 2468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0) U p1))))'
Support contains 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 815/815 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 294 transition count 809
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 294 transition count 809
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 292 transition count 807
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 292 transition count 807
Applied a total of 16 rules in 17 ms. Remains 292 /300 variables (removed 8) and now considering 807/815 (removed 8) transitions.
// Phase 1: matrix 807 rows 292 cols
[2024-05-21 17:34:39] [INFO ] Computed 13 invariants in 5 ms
[2024-05-21 17:34:40] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-21 17:34:40] [INFO ] Invariant cache hit.
[2024-05-21 17:34:40] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
[2024-05-21 17:34:40] [INFO ] Invariant cache hit.
[2024-05-21 17:34:41] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 292/300 places, 807/815 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1596 ms. Remains : 292/300 places, 807/815 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s123 0) (EQ s64 1)), p0:(AND (OR (EQ s188 0) (EQ s213 1)) (OR (EQ s123 0) (EQ s64 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 298 ms.
Product exploration explored 100000 steps with 33333 reset in 312 ms.
Computed a total of 45 stabilizing places and 46 stable transitions
Computed a total of 45 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-08b-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08b-LTLCardinality-09 finished in 2467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 815/815 transitions.
Graph (trivial) has 284 edges and 300 vertex of which 4 / 300 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 297 transition count 702
Reduce places removed 110 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 157 rules applied. Total rules applied 268 place count 187 transition count 655
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 296 place count 159 transition count 655
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 296 place count 159 transition count 648
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 310 place count 152 transition count 648
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 316 place count 146 transition count 642
Iterating global reduction 3 with 6 rules applied. Total rules applied 322 place count 146 transition count 642
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 322 place count 146 transition count 641
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 324 place count 145 transition count 641
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 325 place count 144 transition count 633
Iterating global reduction 3 with 1 rules applied. Total rules applied 326 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 3 with 2 rules applied. Total rules applied 328 place count 144 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 329 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 5 with 124 rules applied. Total rules applied 453 place count 81 transition count 568
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 454 place count 81 transition count 567
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 468 place count 67 transition count 454
Iterating global reduction 6 with 14 rules applied. Total rules applied 482 place count 67 transition count 454
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 487 place count 67 transition count 449
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 491 place count 65 transition count 447
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 493 place count 63 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 494 place count 62 transition count 445
Applied a total of 494 rules in 129 ms. Remains 62 /300 variables (removed 238) and now considering 445/815 (removed 370) transitions.
// Phase 1: matrix 445 rows 62 cols
[2024-05-21 17:34:42] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 17:34:42] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-21 17:34:42] [INFO ] Invariant cache hit.
[2024-05-21 17:34:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 17:34:43] [INFO ] Implicit Places using invariants and state equation in 321 ms returned [57, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 515 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/300 places, 445/815 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 444
Applied a total of 2 rules in 24 ms. Remains 59 /60 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 59 cols
[2024-05-21 17:34:43] [INFO ] Computed 9 invariants in 3 ms
[2024-05-21 17:34:43] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-21 17:34:43] [INFO ] Invariant cache hit.
[2024-05-21 17:34:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 17:34:43] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/300 places, 444/815 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1193 ms. Remains : 59/300 places, 444/815 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s41 0) (NEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-08b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-08b-LTLCardinality-11 finished in 1297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 815/815 transitions.
Graph (trivial) has 284 edges and 300 vertex of which 4 / 300 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 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 297 transition count 703
Reduce places removed 109 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 156 rules applied. Total rules applied 266 place count 188 transition count 656
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 294 place count 160 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 294 place count 160 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 310 place count 152 transition count 648
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 316 place count 146 transition count 642
Iterating global reduction 3 with 6 rules applied. Total rules applied 322 place count 146 transition count 642
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 322 place count 146 transition count 641
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 324 place count 145 transition count 641
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 326 place count 143 transition count 625
Iterating global reduction 3 with 2 rules applied. Total rules applied 328 place count 143 transition count 625
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 332 place count 143 transition count 621
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 334 place count 141 transition count 621
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 456 place count 80 transition count 559
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 457 place count 80 transition count 558
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 472 place count 65 transition count 437
Iterating global reduction 6 with 15 rules applied. Total rules applied 487 place count 65 transition count 437
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 493 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 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 497 place count 63 transition count 429
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 499 place count 61 transition count 427
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 500 place count 60 transition count 427
Applied a total of 500 rules in 122 ms. Remains 60 /300 variables (removed 240) and now considering 427/815 (removed 388) transitions.
// Phase 1: matrix 427 rows 60 cols
[2024-05-21 17:34:43] [INFO ] Computed 11 invariants in 2 ms
[2024-05-21 17:34:44] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-21 17:34:44] [INFO ] Invariant cache hit.
[2024-05-21 17:34:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 17:34:44] [INFO ] Implicit Places using invariants and state equation in 322 ms returned [55, 59]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 527 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/300 places, 427/815 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 22 ms. Remains 57 /58 variables (removed 1) and now considering 426/427 (removed 1) transitions.
// Phase 1: matrix 426 rows 57 cols
[2024-05-21 17:34:44] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 17:34:44] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-21 17:34:44] [INFO ] Invariant cache hit.
[2024-05-21 17:34:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 17:34:44] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/300 places, 426/815 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1166 ms. Remains : 57/300 places, 426/815 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-08b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 39983 reset in 141 ms.
Product exploration explored 100000 steps with 40019 reset in 156 ms.
Computed a total of 3 stabilizing places and 6 stable transitions
Computed a total of 3 stabilizing places and 6 stable transitions
Detected a total of 3/57 stabilizing places and 6/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 195 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
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 209 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-21 17:34:45] [INFO ] Invariant cache hit.
[2024-05-21 17:34:45] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-21 17:34:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 17:34:46] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2024-05-21 17:34:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 17:34:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-21 17:34:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 17:34:46] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2024-05-21 17:34:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 17:34:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-21 17:34:46] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2024-05-21 17:34:46] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 1 ms to minimize.
[2024-05-21 17:34:46] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 1 ms to minimize.
[2024-05-21 17:34:47] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 1 ms to minimize.
[2024-05-21 17:34:47] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 1 ms to minimize.
[2024-05-21 17:34:47] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 0 ms to minimize.
[2024-05-21 17:34:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1050 ms
[2024-05-21 17:34:47] [INFO ] Computed and/alt/rep : 7/16/7 causal constraints (skipped 417 transitions) in 112 ms.
[2024-05-21 17:34:47] [INFO ] Added : 0 causal constraints over 0 iterations in 147 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 17 ms. Remains 57 /57 variables (removed 0) and now considering 426/426 (removed 0) transitions.
[2024-05-21 17:34:47] [INFO ] Invariant cache hit.
[2024-05-21 17:34:47] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-21 17:34:47] [INFO ] Invariant cache hit.
[2024-05-21 17:34:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 17:34:48] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2024-05-21 17:34:48] [INFO ] Redundant transitions in 31 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
[2024-05-21 17:34:48] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 17:34:48] [INFO ] Dead Transitions using invariants and state equation in 243 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 21 ms. Remains 55 /57 variables (removed 2) and now considering 423/425 (removed 2) transitions.
// Phase 1: matrix 423 rows 55 cols
[2024-05-21 17:34:48] [INFO ] Computed 9 invariants in 3 ms
[2024-05-21 17:34:48] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-21 17:34:48] [INFO ] Invariant cache hit.
[2024-05-21 17:34:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 17:34:48] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 509 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 1352 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 (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-08b-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-08b-LTLCardinality-13 finished in 5306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (p1||G(p0)))))'
[2024-05-21 17:34:49] [INFO ] Flatten gal took : 70 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7828104298789924470
[2024-05-21 17:34:49] [INFO ] Computing symmetric may disable matrix : 815 transitions.
[2024-05-21 17:34:49] [INFO ] Applying decomposition
[2024-05-21 17:34:49] [INFO ] Computation of Complete disable matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 17:34:49] [INFO ] Computing symmetric may enable matrix : 815 transitions.
[2024-05-21 17:34:49] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 17:34:49] [INFO ] Flatten gal took : 63 ms
[2024-05-21 17:34:49] [INFO ] Computing Do-Not-Accords matrix : 815 transitions.
[2024-05-21 17:34:49] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 17:34:49] [INFO ] Built C files in 231ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7828104298789924470
Running compilation step : cd /tmp/ltsmin7828104298789924470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6810948718615935289.txt' '-o' '/tmp/graph6810948718615935289.bin' '-w' '/tmp/graph6810948718615935289.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6810948718615935289.bin' '-l' '-1' '-v' '-w' '/tmp/graph6810948718615935289.weights' '-q' '0' '-e' '0.001'
[2024-05-21 17:34:49] [INFO ] Decomposing Gal with order
[2024-05-21 17:34:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 17:34:49] [INFO ] Removed a total of 3040 redundant transitions.
[2024-05-21 17:34:50] [INFO ] Flatten gal took : 201 ms
[2024-05-21 17:34:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 38 ms.
[2024-05-21 17:34:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality14230891523711578620.gal : 18 ms
[2024-05-21 17:34:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality15072632855470269794.ltl : 69 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14230891523711578620.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15072632855470269794.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((F(("(i3.u24.p71!=1)")U(("((!((i0.i1.i1.u101.p325==0)||(i2.u14.p57==1)))&&(i3.u24.p71!=1))")||(G("(i3.u24.p71!=1)"))))))
Formula 0 simplified : G(!"(i3.u24.p71!=1)" M !"((!((i0.i1.i1.u101.p325==0)||(i2.u14.p57==1)))&&(i3.u24.p71!=1))")
Compilation finished in 4856 ms.
Running link step : cd /tmp/ltsmin7828104298789924470;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin7828104298789924470;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 17:55:31] [INFO ] Applying decomposition
[2024-05-21 17:55:31] [INFO ] Flatten gal took : 143 ms
[2024-05-21 17:55:32] [INFO ] Decomposing Gal with order
[2024-05-21 17:55:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 17:55:32] [INFO ] Removed a total of 3273 redundant transitions.
[2024-05-21 17:55:32] [INFO ] Flatten gal took : 325 ms
[2024-05-21 17:55:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 346 labels/synchronizations in 80 ms.
[2024-05-21 17:55:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality14023898195205207713.gal : 4 ms
[2024-05-21 17:55:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality11036926212087521765.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14023898195205207713.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11036926212087521765.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((F(("(i1.i0.i0.i0.i0.i0.i0.i0.i0.u14.p71!=1)")U(("((!((i1.i1.u23.p325==0)||(i1.i0.i0.i0.i0.i0.i0.i0.i0.u13.p57==1)))&&(i1.i0.i0.i0.i...235
Formula 0 simplified : G(!"(i1.i0.i0.i0.i0.i0.i0.i0.i0.u14.p71!=1)" M !"((!((i1.i1.u23.p325==0)||(i1.i0.i0.i0.i0.i0.i0.i0.i0.u13.p57==1)))&&(i1.i0.i0.i0.i0...182
Reverse transition relation is NOT exact ! Due to transitions t289, t489, t544, i0.u2.t284, i0.u2.t285, i0.u2.t286, i0.u3.t282, i1.t812, i1.i0.u21.t34, i1....1850
Computing Next relation with stutter on 1.76282e+06 deadlock states
Detected timeout of ITS tools.
[2024-05-21 18:16:13] [INFO ] Flatten gal took : 148 ms
[2024-05-21 18:16:13] [INFO ] Input system was already deterministic with 815 transitions.
[2024-05-21 18:16:13] [INFO ] Transformed 300 places.
[2024-05-21 18:16:13] [INFO ] Transformed 815 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 18:16:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality14715227622827196113.gal : 26 ms
[2024-05-21 18:16:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality18385152197296267179.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14715227622827196113.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18385152197296267179.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("(p71!=1)")U(("((!((p325==0)||(p57==1)))&&(p71!=1))")||(G("(p71!=1)"))))))
Formula 0 simplified : G(!"(p71!=1)" M !"((!((p325==0)||(p57==1)))&&(p71!=1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8204324 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16040352 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is 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 r043-smll-171620180300212"
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 ;