About the Execution of LTSMin+red for AutonomousCar-PT-10a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3190.483 | 214420.00 | 275305.00 | 539.90 | TTF?TTFFFTFFTFF? | 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-171620167500367.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-10a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167500367
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 17:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 12 17:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 17:53 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 1.5M 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-10a-ReachabilityFireability-2024-00
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-01
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-02
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-03
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-04
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-05
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-06
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-07
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-08
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-09
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-10
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-11
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-12
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-13
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-14
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717225650924
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-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:07:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:07:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:07:33] [INFO ] Load time of PNML (sax parser for PT used): 650 ms
[2024-06-01 07:07:33] [INFO ] Transformed 97 places.
[2024-06-01 07:07:33] [INFO ] Transformed 1921 transitions.
[2024-06-01 07:07:33] [INFO ] Found NUPN structural information;
[2024-06-01 07:07:33] [INFO ] Parsed PT model containing 97 places and 1921 transitions and 29152 arcs in 862 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 423 transitions
Reduce redundant transitions removed 423 transitions.
RANDOM walk for 40000 steps (1838 resets) in 5336 ms. (7 steps per ms) remains 14/16 properties
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (114 resets) in 718 ms. (55 steps per ms) remains 13/14 properties
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (114 resets) in 211 ms. (188 steps per ms) remains 12/13 properties
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (83 resets) in 1806 ms. (22 steps per ms) remains 11/12 properties
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (101 resets) in 239 ms. (166 steps per ms) remains 10/11 properties
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (90 resets) in 476 ms. (83 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (95 resets) in 600 ms. (66 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (39 resets) in 996 ms. (40 steps per ms) remains 9/10 properties
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (124 resets) in 226 ms. (176 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (59 resets) in 677 ms. (59 steps per ms) remains 8/9 properties
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (118 resets) in 184 ms. (216 steps per ms) remains 7/8 properties
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (93 resets) in 447 ms. (89 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (101 resets) in 330 ms. (120 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (98 resets) in 442 ms. (90 steps per ms) remains 7/7 properties
[2024-06-01 07:07:37] [INFO ] Flow matrix only has 1497 transitions (discarded 1 similar events)
// Phase 1: matrix 1497 rows 97 cols
[2024-06-01 07:07:37] [INFO ] Computed 15 invariants in 72 ms
[2024-06-01 07:07:37] [INFO ] State equation strengthened by 403 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AutonomousCar-PT-10a-ReachabilityFireability-2024-08 is UNSAT
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-10a-ReachabilityFireability-2024-13 is UNSAT
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 31/91 variables, 13/73 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 31/104 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6/97 variables, 2/106 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 6/112 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1496/1593 variables, 97/209 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1593 variables, 402/611 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1593 variables, 0/611 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/1594 variables, 1/612 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1594 variables, 0/612 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1594 variables, 0/612 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1594/1594 variables, and 612 constraints, problems are : Problem set: 2 solved, 5 unsolved in 1959 ms.
Refiners :[Domain max(s): 97/97 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 97/97 constraints, ReadFeed: 403/403 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem AutonomousCar-PT-10a-ReachabilityFireability-2024-04 is UNSAT
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-10a-ReachabilityFireability-2024-05 is UNSAT
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-10a-ReachabilityFireability-2024-12 is UNSAT
FORMULA AutonomousCar-PT-10a-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 32/91 variables, 13/72 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 32/104 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/104 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/97 variables, 2/106 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 6/112 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/112 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1496/1593 variables, 97/209 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1593 variables, 402/611 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1593 variables, 0/611 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/1594 variables, 1/612 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1594 variables, 0/612 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1594 variables, 0/612 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1594/1594 variables, and 612 constraints, problems are : Problem set: 5 solved, 2 unsolved in 1151 ms.
Refiners :[Domain max(s): 97/97 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 97/97 constraints, ReadFeed: 403/403 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4524ms problems are : Problem set: 5 solved, 2 unsolved
Parikh walk visited 0 properties in 2784 ms.
Support contains 40 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 1498/1498 transitions.
Graph (complete) has 1257 edges and 97 vertex of which 95 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.33 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 95 transition count 1488
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 89 transition count 1486
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 87 transition count 1486
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 19 place count 87 transition count 1484
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 85 transition count 1484
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 29 place count 79 transition count 1418
Iterating global reduction 3 with 6 rules applied. Total rules applied 35 place count 79 transition count 1418
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 78 transition count 1417
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 45 place count 78 transition count 1409
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 68 rules applied. Total rules applied 113 place count 70 transition count 1349
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 70 transition count 1349
Applied a total of 114 rules in 642 ms. Remains 70 /97 variables (removed 27) and now considering 1349/1498 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 658 ms. Remains : 70/97 places, 1349/1498 transitions.
RANDOM walk for 40000 steps (173 resets) in 1362 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (91 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (95 resets) in 523 ms. (76 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 322571 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 2
Probabilistic random walk after 322571 steps, saw 53153 distinct states, run finished after 3011 ms. (steps per millisecond=107 ) properties seen :0
// Phase 1: matrix 1349 rows 70 cols
[2024-06-01 07:07:49] [INFO ] Computed 15 invariants in 30 ms
[2024-06-01 07:07:49] [INFO ] State equation strengthened by 283 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/70 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1349/1419 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1419 variables, 283/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1419 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1419 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1419/1419 variables, and 368 constraints, problems are : Problem set: 0 solved, 2 unsolved in 773 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 70/70 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/70 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1349/1419 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1419 variables, 283/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1419 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1419 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1419/1419 variables, and 368 constraints, problems are : Problem set: 0 solved, 2 unsolved in 926 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 70/70 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1923ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2251 ms.
Support contains 40 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 1349/1349 transitions.
Applied a total of 0 rules in 103 ms. Remains 70 /70 variables (removed 0) and now considering 1349/1349 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 70/70 places, 1349/1349 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 1349/1349 transitions.
Applied a total of 0 rules in 89 ms. Remains 70 /70 variables (removed 0) and now considering 1349/1349 (removed 0) transitions.
[2024-06-01 07:07:53] [INFO ] Invariant cache hit.
[2024-06-01 07:07:53] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 07:07:53] [INFO ] Invariant cache hit.
[2024-06-01 07:07:54] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-06-01 07:07:54] [INFO ] Implicit Places using invariants and state equation in 559 ms returned [66, 68]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 675 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 68/70 places, 1349/1349 transitions.
Applied a total of 0 rules in 149 ms. Remains 68 /68 variables (removed 0) and now considering 1349/1349 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 913 ms. Remains : 68/70 places, 1349/1349 transitions.
RANDOM walk for 40000 steps (92 resets) in 2256 ms. (17 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (94 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (100 resets) in 368 ms. (108 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 348130 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 2
Probabilistic random walk after 348130 steps, saw 57107 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
// Phase 1: matrix 1349 rows 68 cols
[2024-06-01 07:07:58] [INFO ] Computed 13 invariants in 21 ms
[2024-06-01 07:07:58] [INFO ] State equation strengthened by 283 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1347/1412 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1412 variables, 282/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1412 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/1417 variables, 3/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1417 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1417 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1417 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1417/1417 variables, and 364 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 68/68 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1347/1412 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1412 variables, 282/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1412 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/1417 variables, 3/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1417 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1417 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1417 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1417/1417 variables, and 364 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1205 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 68/68 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2478ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2448 ms.
Support contains 40 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 1349/1349 transitions.
Applied a total of 0 rules in 83 ms. Remains 68 /68 variables (removed 0) and now considering 1349/1349 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 68/68 places, 1349/1349 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 1349/1349 transitions.
Applied a total of 0 rules in 82 ms. Remains 68 /68 variables (removed 0) and now considering 1349/1349 (removed 0) transitions.
[2024-06-01 07:08:03] [INFO ] Invariant cache hit.
[2024-06-01 07:08:03] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 07:08:03] [INFO ] Invariant cache hit.
[2024-06-01 07:08:04] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-06-01 07:08:04] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
[2024-06-01 07:08:04] [INFO ] Redundant transitions in 126 ms returned []
Running 1348 sub problems to find dead transitions.
[2024-06-01 07:08:04] [INFO ] Invariant cache hit.
[2024-06-01 07:08:04] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1348 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1348 unsolved
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 5 places in 1640 ms of which 22 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 68/1417 variables, and 14 constraints, problems are : Problem set: 0 solved, 1348 unsolved in 30115 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/68 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 1348/42 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1348 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1348 unsolved
Problem TDEAD1348 is UNSAT
At refinement iteration 4 (OVERLAPS) 1349/1417 variables, 68/82 constraints. Problems are: Problem set: 1 solved, 1347 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1417 variables, 283/365 constraints. Problems are: Problem set: 1 solved, 1347 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1417/1417 variables, and 406 constraints, problems are : Problem set: 1 solved, 1347 unsolved in 30302 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 68/68 constraints, ReadFeed: 283/283 constraints, PredecessorRefiner: 1347/42 constraints, Known Traps: 1/1 constraints]
After SMT, in 84207ms problems are : Problem set: 1 solved, 1347 unsolved
Search for dead transitions found 1 dead transitions in 84233ms
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 : 68/68 places, 1348/1349 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 68 transition count 1347
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 1347
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 66 transition count 1346
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 66 transition count 1346
Applied a total of 4 rules in 179 ms. Remains 66 /68 variables (removed 2) and now considering 1346/1348 (removed 2) transitions.
// Phase 1: matrix 1346 rows 66 cols
[2024-06-01 07:09:28] [INFO ] Computed 14 invariants in 15 ms
[2024-06-01 07:09:28] [INFO ] Implicit Places using invariants in 86 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 65/68 places, 1346/1349 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 1345
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 1345
Applied a total of 2 rules in 156 ms. Remains 64 /65 variables (removed 1) and now considering 1345/1346 (removed 1) transitions.
// Phase 1: matrix 1345 rows 64 cols
[2024-06-01 07:09:29] [INFO ] Computed 13 invariants in 16 ms
[2024-06-01 07:09:29] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 07:09:29] [INFO ] Invariant cache hit.
[2024-06-01 07:09:29] [INFO ] State equation strengthened by 281 read => feed constraints.
[2024-06-01 07:09:29] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 64/68 places, 1345/1349 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 86502 ms. Remains : 64/68 places, 1345/1349 transitions.
RANDOM walk for 40000 steps (72 resets) in 1385 ms. (28 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (92 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (97 resets) in 487 ms. (81 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 314905 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 2
Probabilistic random walk after 314905 steps, saw 49971 distinct states, run finished after 3006 ms. (steps per millisecond=104 ) properties seen :0
[2024-06-01 07:09:33] [INFO ] Invariant cache hit.
[2024-06-01 07:09:33] [INFO ] State equation strengthened by 281 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/64 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1345/1409 variables, 64/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1409 variables, 281/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1409 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1409 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1409/1409 variables, and 358 constraints, problems are : Problem set: 0 solved, 2 unsolved in 603 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 64/64 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/64 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1345/1409 variables, 64/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1409 variables, 281/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1409 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1409 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1409/1409 variables, and 358 constraints, problems are : Problem set: 0 solved, 2 unsolved in 984 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 64/64 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1715ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2460 ms.
Support contains 40 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 1345/1345 transitions.
Applied a total of 0 rules in 94 ms. Remains 64 /64 variables (removed 0) and now considering 1345/1345 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 64/64 places, 1345/1345 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 1345/1345 transitions.
Applied a total of 0 rules in 80 ms. Remains 64 /64 variables (removed 0) and now considering 1345/1345 (removed 0) transitions.
[2024-06-01 07:09:37] [INFO ] Invariant cache hit.
[2024-06-01 07:09:37] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 07:09:37] [INFO ] Invariant cache hit.
[2024-06-01 07:09:38] [INFO ] State equation strengthened by 281 read => feed constraints.
[2024-06-01 07:09:38] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2024-06-01 07:09:38] [INFO ] Redundant transitions in 127 ms returned []
Running 1344 sub problems to find dead transitions.
[2024-06-01 07:09:38] [INFO ] Invariant cache hit.
[2024-06-01 07:09:38] [INFO ] State equation strengthened by 281 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1344 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1344 unsolved
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 23 places in 1406 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 64/1409 variables, and 14 constraints, problems are : Problem set: 0 solved, 1344 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/64 constraints, ReadFeed: 0/281 constraints, PredecessorRefiner: 1344/39 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1344 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1344 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1344 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1344 unsolved
At refinement iteration 4 (OVERLAPS) 1345/1409 variables, 64/78 constraints. Problems are: Problem set: 0 solved, 1344 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1409 variables, 281/359 constraints. Problems are: Problem set: 0 solved, 1344 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1409 variables, 39/398 constraints. Problems are: Problem set: 0 solved, 1344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1409/1409 variables, and 398 constraints, problems are : Problem set: 0 solved, 1344 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 64/64 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 1344/39 constraints, Known Traps: 1/1 constraints]
After SMT, in 84249ms problems are : Problem set: 0 solved, 1344 unsolved
Search for dead transitions found 0 dead transitions in 84279ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85098 ms. Remains : 64/64 places, 1345/1345 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 160 ms. Remains 64 /64 variables (removed 0) and now considering 1345/1345 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-01 07:11:03] [INFO ] Invariant cache hit.
[2024-06-01 07:11:03] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-06-01 07:11:03] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 07:11:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-06-01 07:11:03] [INFO ] After 576ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :2
[2024-06-01 07:11:03] [INFO ] After 644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1065 ms.
[2024-06-01 07:11:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-06-01 07:11:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 64 places, 1345 transitions and 24866 arcs took 38 ms.
[2024-06-01 07:11:04] [INFO ] Flatten gal took : 675 ms
Total runtime 212165 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-10a-ReachabilityFireability-2024-03
Could not compute solution for formula : AutonomousCar-PT-10a-ReachabilityFireability-2024-15
BK_STOP 1717225865344
--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name AutonomousCar-PT-10a-ReachabilityFireability-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/615/inv_0_
rfs formula name AutonomousCar-PT-10a-ReachabilityFireability-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/615/inv_1_
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-10a"
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-10a, 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-171620167500367"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-10a.tgz
mv AutonomousCar-PT-10a 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 ;