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.r009-oct2-167813598200635.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 ltsminxred
Input is AutonomousCar-PT-07b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598200635
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 12:57 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 334K 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-07b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-07b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678638798430

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:33:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 16:33:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:33:21] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2023-03-12 16:33:21] [INFO ] Transformed 323 places.
[2023-03-12 16:33:21] [INFO ] Transformed 846 transitions.
[2023-03-12 16:33:21] [INFO ] Found NUPN structural information;
[2023-03-12 16:33:21] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 346 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 4 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-07b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-07b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 846/846 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 281 transition count 804
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 281 transition count 804
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 280 place count 281 transition count 608
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 287 place count 274 transition count 601
Iterating global reduction 1 with 7 rules applied. Total rules applied 294 place count 274 transition count 601
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 295 place count 273 transition count 600
Iterating global reduction 1 with 1 rules applied. Total rules applied 296 place count 273 transition count 600
Applied a total of 296 rules in 119 ms. Remains 273 /323 variables (removed 50) and now considering 600/846 (removed 246) transitions.
// Phase 1: matrix 600 rows 273 cols
[2023-03-12 16:33:22] [INFO ] Computed 12 place invariants in 27 ms
[2023-03-12 16:33:22] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-12 16:33:22] [INFO ] Invariant cache hit.
[2023-03-12 16:33:23] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 1291 ms to find 0 implicit places.
[2023-03-12 16:33:23] [INFO ] Invariant cache hit.
[2023-03-12 16:33:23] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 273/323 places, 600/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1840 ms. Remains : 273/323 places, 600/846 transitions.
Support contains 18 out of 273 places after structural reductions.
[2023-03-12 16:33:24] [INFO ] Flatten gal took : 181 ms
[2023-03-12 16:33:24] [INFO ] Flatten gal took : 86 ms
[2023-03-12 16:33:24] [INFO ] Input system was already deterministic with 600 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 11) seen :9
Finished Best-First random walk after 1029 steps, including 1 resets, run visited all 2 properties in 3 ms. (steps per millisecond=343 )
Computed a total of 47 stabilizing places and 48 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((p0||G(p1))))'
Support contains 1 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 600/600 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 265 transition count 592
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 265 transition count 592
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 263 transition count 590
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 263 transition count 590
Applied a total of 20 rules in 47 ms. Remains 263 /273 variables (removed 10) and now considering 590/600 (removed 10) transitions.
// Phase 1: matrix 590 rows 263 cols
[2023-03-12 16:33:25] [INFO ] Computed 12 place invariants in 20 ms
[2023-03-12 16:33:25] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-12 16:33:25] [INFO ] Invariant cache hit.
[2023-03-12 16:33:26] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
[2023-03-12 16:33:26] [INFO ] Invariant cache hit.
[2023-03-12 16:33:27] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 263/273 places, 590/600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1513 ms. Remains : 263/273 places, 590/600 transitions.
Stuttering acceptance computed with spot in 292 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s229 0), p0:(EQ s229 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 60 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-00 finished in 1933 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(G((X(X(X(p1)))||p0))))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 600/600 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 267 transition count 594
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 267 transition count 594
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 265 transition count 592
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 265 transition count 592
Applied a total of 16 rules in 19 ms. Remains 265 /273 variables (removed 8) and now considering 592/600 (removed 8) transitions.
// Phase 1: matrix 592 rows 265 cols
[2023-03-12 16:33:27] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-12 16:33:27] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-12 16:33:27] [INFO ] Invariant cache hit.
[2023-03-12 16:33:28] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
[2023-03-12 16:33:28] [INFO ] Invariant cache hit.
[2023-03-12 16:33:28] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 265/273 places, 592/600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 976 ms. Remains : 265/273 places, 592/600 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s119 0) (EQ s252 1)), p1:(AND (EQ s255 0) (EQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 80 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-03 finished in 1263 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(X(X(X(G(p0))))))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 600/600 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 265 transition count 592
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 265 transition count 592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 264 transition count 591
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 264 transition count 591
Applied a total of 18 rules in 47 ms. Remains 264 /273 variables (removed 9) and now considering 591/600 (removed 9) transitions.
// Phase 1: matrix 591 rows 264 cols
[2023-03-12 16:33:28] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 16:33:29] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-12 16:33:29] [INFO ] Invariant cache hit.
[2023-03-12 16:33:29] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
[2023-03-12 16:33:29] [INFO ] Invariant cache hit.
[2023-03-12 16:33:29] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 264/273 places, 591/600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 978 ms. Remains : 264/273 places, 591/600 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (EQ s84 0) (EQ s128 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-07 finished in 1201 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(X(F(p0))))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 600/600 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 266 transition count 593
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 266 transition count 593
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 264 transition count 591
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 264 transition count 591
Applied a total of 18 rules in 10 ms. Remains 264 /273 variables (removed 9) and now considering 591/600 (removed 9) transitions.
// Phase 1: matrix 591 rows 264 cols
[2023-03-12 16:33:29] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-12 16:33:30] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-12 16:33:30] [INFO ] Invariant cache hit.
[2023-03-12 16:33:30] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2023-03-12 16:33:30] [INFO ] Invariant cache hit.
[2023-03-12 16:33:31] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 264/273 places, 591/600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1183 ms. Remains : 264/273 places, 591/600 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s58 0) (NEQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1739 reset in 287 ms.
Product exploration explored 100000 steps with 1735 reset in 309 ms.
Computed a total of 43 stabilizing places and 44 stable transitions
Computed a total of 43 stabilizing places and 44 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 248 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 57 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-12 16:33:32] [INFO ] Invariant cache hit.
[2023-03-12 16:33:33] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-12 16:33:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:33:33] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2023-03-12 16:33:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:33:33] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-12 16:33:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:33:34] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2023-03-12 16:33:34] [INFO ] Computed and/alt/rep : 233/462/233 causal constraints (skipped 357 transitions) in 178 ms.
[2023-03-12 16:33:35] [INFO ] Added : 175 causal constraints over 35 iterations in 1759 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 591/591 transitions.
Applied a total of 0 rules in 6 ms. Remains 264 /264 variables (removed 0) and now considering 591/591 (removed 0) transitions.
[2023-03-12 16:33:35] [INFO ] Invariant cache hit.
[2023-03-12 16:33:36] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-12 16:33:36] [INFO ] Invariant cache hit.
[2023-03-12 16:33:36] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
[2023-03-12 16:33:36] [INFO ] Invariant cache hit.
[2023-03-12 16:33:37] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1252 ms. Remains : 264/264 places, 591/591 transitions.
Computed a total of 43 stabilizing places and 44 stable transitions
Computed a total of 43 stabilizing places and 44 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 58 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=19 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-12 16:33:37] [INFO ] Invariant cache hit.
[2023-03-12 16:33:38] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 16:33:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:33:38] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2023-03-12 16:33:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:33:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 16:33:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:33:38] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2023-03-12 16:33:38] [INFO ] Computed and/alt/rep : 233/462/233 causal constraints (skipped 357 transitions) in 57 ms.
[2023-03-12 16:33:40] [INFO ] Added : 175 causal constraints over 35 iterations in 1648 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1736 reset in 189 ms.
Product exploration explored 100000 steps with 1740 reset in 136 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 591/591 transitions.
Graph (trivial) has 247 edges and 264 vertex of which 4 / 264 are part of one of the 2 SCC in 9 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 95 rules applied. Total rules applied 96 place count 262 transition count 589
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 113 place count 262 transition count 572
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 113 place count 262 transition count 572
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 132 place count 262 transition count 572
Discarding 81 places :
Symmetric choice reduction at 2 with 81 rule applications. Total rules 213 place count 181 transition count 491
Deduced a syphon composed of 34 places in 1 ms
Iterating global reduction 2 with 81 rules applied. Total rules applied 294 place count 181 transition count 491
Performed 73 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 107 places in 1 ms
Iterating global reduction 2 with 73 rules applied. Total rules applied 367 place count 181 transition count 501
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 369 place count 181 transition count 499
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 431 place count 119 transition count 346
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 3 with 62 rules applied. Total rules applied 493 place count 119 transition count 346
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 507 place count 119 transition count 332
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 515 place count 111 transition count 324
Deduced a syphon composed of 52 places in 1 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 523 place count 111 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 524 place count 111 transition count 324
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 526 place count 109 transition count 322
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 528 place count 109 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 52 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 529 place count 109 transition count 324
Deduced a syphon composed of 52 places in 0 ms
Applied a total of 529 rules in 139 ms. Remains 109 /264 variables (removed 155) and now considering 324/591 (removed 267) transitions.
[2023-03-12 16:33:41] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 324 rows 109 cols
[2023-03-12 16:33:41] [INFO ] Computed 11 place invariants in 9 ms
[2023-03-12 16:33:41] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/264 places, 324/591 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 416 ms. Remains : 109/264 places, 324/591 transitions.
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 591/591 transitions.
Applied a total of 0 rules in 5 ms. Remains 264 /264 variables (removed 0) and now considering 591/591 (removed 0) transitions.
// Phase 1: matrix 591 rows 264 cols
[2023-03-12 16:33:41] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-12 16:33:41] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-12 16:33:41] [INFO ] Invariant cache hit.
[2023-03-12 16:33:42] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
[2023-03-12 16:33:42] [INFO ] Invariant cache hit.
[2023-03-12 16:33:42] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 975 ms. Remains : 264/264 places, 591/591 transitions.
Treatment of property AutonomousCar-PT-07b-LTLCardinality-08 finished in 12853 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 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 600/600 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 267 transition count 594
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 267 transition count 594
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 266 transition count 593
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 266 transition count 593
Applied a total of 14 rules in 12 ms. Remains 266 /273 variables (removed 7) and now considering 593/600 (removed 7) transitions.
// Phase 1: matrix 593 rows 266 cols
[2023-03-12 16:33:42] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 16:33:43] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-12 16:33:43] [INFO ] Invariant cache hit.
[2023-03-12 16:33:43] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2023-03-12 16:33:43] [INFO ] Invariant cache hit.
[2023-03-12 16:33:43] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 266/273 places, 593/600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 929 ms. Remains : 266/273 places, 593/600 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s118 0) (NEQ s109 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLCardinality-11 finished in 1040 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' '!(G((F(!(p0 U p1))||!(G(p0) U G(p2))||X(p3))))'
Support contains 7 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 600/600 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 268 transition count 595
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 268 transition count 595
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 267 transition count 594
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 267 transition count 594
Applied a total of 12 rules in 22 ms. Remains 267 /273 variables (removed 6) and now considering 594/600 (removed 6) transitions.
// Phase 1: matrix 594 rows 267 cols
[2023-03-12 16:33:43] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-12 16:33:44] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-12 16:33:44] [INFO ] Invariant cache hit.
[2023-03-12 16:33:44] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2023-03-12 16:33:44] [INFO ] Invariant cache hit.
[2023-03-12 16:33:44] [INFO ] Dead Transitions using invariants and state equation in 320 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/273 places, 594/600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 925 ms. Remains : 267/273 places, 594/600 transitions.
Stuttering acceptance computed with spot in 382 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3))), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2 p1 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p3), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2 p1 p3), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p2 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s27 0) (EQ s182 1)), p2:(OR (EQ s51 0) (EQ s31 1)), p1:(EQ s122 1), p3:(AND (EQ s85 0) (EQ s99 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11564 reset in 253 ms.
Product exploration explored 100000 steps with 11481 reset in 214 ms.
Computed a total of 44 stabilizing places and 45 stable transitions
Computed a total of 44 stabilizing places and 45 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3)))), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X (AND p0 (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 p1 p3)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 608 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Incomplete random walk after 10000 steps, including 68 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:33:46] [INFO ] Invariant cache hit.
[2023-03-12 16:33:46] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-03-12 16:33:46] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:33:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-12 16:33:47] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:33:47] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 5 ms to minimize.
[2023-03-12 16:33:47] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 1 ms to minimize.
[2023-03-12 16:33:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 592 ms
[2023-03-12 16:33:47] [INFO ] After 939ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-12 16:33:47] [INFO ] After 1075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 594/594 transitions.
Graph (trivial) has 241 edges and 267 vertex of which 4 / 267 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1086 edges and 265 vertex of which 263 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 91 rules applied. Total rules applied 93 place count 263 transition count 499
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 129 rules applied. Total rules applied 222 place count 174 transition count 459
Reduce places removed 23 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 26 rules applied. Total rules applied 248 place count 151 transition count 456
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 253 place count 148 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 254 place count 147 transition count 454
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 254 place count 147 transition count 445
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 272 place count 138 transition count 445
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 5 with 112 rules applied. Total rules applied 384 place count 82 transition count 389
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 385 place count 82 transition count 388
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 398 place count 69 transition count 298
Iterating global reduction 6 with 13 rules applied. Total rules applied 411 place count 69 transition count 298
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 416 place count 69 transition count 293
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 418 place count 68 transition count 292
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 427 place count 68 transition count 283
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 436 place count 59 transition count 283
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 438 place count 59 transition count 281
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 439 place count 59 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 440 place count 58 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 441 place count 57 transition count 280
Applied a total of 441 rules in 101 ms. Remains 57 /267 variables (removed 210) and now considering 280/594 (removed 314) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 57/267 places, 280/594 transitions.
Finished random walk after 2154 steps, including 35 resets, run visited all 1 properties in 7 ms. (steps per millisecond=307 )
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3)))), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X (AND p0 (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 p1 p3)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 p2 (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p1 p2 (NOT p3))), (F (NOT (AND p0 (NOT p3)))), (F (AND p1 p2)), (F (NOT (AND p0 (NOT p1) p2))), (F (NOT (OR (AND p0 p2) (AND p1 p2)))), (F (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (F (NOT p0)), (F (AND p0 p1 p2 p3)), (F (AND p0 p3)), (F (AND p0 p1 p2))]
Knowledge based reduction with 9 factoid took 806 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 324 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Applied a total of 0 rules in 5 ms. Remains 267 /267 variables (removed 0) and now considering 594/594 (removed 0) transitions.
[2023-03-12 16:33:49] [INFO ] Invariant cache hit.
[2023-03-12 16:33:49] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-12 16:33:49] [INFO ] Invariant cache hit.
[2023-03-12 16:33:50] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2023-03-12 16:33:50] [INFO ] Invariant cache hit.
[2023-03-12 16:33:50] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 985 ms. Remains : 267/267 places, 594/594 transitions.
Computed a total of 44 stabilizing places and 45 stable transitions
Computed a total of 44 stabilizing places and 45 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))), (X (AND p0 (NOT p3))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 452 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Finished random walk after 2593 steps, including 25 resets, run visited all 10 properties in 58 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))), (X (AND p0 (NOT p3))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p3) p1 p2)), (F (NOT (AND p0 (NOT p3)))), (F (AND p1 p2)), (F (NOT (AND p0 (NOT p1) p2))), (F (NOT (OR (AND p0 p2) (AND p1 p2)))), (F (NOT (OR (AND p0 (NOT p3) p2) (AND (NOT p3) p1 p2)))), (F (NOT p0)), (F (AND p0 p3 p1 p2)), (F (AND p0 p3)), (F (AND p0 p1 p2))]
Knowledge based reduction with 9 factoid took 822 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 370 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 297 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 313 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Product exploration explored 100000 steps with 11654 reset in 135 ms.
Product exploration explored 100000 steps with 11618 reset in 134 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 328 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Graph (trivial) has 241 edges and 267 vertex of which 4 / 267 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.
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 91 rules applied. Total rules applied 92 place count 265 transition count 592
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 109 place count 265 transition count 575
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 109 place count 265 transition count 575
Deduced a syphon composed of 110 places in 1 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 128 place count 265 transition count 575
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 200 place count 193 transition count 503
Deduced a syphon composed of 39 places in 1 ms
Iterating global reduction 2 with 72 rules applied. Total rules applied 272 place count 193 transition count 503
Performed 70 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 342 place count 193 transition count 513
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 344 place count 193 transition count 511
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 403 place count 134 transition count 375
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 3 with 59 rules applied. Total rules applied 462 place count 134 transition count 375
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 472 place count 134 transition count 365
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 478 place count 128 transition count 359
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 484 place count 128 transition count 359
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 485 place count 128 transition count 359
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 487 place count 126 transition count 357
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 489 place count 126 transition count 357
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 490 place count 126 transition count 359
Deduced a syphon composed of 57 places in 0 ms
Applied a total of 490 rules in 96 ms. Remains 126 /267 variables (removed 141) and now considering 359/594 (removed 235) transitions.
[2023-03-12 16:33:53] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 359 rows 126 cols
[2023-03-12 16:33:53] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-12 16:33:54] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/267 places, 359/594 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 577 ms. Remains : 126/267 places, 359/594 transitions.
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Applied a total of 0 rules in 3 ms. Remains 267 /267 variables (removed 0) and now considering 594/594 (removed 0) transitions.
// Phase 1: matrix 594 rows 267 cols
[2023-03-12 16:33:54] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-12 16:33:54] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-12 16:33:54] [INFO ] Invariant cache hit.
[2023-03-12 16:33:54] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2023-03-12 16:33:54] [INFO ] Invariant cache hit.
[2023-03-12 16:33:55] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 820 ms. Remains : 267/267 places, 594/594 transitions.
Treatment of property AutonomousCar-PT-07b-LTLCardinality-13 finished in 11437 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(X(F(p0))))'
Found a Shortening insensitive property : AutonomousCar-PT-07b-LTLCardinality-08
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 273/273 places, 600/600 transitions.
Graph (trivial) has 256 edges and 273 vertex of which 4 / 273 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 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 270 transition count 495
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 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 144 rules applied. Total rules applied 247 place count 168 transition count 453
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 272 place count 143 transition count 453
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 272 place count 143 transition count 446
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 286 place count 136 transition count 446
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 291 place count 131 transition count 441
Iterating global reduction 3 with 5 rules applied. Total rules applied 296 place count 131 transition count 441
Performed 56 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 408 place count 75 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 409 place count 75 transition count 383
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 424 place count 60 transition count 277
Iterating global reduction 4 with 15 rules applied. Total rules applied 439 place count 60 transition count 277
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 446 place count 60 transition count 270
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 450 place count 58 transition count 268
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 452 place count 56 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 453 place count 55 transition count 266
Applied a total of 453 rules in 47 ms. Remains 55 /273 variables (removed 218) and now considering 266/600 (removed 334) transitions.
// Phase 1: matrix 266 rows 55 cols
[2023-03-12 16:33:55] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-12 16:33:55] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-12 16:33:55] [INFO ] Invariant cache hit.
[2023-03-12 16:33:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:33:55] [INFO ] Implicit Places using invariants and state equation in 162 ms returned [50, 54]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 289 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 53/273 places, 266/600 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 52 transition count 265
Applied a total of 2 rules in 25 ms. Remains 52 /53 variables (removed 1) and now considering 265/266 (removed 1) transitions.
// Phase 1: matrix 265 rows 52 cols
[2023-03-12 16:33:55] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:33:55] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-12 16:33:55] [INFO ] Invariant cache hit.
[2023-03-12 16:33:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:33:56] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 52/273 places, 265/600 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 762 ms. Remains : 52/273 places, 265/600 transitions.
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s14 0) (NEQ s15 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, null][false, false, false]]
Product exploration explored 100000 steps with 20515 reset in 166 ms.
Product exploration explored 100000 steps with 20498 reset in 118 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-12 16:33:57] [INFO ] Invariant cache hit.
[2023-03-12 16:33:57] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 16:33:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:33:57] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-12 16:33:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:33:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 16:33:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:33:57] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-12 16:33:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:33:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-12 16:33:57] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 15 ms to minimize.
[2023-03-12 16:33:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-12 16:33:58] [INFO ] Computed and/alt/rep : 9/25/9 causal constraints (skipped 254 transitions) in 43 ms.
[2023-03-12 16:33:58] [INFO ] Added : 4 causal constraints over 2 iterations in 124 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 265/265 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2023-03-12 16:33:58] [INFO ] Invariant cache hit.
[2023-03-12 16:33:58] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-12 16:33:58] [INFO ] Invariant cache hit.
[2023-03-12 16:33:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:33:58] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2023-03-12 16:33:58] [INFO ] Invariant cache hit.
[2023-03-12 16:33:58] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 483 ms. Remains : 52/52 places, 265/265 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-12 16:33:59] [INFO ] Invariant cache hit.
[2023-03-12 16:33:59] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 16:33:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:33:59] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-12 16:33:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:33:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 16:33:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:33:59] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-12 16:33:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:33:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-12 16:33:59] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 13 ms to minimize.
[2023-03-12 16:33:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-12 16:33:59] [INFO ] Computed and/alt/rep : 9/25/9 causal constraints (skipped 254 transitions) in 17 ms.
[2023-03-12 16:33:59] [INFO ] Added : 4 causal constraints over 2 iterations in 57 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20506 reset in 113 ms.
Product exploration explored 100000 steps with 20523 reset in 117 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 265/265 transitions.
Applied a total of 0 rules in 7 ms. Remains 52 /52 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2023-03-12 16:34:00] [INFO ] Redundant transitions in 17 ms returned [164]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 264 rows 52 cols
[2023-03-12 16:34:00] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-12 16:34:00] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/52 places, 264/265 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 52 transition count 266
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 9 ms. Remains 52 /52 variables (removed 0) and now considering 266/264 (removed -2) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/52 places, 266/265 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 187 ms. Remains : 52/52 places, 266/265 transitions.
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 265/265 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 265/265 (removed 0) transitions.
// Phase 1: matrix 265 rows 52 cols
[2023-03-12 16:34:00] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-12 16:34:00] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-12 16:34:00] [INFO ] Invariant cache hit.
[2023-03-12 16:34:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:34:00] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2023-03-12 16:34:00] [INFO ] Invariant cache hit.
[2023-03-12 16:34:01] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 411 ms. Remains : 52/52 places, 265/265 transitions.
Treatment of property AutonomousCar-PT-07b-LTLCardinality-08 finished in 5836 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' '!(G((F(!(p0 U p1))||!(G(p0) U G(p2))||X(p3))))'
Found a Lengthening insensitive property : AutonomousCar-PT-07b-LTLCardinality-13
Stuttering acceptance computed with spot in 313 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Support contains 7 out of 273 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 273/273 places, 600/600 transitions.
Graph (trivial) has 246 edges and 273 vertex of which 4 / 273 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 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 270 transition count 505
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 129 rules applied. Total rules applied 222 place count 178 transition count 468
Reduce places removed 22 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 26 rules applied. Total rules applied 248 place count 156 transition count 464
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 254 place count 152 transition count 462
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 255 place count 151 transition count 462
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 255 place count 151 transition count 453
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 273 place count 142 transition count 453
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 277 place count 138 transition count 449
Iterating global reduction 5 with 4 rules applied. Total rules applied 281 place count 138 transition count 449
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 282 place count 138 transition count 448
Performed 53 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 6 with 106 rules applied. Total rules applied 388 place count 85 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 389 place count 85 transition count 393
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 402 place count 72 transition count 303
Iterating global reduction 7 with 13 rules applied. Total rules applied 415 place count 72 transition count 303
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 420 place count 72 transition count 298
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 424 place count 70 transition count 296
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 426 place count 68 transition count 294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 427 place count 67 transition count 294
Applied a total of 427 rules in 61 ms. Remains 67 /273 variables (removed 206) and now considering 294/600 (removed 306) transitions.
// Phase 1: matrix 294 rows 67 cols
[2023-03-12 16:34:01] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-12 16:34:01] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-12 16:34:01] [INFO ] Invariant cache hit.
[2023-03-12 16:34:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:34:02] [INFO ] Implicit Places using invariants and state equation in 275 ms returned [62, 66]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 463 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 65/273 places, 294/600 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 64 transition count 293
Applied a total of 2 rules in 9 ms. Remains 64 /65 variables (removed 1) and now considering 293/294 (removed 1) transitions.
// Phase 1: matrix 293 rows 64 cols
[2023-03-12 16:34:02] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-12 16:34:02] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-12 16:34:02] [INFO ] Invariant cache hit.
[2023-03-12 16:34:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:34:02] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 64/273 places, 293/600 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1006 ms. Remains : 64/273 places, 293/600 transitions.
Running random walk in product with property : AutonomousCar-PT-07b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3))), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2 p1 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p3), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2 p1 p3), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p2 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s9 0) (EQ s49 1)), p2:(OR (EQ s13 0) (EQ s11 1)), p1:(EQ s34 1), p3:(AND (EQ s25 0) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1378 reset in 120 ms.
Product exploration explored 100000 steps with 2810 reset in 103 ms.
Computed a total of 7 stabilizing places and 8 stable transitions
Computed a total of 7 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 p1 p3)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2 p1))))]
False Knowledge obtained : [(X (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3))))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 592 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Finished random walk after 142 steps, including 5 resets, run visited all 10 properties in 4 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X (NOT (AND p0 p2 p1 (NOT p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 p1 p3)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2 p1))))]
False Knowledge obtained : [(X (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3))))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (F (AND p0 p1 p2 (NOT p3))), (F (NOT (AND p0 (NOT p3)))), (F (AND p1 p2)), (F (NOT (AND p0 (NOT p1) p2))), (F (NOT (OR (AND p0 p2) (AND p1 p2)))), (F (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (F (NOT p0)), (F (AND p0 p1 p2 p3)), (F (AND p0 p3)), (F (AND p0 p1 p2))]
Knowledge based reduction with 6 factoid took 887 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 372 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Support contains 7 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 293/293 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-12 16:34:05] [INFO ] Invariant cache hit.
[2023-03-12 16:34:05] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-12 16:34:05] [INFO ] Invariant cache hit.
[2023-03-12 16:34:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:34:05] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2023-03-12 16:34:05] [INFO ] Invariant cache hit.
[2023-03-12 16:34:06] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 791 ms. Remains : 64/64 places, 293/293 transitions.
Computed a total of 7 stabilizing places and 8 stable transitions
Computed a total of 7 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
Knowledge based reduction with 6 factoid took 582 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 378 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Finished random walk after 360 steps, including 17 resets, run visited all 10 properties in 25 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (AND p0 (NOT p3) p1 p2)), (F (NOT (AND p0 (NOT p3)))), (F (AND p1 p2)), (F (NOT (AND p0 (NOT p1) p2))), (F (NOT (OR (AND p0 p2) (AND p1 p2)))), (F (NOT (OR (AND p0 (NOT p3) p2) (AND (NOT p3) p1 p2)))), (F (NOT p0)), (F (AND p0 p3 p1 p2)), (F (AND p0 p3)), (F (AND p0 p1 p2))]
Knowledge based reduction with 6 factoid took 765 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 358 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 320 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Product exploration explored 100000 steps with 13723 reset in 177 ms.
Product exploration explored 100000 steps with 10428 reset in 154 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 343 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p0 (NOT p3) p2 p1), (AND p1 p2), (AND p0 p3 p2 p1), (AND p0 p2 p1)]
Support contains 7 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 293/293 transitions.
Applied a total of 0 rules in 10 ms. Remains 64 /64 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-12 16:34:09] [INFO ] Redundant transitions in 24 ms returned [178]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 292 rows 64 cols
[2023-03-12 16:34:09] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-12 16:34:09] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/64 places, 292/293 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 64 transition count 294
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 8 ms. Remains 64 /64 variables (removed 0) and now considering 294/292 (removed -2) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/64 places, 294/293 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 231 ms. Remains : 64/64 places, 294/293 transitions.
Support contains 7 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 293/293 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 293/293 (removed 0) transitions.
// Phase 1: matrix 293 rows 64 cols
[2023-03-12 16:34:09] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:34:10] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-12 16:34:10] [INFO ] Invariant cache hit.
[2023-03-12 16:34:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:34:10] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2023-03-12 16:34:10] [INFO ] Invariant cache hit.
[2023-03-12 16:34:10] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 600 ms. Remains : 64/64 places, 293/293 transitions.
Treatment of property AutonomousCar-PT-07b-LTLCardinality-13 finished in 9397 ms.
[2023-03-12 16:34:10] [INFO ] Flatten gal took : 41 ms
[2023-03-12 16:34:10] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 16:34:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 273 places, 600 transitions and 4197 arcs took 7 ms.
Total runtime 49093 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1903/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1903/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutonomousCar-PT-07b-LTLCardinality-08
Could not compute solution for formula : AutonomousCar-PT-07b-LTLCardinality-13

BK_STOP 1678638851309

--------------------
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
mcc2023
ltl formula name AutonomousCar-PT-07b-LTLCardinality-08
ltl formula formula --ltl=/tmp/1903/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 273 places, 600 transitions and 4197 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.050 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1903/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1903/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1903/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1903/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name AutonomousCar-PT-07b-LTLCardinality-13
ltl formula formula --ltl=/tmp/1903/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 273 places, 600 transitions and 4197 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.070 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1903/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1903/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1903/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1903/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-07b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutonomousCar-PT-07b, 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 r009-oct2-167813598200635"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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