About the Execution of LTSMin+red for AutonomousCar-PT-08b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2777.888 | 149636.00 | 189902.00 | 410.00 | TF?FTFTTFTTTTFTF | normal |
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-171620167500343.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-08b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167500343
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 517K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-00
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-01
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2023-02
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-03
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-04
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-05
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-06
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-07
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-08
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-09
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-10
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-11
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-12
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-13
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-14
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717219733380
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:28:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:28:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:28:55] [INFO ] Load time of PNML (sax parser for PT used): 316 ms
[2024-06-01 05:28:55] [INFO ] Transformed 357 places.
[2024-06-01 05:28:55] [INFO ] Transformed 1128 transitions.
[2024-06-01 05:28:55] [INFO ] Found NUPN structural information;
[2024-06-01 05:28:55] [INFO ] Parsed PT model containing 357 places and 1128 transitions and 9454 arcs in 501 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (309 resets) in 1963 ms. (20 steps per ms) remains 9/16 properties
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (44 resets) in 578 ms. (69 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (54 resets) in 802 ms. (49 steps per ms) remains 8/9 properties
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (56 resets) in 397 ms. (100 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (66 resets) in 178 ms. (223 steps per ms) remains 7/8 properties
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (67 resets) in 140 ms. (283 steps per ms) remains 6/7 properties
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (51 resets) in 383 ms. (104 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (80 resets) in 390 ms. (102 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (51 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
// Phase 1: matrix 1128 rows 357 cols
[2024-06-01 05:28:57] [INFO ] Computed 13 invariants in 36 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AutonomousCar-PT-08b-ReachabilityFireability-2024-01 is UNSAT
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-08b-ReachabilityFireability-2024-08 is UNSAT
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 269/357 variables, 13/101 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 269/370 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/370 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1128/1485 variables, 357/727 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1485 variables, 0/727 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/1485 variables, 0/727 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1485/1485 variables, and 727 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1389 ms.
Refiners :[Domain max(s): 357/357 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem AutonomousCar-PT-08b-ReachabilityFireability-2024-00 is UNSAT
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-08b-ReachabilityFireability-2024-14 is UNSAT
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 286/357 variables, 13/84 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 286/370 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-06-01 05:29:00] [INFO ] Deduced a trap composed of 35 places in 547 ms of which 41 ms to minimize.
[2024-06-01 05:29:01] [INFO ] Deduced a trap composed of 16 places in 642 ms of which 4 ms to minimize.
[2024-06-01 05:29:01] [INFO ] Deduced a trap composed of 48 places in 375 ms of which 3 ms to minimize.
[2024-06-01 05:29:02] [INFO ] Deduced a trap composed of 49 places in 302 ms of which 3 ms to minimize.
[2024-06-01 05:29:02] [INFO ] Deduced a trap composed of 35 places in 440 ms of which 3 ms to minimize.
[2024-06-01 05:29:02] [INFO ] Deduced a trap composed of 46 places in 471 ms of which 4 ms to minimize.
[2024-06-01 05:29:03] [INFO ] Deduced a trap composed of 35 places in 429 ms of which 4 ms to minimize.
Problem AutonomousCar-PT-08b-ReachabilityFireability-2024-15 is UNSAT
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 7/377 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-01 05:29:03] [INFO ] Deduced a trap composed of 38 places in 457 ms of which 6 ms to minimize.
[2024-06-01 05:29:04] [INFO ] Deduced a trap composed of 42 places in 499 ms of which 4 ms to minimize.
[2024-06-01 05:29:04] [INFO ] Deduced a trap composed of 50 places in 500 ms of which 4 ms to minimize.
SMT process timed out in 7511ms, After SMT, problems are : Problem set: 5 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 1128/1128 transitions.
Graph (trivial) has 279 edges and 357 vertex of which 4 / 357 are part of one of the 2 SCC in 9 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1428 edges and 355 vertex of which 348 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.15 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 139 rules applied. Total rules applied 141 place count 348 transition count 980
Reduce places removed 137 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 175 rules applied. Total rules applied 316 place count 211 transition count 942
Reduce places removed 21 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 24 rules applied. Total rules applied 340 place count 190 transition count 939
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 345 place count 187 transition count 937
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 346 place count 186 transition count 937
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 346 place count 186 transition count 916
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 388 place count 165 transition count 916
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 419 place count 134 transition count 885
Iterating global reduction 5 with 31 rules applied. Total rules applied 450 place count 134 transition count 885
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 5 with 257 rules applied. Total rules applied 707 place count 134 transition count 628
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 711 place count 130 transition count 603
Iterating global reduction 6 with 4 rules applied. Total rules applied 715 place count 130 transition count 603
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 6 with 5 rules applied. Total rules applied 720 place count 130 transition count 598
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 722 place count 128 transition count 598
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 8 with 58 rules applied. Total rules applied 780 place count 99 transition count 569
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 782 place count 97 transition count 551
Iterating global reduction 8 with 2 rules applied. Total rules applied 784 place count 97 transition count 551
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 786 place count 97 transition count 549
Free-agglomeration rule applied 18 times.
Iterating global reduction 8 with 18 rules applied. Total rules applied 804 place count 97 transition count 531
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 822 place count 79 transition count 531
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 829 place count 79 transition count 531
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 830 place count 78 transition count 530
Applied a total of 830 rules in 414 ms. Remains 78 /357 variables (removed 279) and now considering 530/1128 (removed 598) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 432 ms. Remains : 78/357 places, 530/1128 transitions.
RANDOM walk for 40000 steps (1027 resets) in 396 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (161 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1163760 steps, run timeout after 3001 ms. (steps per millisecond=387 ) properties seen :0 out of 1
Probabilistic random walk after 1163760 steps, saw 170776 distinct states, run finished after 3006 ms. (steps per millisecond=387 ) properties seen :0
// Phase 1: matrix 530 rows 78 cols
[2024-06-01 05:29:08] [INFO ] Computed 13 invariants in 4 ms
[2024-06-01 05:29:08] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/73 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 527/600 variables, 73/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/608 variables, 5/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/608 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/608 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/608 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 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/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/73 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:29:09] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 1 ms to minimize.
[2024-06-01 05:29:09] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 527/600 variables, 73/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/600 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/608 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/608 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/608 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/608 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/608 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/608 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1147 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1449ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 112 ms.
Support contains 29 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 530/530 transitions.
Applied a total of 0 rules in 24 ms. Remains 78 /78 variables (removed 0) and now considering 530/530 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 78/78 places, 530/530 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 530/530 transitions.
Applied a total of 0 rules in 23 ms. Remains 78 /78 variables (removed 0) and now considering 530/530 (removed 0) transitions.
[2024-06-01 05:29:10] [INFO ] Invariant cache hit.
[2024-06-01 05:29:10] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 05:29:10] [INFO ] Invariant cache hit.
[2024-06-01 05:29:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:29:10] [INFO ] Implicit Places using invariants and state equation in 250 ms returned [73, 77]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 363 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 76/78 places, 529/530 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 76 transition count 528
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 75 transition count 528
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 75 transition count 527
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 74 transition count 527
Applied a total of 4 rules in 46 ms. Remains 74 /76 variables (removed 2) and now considering 527/529 (removed 2) transitions.
// Phase 1: matrix 527 rows 74 cols
[2024-06-01 05:29:10] [INFO ] Computed 11 invariants in 4 ms
[2024-06-01 05:29:10] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 05:29:10] [INFO ] Invariant cache hit.
[2024-06-01 05:29:10] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 74/78 places, 527/530 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 745 ms. Remains : 74/78 places, 527/530 transitions.
RANDOM walk for 40000 steps (705 resets) in 1054 ms. (37 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (157 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1217679 steps, run timeout after 3001 ms. (steps per millisecond=405 ) properties seen :0 out of 1
Probabilistic random walk after 1217679 steps, saw 181389 distinct states, run finished after 3001 ms. (steps per millisecond=405 ) properties seen :0
[2024-06-01 05:29:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/72 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 527/599 variables, 72/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/599 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/601 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/601 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 601/601 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 74/74 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/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/72 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:29:14] [INFO ] Deduced a trap composed of 9 places in 228 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 527/599 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/599 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/601 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:29:15] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/601 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/601 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 601/601 variables, and 88 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1247 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1513ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 122 ms.
Support contains 29 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 527/527 transitions.
Applied a total of 0 rules in 17 ms. Remains 74 /74 variables (removed 0) and now considering 527/527 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 74/74 places, 527/527 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 527/527 transitions.
Applied a total of 0 rules in 17 ms. Remains 74 /74 variables (removed 0) and now considering 527/527 (removed 0) transitions.
[2024-06-01 05:29:15] [INFO ] Invariant cache hit.
[2024-06-01 05:29:15] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 05:29:15] [INFO ] Invariant cache hit.
[2024-06-01 05:29:16] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-06-01 05:29:16] [INFO ] Redundant transitions in 49 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-01 05:29:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (OVERLAPS) 8/74 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-01 05:29:25] [INFO ] Deduced a trap composed of 7 places in 347 ms of which 3 ms to minimize.
[2024-06-01 05:29:27] [INFO ] Deduced a trap composed of 5 places in 304 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Problem TDEAD526 is UNSAT
At refinement iteration 5 (OVERLAPS) 527/601 variables, 74/87 constraints. Problems are: Problem set: 1 solved, 518 unsolved
[2024-06-01 05:29:34] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 1 ms to minimize.
[2024-06-01 05:29:34] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 1 ms to minimize.
[2024-06-01 05:29:34] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 2 ms to minimize.
[2024-06-01 05:29:34] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 2 ms to minimize.
[2024-06-01 05:29:34] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 1 ms to minimize.
[2024-06-01 05:29:35] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 1 ms to minimize.
[2024-06-01 05:29:35] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 7/94 constraints. Problems are: Problem set: 1 solved, 518 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 518 unsolved
At refinement iteration 8 (OVERLAPS) 0/601 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 518 unsolved
No progress, stopping.
After SMT solving in domain Real declared 601/601 variables, and 94 constraints, problems are : Problem set: 1 solved, 518 unsolved in 27880 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 1 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 518 unsolved
At refinement iteration 3 (OVERLAPS) 8/74 variables, 9/12 constraints. Problems are: Problem set: 1 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 8/20 constraints. Problems are: Problem set: 1 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 518 unsolved
At refinement iteration 6 (OVERLAPS) 527/601 variables, 74/94 constraints. Problems are: Problem set: 1 solved, 518 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 518/612 constraints. Problems are: Problem set: 1 solved, 518 unsolved
[2024-06-01 05:30:15] [INFO ] Deduced a trap composed of 33 places in 291 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 601/601 variables, and 613 constraints, problems are : Problem set: 1 solved, 518 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 518/519 constraints, Known Traps: 10/10 constraints]
After SMT, in 63204ms problems are : Problem set: 1 solved, 518 unsolved
Search for dead transitions found 1 dead transitions in 63217ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 74/74 places, 526/527 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 73 transition count 525
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 73 transition count 525
Applied a total of 2 rules in 24 ms. Remains 73 /74 variables (removed 1) and now considering 525/526 (removed 1) transitions.
// Phase 1: matrix 525 rows 73 cols
[2024-06-01 05:30:19] [INFO ] Computed 12 invariants in 6 ms
[2024-06-01 05:30:19] [INFO ] Implicit Places using invariants in 85 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 72/74 places, 525/527 transitions.
Applied a total of 0 rules in 18 ms. Remains 72 /72 variables (removed 0) and now considering 525/525 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 63740 ms. Remains : 72/74 places, 525/527 transitions.
RANDOM walk for 40000 steps (579 resets) in 368 ms. (108 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (162 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1271427 steps, run timeout after 3001 ms. (steps per millisecond=423 ) properties seen :0 out of 1
Probabilistic random walk after 1271427 steps, saw 187949 distinct states, run finished after 3001 ms. (steps per millisecond=423 ) properties seen :0
// Phase 1: matrix 525 rows 72 cols
[2024-06-01 05:30:22] [INFO ] Computed 11 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/72 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 525/597 variables, 72/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/597 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 597/597 variables, and 83 constraints, problems are : Problem set: 0 solved, 1 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 72/72 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/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/72 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:30:23] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 525/597 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/597 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 597/597 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 953 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1223ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 210 ms.
Support contains 29 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 525/525 transitions.
Applied a total of 0 rules in 18 ms. Remains 72 /72 variables (removed 0) and now considering 525/525 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 72/72 places, 525/525 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 525/525 transitions.
Applied a total of 0 rules in 18 ms. Remains 72 /72 variables (removed 0) and now considering 525/525 (removed 0) transitions.
[2024-06-01 05:30:24] [INFO ] Invariant cache hit.
[2024-06-01 05:30:24] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 05:30:24] [INFO ] Invariant cache hit.
[2024-06-01 05:30:24] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-06-01 05:30:24] [INFO ] Redundant transitions in 14 ms returned []
Running 517 sub problems to find dead transitions.
[2024-06-01 05:30:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (OVERLAPS) 8/72 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 05:30:33] [INFO ] Deduced a trap composed of 7 places in 364 ms of which 1 ms to minimize.
[2024-06-01 05:30:35] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 525/597 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (OVERLAPS) 0/597 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 517 unsolved
No progress, stopping.
After SMT solving in domain Real declared 597/597 variables, and 85 constraints, problems are : Problem set: 0 solved, 517 unsolved in 22741 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (OVERLAPS) 8/72 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 525/597 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 517/602 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-06-01 05:31:20] [INFO ] Deduced a trap composed of 33 places in 290 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 597/597 variables, and 603 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 3/3 constraints]
After SMT, in 57578ms problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 57586ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57944 ms. Remains : 72/72 places, 525/525 transitions.
[2024-06-01 05:31:22] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-06-01 05:31:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 72 places, 525 transitions and 6447 arcs took 14 ms.
[2024-06-01 05:31:22] [INFO ] Flatten gal took : 254 ms
Total runtime 147631 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : AutonomousCar-PT-08b-ReachabilityFireability-2023-02
BK_STOP 1717219883016
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name AutonomousCar-PT-08b-ReachabilityFireability-2023-02
rfs formula type AG
rfs formula formula --invariant=/tmp/680/inv_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-08b"
export BK_EXAMINATION="ReachabilityFireability"
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-08b, examination is ReachabilityFireability"
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-171620167500343"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-08b.tgz
mv AutonomousCar-PT-08b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;