Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 12 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 72K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717210950319

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-04a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 03:02:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 03:02:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 03:02:32] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2024-06-01 03:02:32] [INFO ] Transformed 49 places.
[2024-06-01 03:02:32] [INFO ] Transformed 193 transitions.
[2024-06-01 03:02:32] [INFO ] Found NUPN structural information;
[2024-06-01 03:02:32] [INFO ] Parsed PT model containing 49 places and 193 transitions and 1306 arcs in 442 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 108 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 75 transitions
Reduce redundant transitions removed 75 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-04a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 118/118 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 47 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 47 transition count 112
Applied a total of 4 rules in 41 ms. Remains 47 /49 variables (removed 2) and now considering 112/118 (removed 6) transitions.
// Phase 1: matrix 112 rows 47 cols
[2024-06-01 03:02:33] [INFO ] Computed 8 invariants in 14 ms
[2024-06-01 03:02:33] [INFO ] Implicit Places using invariants in 512 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 572 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/49 places, 112/118 transitions.
Applied a total of 0 rules in 4 ms. Remains 46 /46 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 650 ms. Remains : 46/49 places, 112/118 transitions.
Support contains 25 out of 46 places after structural reductions.
[2024-06-01 03:02:34] [INFO ] Flatten gal took : 86 ms
[2024-06-01 03:02:34] [INFO ] Flatten gal took : 37 ms
[2024-06-01 03:02:34] [INFO ] Input system was already deterministic with 112 transitions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 2110 steps (125 resets) in 488 ms. (4 steps per ms) remains 0/17 properties
Computed a total of 2 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(F(p0)) U (p1&&F(!p0))))))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 112/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 44 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 44 transition count 102
Applied a total of 4 rules in 8 ms. Remains 44 /46 variables (removed 2) and now considering 102/112 (removed 10) transitions.
// Phase 1: matrix 102 rows 44 cols
[2024-06-01 03:02:35] [INFO ] Computed 7 invariants in 5 ms
[2024-06-01 03:02:35] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-01 03:02:35] [INFO ] Invariant cache hit.
[2024-06-01 03:02:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:02:35] [INFO ] Implicit Places using invariants and state equation in 198 ms returned [40, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 307 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/46 places, 102/112 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 319 ms. Remains : 42/46 places, 102/112 transitions.
Stuttering acceptance computed with spot in 595 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p0), (NOT p0), (OR (NOT p1) p0), p0]
Running random walk in product with property : AutonomousCar-PT-04a-LTLCardinality-02
Stuttering criterion allowed to conclude after 2005 steps with 183 reset in 64 ms.
FORMULA AutonomousCar-PT-04a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLCardinality-02 finished in 1097 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&((p1 U p2)||X((F(p0) U p3)))))'
Support contains 8 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 112/112 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 107
Applied a total of 2 rules in 5 ms. Remains 45 /46 variables (removed 1) and now considering 107/112 (removed 5) transitions.
// Phase 1: matrix 107 rows 45 cols
[2024-06-01 03:02:36] [INFO ] Computed 7 invariants in 4 ms
[2024-06-01 03:02:36] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-01 03:02:36] [INFO ] Invariant cache hit.
[2024-06-01 03:02:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:02:36] [INFO ] Implicit Places using invariants and state equation in 192 ms returned [41, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 296 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 107/112 transitions.
Applied a total of 0 rules in 6 ms. Remains 43 /43 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 307 ms. Remains : 43/46 places, 107/112 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p0), true, (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p3)), (OR (NOT p0) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 25 steps with 1 reset in 1 ms.
FORMULA AutonomousCar-PT-04a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLCardinality-03 finished in 636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 112/112 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 43 transition count 97
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 97
Applied a total of 6 rules in 5 ms. Remains 43 /46 variables (removed 3) and now considering 97/112 (removed 15) transitions.
// Phase 1: matrix 97 rows 43 cols
[2024-06-01 03:02:36] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 03:02:36] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 03:02:36] [INFO ] Invariant cache hit.
[2024-06-01 03:02:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:02:36] [INFO ] Implicit Places using invariants and state equation in 174 ms returned [39, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 306 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 41/46 places, 97/112 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 313 ms. Remains : 41/46 places, 97/112 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLCardinality-04
Product exploration explored 100000 steps with 33333 reset in 814 ms.
Product exploration explored 100000 steps with 33333 reset in 627 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 24 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-04a-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-04a-LTLCardinality-04 finished in 1989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)||G(F(p2))||p0)))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 112/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 44 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 44 transition count 102
Applied a total of 4 rules in 4 ms. Remains 44 /46 variables (removed 2) and now considering 102/112 (removed 10) transitions.
// Phase 1: matrix 102 rows 44 cols
[2024-06-01 03:02:38] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 03:02:38] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 03:02:38] [INFO ] Invariant cache hit.
[2024-06-01 03:02:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:02:38] [INFO ] Implicit Places using invariants and state equation in 129 ms returned [40, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 208 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/46 places, 102/112 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 214 ms. Remains : 42/46 places, 102/112 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 228 ms.
Product exploration explored 100000 steps with 50000 reset in 372 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 49 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-04a-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-04a-LTLCardinality-06 finished in 1061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 112/112 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 43 transition count 97
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 97
Applied a total of 6 rules in 4 ms. Remains 43 /46 variables (removed 3) and now considering 97/112 (removed 15) transitions.
// Phase 1: matrix 97 rows 43 cols
[2024-06-01 03:02:39] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 03:02:39] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-01 03:02:39] [INFO ] Invariant cache hit.
[2024-06-01 03:02:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:02:39] [INFO ] Implicit Places using invariants and state equation in 140 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 267 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/46 places, 97/112 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 274 ms. Remains : 42/46 places, 97/112 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 80 steps with 2 reset in 1 ms.
FORMULA AutonomousCar-PT-04a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLCardinality-08 finished in 482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 112/112 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 46 transition count 109
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 43 transition count 109
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 9 place count 40 transition count 94
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 40 transition count 94
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 2 with 4 rules applied. Total rules applied 16 place count 38 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 37 transition count 92
Applied a total of 18 rules in 49 ms. Remains 37 /46 variables (removed 9) and now considering 92/112 (removed 20) transitions.
// Phase 1: matrix 92 rows 37 cols
[2024-06-01 03:02:40] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 03:02:40] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 03:02:40] [INFO ] Invariant cache hit.
[2024-06-01 03:02:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:02:40] [INFO ] Implicit Places using invariants and state equation in 140 ms returned [33, 35]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 229 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/46 places, 92/112 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 35 transition count 91
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 34 transition count 91
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 4 place count 33 transition count 90
Applied a total of 4 rules in 27 ms. Remains 33 /35 variables (removed 2) and now considering 90/92 (removed 2) transitions.
// Phase 1: matrix 90 rows 33 cols
[2024-06-01 03:02:40] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 03:02:40] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 03:02:40] [INFO ] Invariant cache hit.
[2024-06-01 03:02:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 03:02:40] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/46 places, 90/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 525 ms. Remains : 33/46 places, 90/112 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLCardinality-10
Stuttering criterion allowed to conclude after 201 steps with 31 reset in 2 ms.
FORMULA AutonomousCar-PT-04a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLCardinality-10 finished in 745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 112/112 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 43 transition count 97
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 97
Applied a total of 6 rules in 5 ms. Remains 43 /46 variables (removed 3) and now considering 97/112 (removed 15) transitions.
// Phase 1: matrix 97 rows 43 cols
[2024-06-01 03:02:40] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 03:02:41] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-01 03:02:41] [INFO ] Invariant cache hit.
[2024-06-01 03:02:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:02:41] [INFO ] Implicit Places using invariants and state equation in 129 ms returned [39, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 229 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 41/46 places, 97/112 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 237 ms. Remains : 41/46 places, 97/112 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLCardinality-11
Product exploration explored 100000 steps with 25000 reset in 581 ms.
Product exploration explored 100000 steps with 25000 reset in 348 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 338 steps (22 resets) in 6 ms. (48 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 41 cols
[2024-06-01 03:02:43] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 03:02:43] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 03:02:43] [INFO ] Invariant cache hit.
[2024-06-01 03:02:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:02:43] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-06-01 03:02:43] [INFO ] Invariant cache hit.
[2024-06-01 03:02:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 96/137 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 03:02:45] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 1/138 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 48 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3096 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 96/137 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 96/143 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 1/138 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 03:02:50] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/138 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 145 constraints, problems are : Problem set: 0 solved, 96 unsolved in 6889 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 2/2 constraints]
After SMT, in 10355ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 10394ms
Finished structural reductions in LTL mode , in 1 iterations and 10621 ms. Remains : 41/41 places, 97/97 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 272 steps (14 resets) in 5 ms. (45 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 277 ms.
Product exploration explored 100000 steps with 25000 reset in 290 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 97/97 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 41 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 41 transition count 99
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 41 transition count 99
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 41 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 40 transition count 98
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 40 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 40 transition count 101
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 11 rules in 31 ms. Remains 40 /41 variables (removed 1) and now considering 101/97 (removed -4) transitions.
[2024-06-01 03:02:55] [INFO ] Redundant transitions in 27 ms returned []
Running 100 sub problems to find dead transitions.
// Phase 1: matrix 101 rows 40 cols
[2024-06-01 03:02:55] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 03:02:55] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 03:02:56] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 03:02:56] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 3 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 03:02:56] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 03:02:56] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 4/9 constraints. Problems are: Problem set: 4 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 96 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
At refinement iteration 4 (OVERLAPS) 100/140 variables, 40/49 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 1/50 constraints. Problems are: Problem set: 12 solved, 88 unsolved
[2024-06-01 03:02:58] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 1/51 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/51 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 1/141 variables, 1/52 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 0/52 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/141 variables, 0/52 constraints. Problems are: Problem set: 12 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 52 constraints, problems are : Problem set: 12 solved, 88 unsolved in 4231 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 40/40 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 12 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 5/36 variables, 5/5 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 5/10 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 99/135 variables, 36/46 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 1/47 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 88/135 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/135 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 5/140 variables, 4/139 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/139 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 1/141 variables, 1/140 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 0/140 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 12 (OVERLAPS) 0/141 variables, 0/140 constraints. Problems are: Problem set: 12 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 140 constraints, problems are : Problem set: 12 solved, 88 unsolved in 6400 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 40/40 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 88/100 constraints, Known Traps: 5/5 constraints]
After SMT, in 10874ms problems are : Problem set: 12 solved, 88 unsolved
Search for dead transitions found 12 dead transitions in 10879ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 40/41 places, 89/97 transitions.
Graph (complete) has 230 edges and 40 vertex of which 32 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 23 ms. Remains 32 /40 variables (removed 8) and now considering 89/89 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/41 places, 89/97 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10974 ms. Remains : 32/41 places, 89/97 transitions.
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 41 cols
[2024-06-01 03:03:06] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 03:03:06] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-01 03:03:06] [INFO ] Invariant cache hit.
[2024-06-01 03:03:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:03:06] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-06-01 03:03:06] [INFO ] Invariant cache hit.
[2024-06-01 03:03:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 96/137 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 03:03:08] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 1/138 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 48 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3583 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 96/137 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 96/143 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 1/138 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 03:03:14] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/138 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 145 constraints, problems are : Problem set: 0 solved, 96 unsolved in 7934 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 2/2 constraints]
After SMT, in 11613ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 11614ms
Finished structural reductions in LTL mode , in 1 iterations and 11764 ms. Remains : 41/41 places, 97/97 transitions.
Treatment of property AutonomousCar-PT-04a-LTLCardinality-11 finished in 37699 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((F(G(p2))&&p1))||p0))))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 112/112 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 43 transition count 97
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 97
Applied a total of 6 rules in 3 ms. Remains 43 /46 variables (removed 3) and now considering 97/112 (removed 15) transitions.
// Phase 1: matrix 97 rows 43 cols
[2024-06-01 03:03:18] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 03:03:18] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 03:03:18] [INFO ] Invariant cache hit.
[2024-06-01 03:03:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:03:18] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [39]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 191 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/46 places, 97/112 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 195 ms. Remains : 42/46 places, 97/112 transitions.
Stuttering acceptance computed with spot in 308 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 303 ms.
Product exploration explored 100000 steps with 33333 reset in 318 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 21 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-04a-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-04a-LTLCardinality-14 finished in 1220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 112/112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 45 transition count 107
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 41 transition count 107
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 38 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 38 transition count 92
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 36 transition count 90
Applied a total of 18 rules in 19 ms. Remains 36 /46 variables (removed 10) and now considering 90/112 (removed 22) transitions.
// Phase 1: matrix 90 rows 36 cols
[2024-06-01 03:03:19] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 03:03:19] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 03:03:19] [INFO ] Invariant cache hit.
[2024-06-01 03:03:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:03:20] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [32, 34]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 214 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/46 places, 90/112 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 34 transition count 89
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 33 transition count 89
Applied a total of 2 rules in 11 ms. Remains 33 /34 variables (removed 1) and now considering 89/90 (removed 1) transitions.
// Phase 1: matrix 89 rows 33 cols
[2024-06-01 03:03:20] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 03:03:20] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 03:03:20] [INFO ] Invariant cache hit.
[2024-06-01 03:03:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:03:20] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/46 places, 89/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 415 ms. Remains : 33/46 places, 89/112 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLCardinality-15
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLCardinality-15 finished in 468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : AutonomousCar-PT-04a-LTLCardinality-11
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 46/46 places, 112/112 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 45 transition count 107
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 41 transition count 107
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 38 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 38 transition count 92
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 2 with 4 rules applied. Total rules applied 18 place count 36 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 35 transition count 90
Applied a total of 20 rules in 19 ms. Remains 35 /46 variables (removed 11) and now considering 90/112 (removed 22) transitions.
// Phase 1: matrix 90 rows 35 cols
[2024-06-01 03:03:20] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 03:03:20] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 03:03:20] [INFO ] Invariant cache hit.
[2024-06-01 03:03:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 03:03:20] [INFO ] Implicit Places using invariants and state equation in 101 ms returned [31, 33]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 164 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 33/46 places, 90/112 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 33 transition count 89
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 89
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 4 place count 31 transition count 88
Applied a total of 4 rules in 10 ms. Remains 31 /33 variables (removed 2) and now considering 88/90 (removed 2) transitions.
// Phase 1: matrix 88 rows 31 cols
[2024-06-01 03:03:20] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 03:03:20] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 03:03:20] [INFO ] Invariant cache hit.
[2024-06-01 03:03:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 03:03:21] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 31/46 places, 88/112 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 350 ms. Remains : 31/46 places, 88/112 transitions.
Running random walk in product with property : AutonomousCar-PT-04a-LTLCardinality-11
Product exploration explored 100000 steps with 25000 reset in 282 ms.
Product exploration explored 100000 steps with 25000 reset in 299 ms.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 159 steps (12 resets) in 4 ms. (31 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 88/88 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-06-01 03:03:22] [INFO ] Invariant cache hit.
[2024-06-01 03:03:22] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 03:03:22] [INFO ] Invariant cache hit.
[2024-06-01 03:03:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 03:03:22] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2024-06-01 03:03:22] [INFO ] Invariant cache hit.
[2024-06-01 03:03:22] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 87/118 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-01 03:03:23] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 1/119 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 39 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2436 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 31/31 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 87/118 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 87/125 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 1/119 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 126 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4611 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 31/31 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 1/1 constraints]
After SMT, in 7226ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 7229ms
Finished structural reductions in LTL mode , in 1 iterations and 7397 ms. Remains : 31/31 places, 88/88 transitions.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 208 steps (17 resets) in 4 ms. (41 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 117 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 283 ms.
Product exploration explored 100000 steps with 25000 reset in 287 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 88/88 transitions.
Applied a total of 0 rules in 6 ms. Remains 31 /31 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-06-01 03:03:31] [INFO ] Redundant transitions in 19 ms returned []
Running 87 sub problems to find dead transitions.
[2024-06-01 03:03:31] [INFO ] Invariant cache hit.
[2024-06-01 03:03:31] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 87/118 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-01 03:03:32] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 1/119 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 39 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2483 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 31/31 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 87/118 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 87/125 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 1/119 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 126 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4602 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 31/31 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 1/1 constraints]
After SMT, in 7282ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 7285ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7318 ms. Remains : 31/31 places, 88/88 transitions.
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 88/88 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-06-01 03:03:38] [INFO ] Invariant cache hit.
[2024-06-01 03:03:39] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 03:03:39] [INFO ] Invariant cache hit.
[2024-06-01 03:03:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 03:03:39] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2024-06-01 03:03:39] [INFO ] Invariant cache hit.
[2024-06-01 03:03:39] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 87/118 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-01 03:03:40] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 1/119 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 39 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2657 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 31/31 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 87/118 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 87/125 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 1/119 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 126 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4581 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 31/31 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 1/1 constraints]
After SMT, in 7448ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 7451ms
Finished structural reductions in LTL mode , in 1 iterations and 7656 ms. Remains : 31/31 places, 88/88 transitions.
Treatment of property AutonomousCar-PT-04a-LTLCardinality-11 finished in 26351 ms.
[2024-06-01 03:03:46] [INFO ] Flatten gal took : 25 ms
[2024-06-01 03:03:46] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 03:03:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 46 places, 112 transitions and 611 arcs took 11 ms.
Total runtime 74615 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutonomousCar-PT-04a-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717211027022

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutonomousCar-PT-04a-LTLCardinality-11
ltl formula formula --ltl=/tmp/1241/ltl_0_
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 46 places, 112 transitions and 611 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.020 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1241/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1241/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1241/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1241/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 48 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 47, there are 119 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 19
pnml2lts-mc( 0/ 4): unique states count: 19
pnml2lts-mc( 0/ 4): unique transitions count: 18
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 10
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 31
pnml2lts-mc( 0/ 4): - cum. max stack depth: 15
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 31 states 76 transitions, fanout: 2.452
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 37.9 B/state, compr.: 19.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 112 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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-04a"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-04a, 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 r468-smll-171620167300267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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