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-171620167300235.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-02a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167300235
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 13K Apr 12 18:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 12 18:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 18:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 18:13 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 23K 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-02a-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-02a-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-02a-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-02a-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-02a-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-02a-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-02a-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-02a-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-02a-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-02a-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-02a-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-02a-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-02a-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-02a-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-02a-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-02a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717209861260

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-02a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:44:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 02:44:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:44:23] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-06-01 02:44:23] [INFO ] Transformed 33 places.
[2024-06-01 02:44:23] [INFO ] Transformed 69 transitions.
[2024-06-01 02:44:23] [INFO ] Found NUPN structural information;
[2024-06-01 02:44:23] [INFO ] Parsed PT model containing 33 places and 69 transitions and 368 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 23 transitions
Reduce redundant transitions removed 23 transitions.
FORMULA AutonomousCar-PT-02a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 46/46 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 32 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 45
Applied a total of 2 rules in 25 ms. Remains 32 /33 variables (removed 1) and now considering 45/46 (removed 1) transitions.
// Phase 1: matrix 45 rows 32 cols
[2024-06-01 02:44:23] [INFO ] Computed 6 invariants in 10 ms
[2024-06-01 02:44:23] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-06-01 02:44:23] [INFO ] Invariant cache hit.
[2024-06-01 02:44:23] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 02:44:23] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 373 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 45/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 425 ms. Remains : 31/33 places, 45/46 transitions.
Support contains 20 out of 31 places after structural reductions.
[2024-06-01 02:44:24] [INFO ] Flatten gal took : 33 ms
[2024-06-01 02:44:24] [INFO ] Flatten gal took : 14 ms
[2024-06-01 02:44:24] [INFO ] Input system was already deterministic with 45 transitions.
RANDOM walk for 40000 steps (2538 resets) in 700 ms. (57 steps per ms) remains 1/18 properties
BEST_FIRST walk for 40003 steps (804 resets) in 176 ms. (226 steps per ms) remains 1/1 properties
// Phase 1: matrix 45 rows 31 cols
[2024-06-01 02:44:24] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 02:44:24] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/23 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/61 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/73 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/75 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/76 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/76 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/76 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 55 constraints, problems are : Problem set: 0 solved, 1 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 31/31 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/23 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/61 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Int declared 73/76 variables, and 52 constraints, problems are : Problem set: 1 solved, 0 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 29/31 constraints, ReadFeed: 18/19 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 255ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA AutonomousCar-PT-02a-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 3 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' '!((G(p0)||X(p1)))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 45/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 29 transition count 39
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 29 transition count 39
Applied a total of 4 rules in 3 ms. Remains 29 /31 variables (removed 2) and now considering 39/45 (removed 6) transitions.
// Phase 1: matrix 39 rows 29 cols
[2024-06-01 02:44:25] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 02:44:25] [INFO ] Implicit Places using invariants in 107 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/31 places, 39/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 28/31 places, 39/45 transitions.
Stuttering acceptance computed with spot in 327 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02a-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-02a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLCardinality-00 finished in 517 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((p0||F((p1||G(p2))))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 45/45 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 29 transition count 43
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 28 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 27 transition count 42
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 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 10 place count 24 transition count 40
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 11 place count 24 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 12 place count 23 transition count 39
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 5 with 2 rules applied. Total rules applied 14 place count 22 transition count 39
Applied a total of 14 rules in 24 ms. Remains 22 /31 variables (removed 9) and now considering 39/45 (removed 6) transitions.
// Phase 1: matrix 39 rows 22 cols
[2024-06-01 02:44:25] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:44:25] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 02:44:25] [INFO ] Invariant cache hit.
[2024-06-01 02:44:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 02:44:25] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-06-01 02:44:25] [INFO ] Redundant transitions in 15 ms returned []
Running 38 sub problems to find dead transitions.
[2024-06-01 02:44:25] [INFO ] Invariant cache hit.
[2024-06-01 02:44:25] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 38/60 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 02:44:26] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 1/61 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/61 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 28 constraints, problems are : Problem set: 0 solved, 38 unsolved in 833 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 22/22 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/60 variables, 22/26 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 38/65 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 1/61 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/61 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 66 constraints, problems are : Problem set: 0 solved, 38 unsolved in 763 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 22/22 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints]
After SMT, in 1668ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1671ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/31 places, 39/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1828 ms. Remains : 22/31 places, 39/45 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-02a-LTLCardinality-01
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-02a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLCardinality-01 finished in 1924 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(p0)||G((F(G(p0))&&F(p1)))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 45/45 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 29 transition count 42
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 27 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 26 transition count 41
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 8 place count 25 transition count 38
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 25 transition count 38
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 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 14 place count 22 transition count 36
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 22 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 16 place count 21 transition count 35
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 5 with 2 rules applied. Total rules applied 18 place count 20 transition count 35
Applied a total of 18 rules in 8 ms. Remains 20 /31 variables (removed 11) and now considering 35/45 (removed 10) transitions.
// Phase 1: matrix 35 rows 20 cols
[2024-06-01 02:44:27] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:44:27] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 02:44:27] [INFO ] Invariant cache hit.
[2024-06-01 02:44:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 02:44:27] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-06-01 02:44:27] [INFO ] Redundant transitions in 16 ms returned []
Running 34 sub problems to find dead transitions.
[2024-06-01 02:44:27] [INFO ] Invariant cache hit.
[2024-06-01 02:44:27] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 34/54 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 1/55 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 25 constraints, problems are : Problem set: 0 solved, 34 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 34/54 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 34/58 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 1/55 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 59 constraints, problems are : Problem set: 0 solved, 34 unsolved in 626 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
After SMT, in 1144ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 1146ms
Starting structural reductions in SI_LTL mode, iteration 1 : 20/31 places, 35/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1267 ms. Remains : 20/31 places, 35/45 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-02a-LTLCardinality-03
Stuttering criterion allowed to conclude after 30 steps with 6 reset in 2 ms.
FORMULA AutonomousCar-PT-02a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLCardinality-03 finished in 1446 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((p0&&G(p1))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 45/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 29 transition count 39
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 29 transition count 39
Applied a total of 4 rules in 4 ms. Remains 29 /31 variables (removed 2) and now considering 39/45 (removed 6) transitions.
// Phase 1: matrix 39 rows 29 cols
[2024-06-01 02:44:28] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 02:44:28] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 02:44:28] [INFO ] Invariant cache hit.
[2024-06-01 02:44:28] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 02:44:28] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 107 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/31 places, 39/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 28/31 places, 39/45 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-02a-LTLCardinality-05
Product exploration explored 100000 steps with 4 reset in 254 ms.
Product exploration explored 100000 steps with 1 reset in 166 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Detected a total of 3/28 stabilizing places and 2/39 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (OR (NOT p0) (NOT p1)))), (X p0), (X p1), (X (AND p0 p1)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 130 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (OR (NOT p0) (NOT p1)))), (X p0), (X p1), (X (AND p0 p1)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 133 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 39 rows 28 cols
[2024-06-01 02:44:30] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 02:44:30] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 02:44:30] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 02:44:30] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 02:44:30] [INFO ] [Real]Added 15 Read/Feed constraints in 3 ms returned sat
[2024-06-01 02:44:30] [INFO ] Computed and/alt/rep : 24/76/24 causal constraints (skipped 14 transitions) in 11 ms.
[2024-06-01 02:44:30] [INFO ] Added : 0 causal constraints over 0 iterations in 29 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2024-06-01 02:44:30] [INFO ] Invariant cache hit.
[2024-06-01 02:44:30] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 02:44:30] [INFO ] Invariant cache hit.
[2024-06-01 02:44:30] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 02:44:30] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 38 sub problems to find dead transitions.
[2024-06-01 02:44:30] [INFO ] Invariant cache hit.
[2024-06-01 02:44:30] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/66 variables, 28/32 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 02:44:30] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
[2024-06-01 02:44:30] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 02:44:30] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 1/67 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/67 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/67 variables, and 50 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1145 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 28/28 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 38/66 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 38/87 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 1/67 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/67 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/67 variables, and 88 constraints, problems are : Problem set: 0 solved, 38 unsolved in 840 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 28/28 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 3/3 constraints]
After SMT, in 2014ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2016ms
Finished structural reductions in LTL mode , in 1 iterations and 2111 ms. Remains : 28/28 places, 39/39 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Detected a total of 3/28 stabilizing places and 2/39 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
[2024-06-01 02:44:33] [INFO ] Invariant cache hit.
[2024-06-01 02:44:33] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 02:44:33] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 02:44:33] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 02:44:33] [INFO ] [Real]Added 15 Read/Feed constraints in 3 ms returned sat
[2024-06-01 02:44:33] [INFO ] Computed and/alt/rep : 24/76/24 causal constraints (skipped 14 transitions) in 5 ms.
[2024-06-01 02:44:33] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7 reset in 95 ms.
Product exploration explored 100000 steps with 0 reset in 112 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 39/39 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 28 transition count 41
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 28 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 28 transition count 41
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 27 transition count 40
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 27 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 27 transition count 43
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 10 rules in 12 ms. Remains 27 /28 variables (removed 1) and now considering 43/39 (removed -4) transitions.
[2024-06-01 02:44:34] [INFO ] Redundant transitions in 14 ms returned []
Running 42 sub problems to find dead transitions.
// Phase 1: matrix 43 rows 27 cols
[2024-06-01 02:44:34] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 02:44:34] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-06-01 02:44:34] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 02:44:34] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-01 02:44:34] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 39 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
At refinement iteration 4 (OVERLAPS) 42/69 variables, 27/34 constraints. Problems are: Problem set: 11 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 18/52 constraints. Problems are: Problem set: 11 solved, 31 unsolved
[2024-06-01 02:44:34] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 1/53 constraints. Problems are: Problem set: 11 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/53 constraints. Problems are: Problem set: 11 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 1/70 variables, 1/54 constraints. Problems are: Problem set: 11 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 0/54 constraints. Problems are: Problem set: 11 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 0/70 variables, 0/54 constraints. Problems are: Problem set: 11 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 54 constraints, problems are : Problem set: 11 solved, 31 unsolved in 916 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 27/27 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 11 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 4/23 variables, 4/4 constraints. Problems are: Problem set: 11 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 4/8 constraints. Problems are: Problem set: 11 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 11 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 41/64 variables, 23/31 constraints. Problems are: Problem set: 11 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 18/49 constraints. Problems are: Problem set: 11 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 31/80 constraints. Problems are: Problem set: 11 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/80 constraints. Problems are: Problem set: 11 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 5/69 variables, 4/84 constraints. Problems are: Problem set: 11 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 0/84 constraints. Problems are: Problem set: 11 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 1/70 variables, 1/85 constraints. Problems are: Problem set: 11 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 0/85 constraints. Problems are: Problem set: 11 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 0/70 variables, 0/85 constraints. Problems are: Problem set: 11 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/70 variables, and 85 constraints, problems are : Problem set: 11 solved, 31 unsolved in 918 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 27/27 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 31/42 constraints, Known Traps: 4/4 constraints]
After SMT, in 1870ms problems are : Problem set: 11 solved, 31 unsolved
Search for dead transitions found 11 dead transitions in 1871ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 27/28 places, 32/39 transitions.
Graph (complete) has 113 edges and 27 vertex of which 20 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 20 /27 variables (removed 7) and now considering 32/32 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/28 places, 32/39 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1908 ms. Remains : 20/28 places, 32/39 transitions.
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 39/39 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 28 cols
[2024-06-01 02:44:35] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 02:44:35] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 02:44:35] [INFO ] Invariant cache hit.
[2024-06-01 02:44:36] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 02:44:36] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 38 sub problems to find dead transitions.
[2024-06-01 02:44:36] [INFO ] Invariant cache hit.
[2024-06-01 02:44:36] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/66 variables, 28/32 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 02:44:36] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
[2024-06-01 02:44:36] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 02:44:36] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 1/67 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/67 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/67 variables, and 50 constraints, problems are : Problem set: 0 solved, 38 unsolved in 991 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 28/28 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 38/66 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 38/87 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 1/67 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/67 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/67 variables, and 88 constraints, problems are : Problem set: 0 solved, 38 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 28/28 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 3/3 constraints]
After SMT, in 1776ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1778ms
Finished structural reductions in LTL mode , in 1 iterations and 1879 ms. Remains : 28/28 places, 39/39 transitions.
Treatment of property AutonomousCar-PT-02a-LTLCardinality-05 finished in 9044 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(p0))'
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 45/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 29 transition count 39
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 29 transition count 39
Applied a total of 4 rules in 2 ms. Remains 29 /31 variables (removed 2) and now considering 39/45 (removed 6) transitions.
// Phase 1: matrix 39 rows 29 cols
[2024-06-01 02:44:37] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:44:37] [INFO ] Implicit Places using invariants in 55 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/31 places, 39/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 28/31 places, 39/45 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutonomousCar-PT-02a-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 290 ms.
Product exploration explored 100000 steps with 50000 reset in 213 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 p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-02a-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-02a-LTLCardinality-11 finished in 694 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(p0)&&G(F(p1))))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 45/45 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 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 4 rules applied. Total rules applied 4 place count 29 transition count 41
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 26 transition count 41
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 25 transition count 38
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 25 transition count 38
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 16 place count 21 transition count 35
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 21 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 20 transition count 34
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 4 with 2 rules applied. Total rules applied 20 place count 19 transition count 34
Applied a total of 20 rules in 12 ms. Remains 19 /31 variables (removed 12) and now considering 34/45 (removed 11) transitions.
// Phase 1: matrix 34 rows 19 cols
[2024-06-01 02:44:38] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:44:38] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 02:44:38] [INFO ] Invariant cache hit.
[2024-06-01 02:44:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 02:44:38] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-06-01 02:44:38] [INFO ] Redundant transitions in 14 ms returned []
Running 33 sub problems to find dead transitions.
[2024-06-01 02:44:38] [INFO ] Invariant cache hit.
[2024-06-01 02:44:38] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 33/52 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 02:44:38] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 1/53 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/53 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 25 constraints, problems are : Problem set: 0 solved, 33 unsolved in 503 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 19/19 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 33/52 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 1/53 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/53 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 58 constraints, problems are : Problem set: 0 solved, 33 unsolved in 582 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 19/19 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 1/1 constraints]
After SMT, in 1109ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 1111ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/31 places, 34/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1229 ms. Remains : 19/31 places, 34/45 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-02a-LTLCardinality-12
Stuttering criterion allowed to conclude after 34 steps with 4 reset in 1 ms.
FORMULA AutonomousCar-PT-02a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLCardinality-12 finished in 1398 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 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 45/45 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 29 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 28 transition count 43
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5 place count 26 transition count 37
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 26 transition count 37
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 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 23 transition count 35
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 23 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 14 place count 22 transition count 34
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 4 with 2 rules applied. Total rules applied 16 place count 21 transition count 34
Applied a total of 16 rules in 14 ms. Remains 21 /31 variables (removed 10) and now considering 34/45 (removed 11) transitions.
// Phase 1: matrix 34 rows 21 cols
[2024-06-01 02:44:39] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:44:40] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 02:44:40] [INFO ] Invariant cache hit.
[2024-06-01 02:44:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 02:44:40] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-06-01 02:44:40] [INFO ] Redundant transitions in 13 ms returned []
Running 33 sub problems to find dead transitions.
[2024-06-01 02:44:40] [INFO ] Invariant cache hit.
[2024-06-01 02:44:40] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 33/54 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 02:44:40] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 02:44:40] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 1/55 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 28 constraints, problems are : Problem set: 0 solved, 33 unsolved in 570 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 21/21 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 33/54 variables, 21/26 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 33/60 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 02:44:40] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 1/55 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/55 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 62 constraints, problems are : Problem set: 0 solved, 33 unsolved in 768 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 21/21 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 3/3 constraints]
After SMT, in 1353ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 1354ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/31 places, 34/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1475 ms. Remains : 21/31 places, 34/45 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02a-LTLCardinality-13
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLCardinality-13 finished in 1525 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((p0&&X(G(p1)))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 45/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 31 transition count 43
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 29 transition count 43
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 27 transition count 37
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 27 transition count 37
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 24 transition count 34
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 16 place count 23 transition count 34
Applied a total of 16 rules in 12 ms. Remains 23 /31 variables (removed 8) and now considering 34/45 (removed 11) transitions.
// Phase 1: matrix 34 rows 23 cols
[2024-06-01 02:44:41] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:44:41] [INFO ] Implicit Places using invariants in 52 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/31 places, 34/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 34/34 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 67 ms. Remains : 22/31 places, 34/45 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-02a-LTLCardinality-14
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02a-LTLCardinality-14 finished in 155 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((p0&&G(p1))))'
[2024-06-01 02:44:41] [INFO ] Flatten gal took : 11 ms
[2024-06-01 02:44:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 02:44:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 31 places, 45 transitions and 220 arcs took 5 ms.
Total runtime 18901 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutonomousCar-PT-02a-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717209882107

--------------------
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-02a-LTLCardinality-05
ltl formula formula --ltl=/tmp/964/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 31 places, 45 transitions and 220 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/964/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/964/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/964/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/964/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 33 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 32, there are 53 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: 1846
pnml2lts-mc( 0/ 4): unique states count: 2314
pnml2lts-mc( 0/ 4): unique transitions count: 7369
pnml2lts-mc( 0/ 4): - self-loop count: 607
pnml2lts-mc( 0/ 4): - claim dead count: 4110
pnml2lts-mc( 0/ 4): - claim found count: 714
pnml2lts-mc( 0/ 4): - claim success count: 2539
pnml2lts-mc( 0/ 4): - cum. max stack depth: 238
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2601 states 8535 transitions, fanout: 3.281
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 130050, Transitions per second: 426750
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, 9.0 B/state, compr.: 6.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 45 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-02a"
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-02a, 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-171620167300235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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