About the Execution of GreatSPN+red for AutonomousCar-PT-09a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15879.831 | 200053.00 | 274121.00 | 731.20 | FTFFFFFFTTFTFFTT | 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.r025-smll-171620166400350.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 greatspnxred
Input is AutonomousCar-PT-09a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166400350
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 23K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 18:03 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 781K 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-09a-ReachabilityCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2024-12
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2024-13
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2024-14
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716356479944
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 05:41:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 05:41:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 05:41:23] [INFO ] Load time of PNML (sax parser for PT used): 455 ms
[2024-05-22 05:41:23] [INFO ] Transformed 89 places.
[2024-05-22 05:41:23] [INFO ] Transformed 1249 transitions.
[2024-05-22 05:41:23] [INFO ] Found NUPN structural information;
[2024-05-22 05:41:23] [INFO ] Parsed PT model containing 89 places and 1249 transitions and 15631 arcs in 727 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 345 transitions
Reduce redundant transitions removed 345 transitions.
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1979 resets) in 5293 ms. (7 steps per ms) remains 1/10 properties
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (153 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
[2024-05-22 05:41:24] [INFO ] Flow matrix only has 903 transitions (discarded 1 similar events)
// Phase 1: matrix 903 rows 89 cols
[2024-05-22 05:41:24] [INFO ] Computed 14 invariants in 44 ms
[2024-05-22 05:41:24] [INFO ] State equation strengthened by 327 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/10 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/89 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 79/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 902/991 variables, 89/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/991 variables, 326/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:41:26] [INFO ] Deduced a trap composed of 15 places in 761 ms of which 18 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/991 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/991 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/992 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/992 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/992 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 992/992 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2190 ms.
Refiners :[Domain max(s): 89/89 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 89/89 constraints, ReadFeed: 327/327 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/10 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 79/89 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 79/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 902/991 variables, 89/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/991 variables, 326/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/991 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/991 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/992 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/992 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/992 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 992/992 variables, and 521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 895 ms.
Refiners :[Domain max(s): 89/89 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 89/89 constraints, ReadFeed: 327/327 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 3242ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 446 ms.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 904/904 transitions.
Graph (complete) has 1045 edges and 89 vertex of which 87 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.42 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 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 87 transition count 891
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 21 place count 78 transition count 891
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 21 place count 78 transition count 890
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 77 transition count 890
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 32 place count 68 transition count 800
Iterating global reduction 2 with 9 rules applied. Total rules applied 41 place count 68 transition count 800
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 45 place count 66 transition count 798
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 54 place count 66 transition count 789
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 81 rules applied. Total rules applied 135 place count 57 transition count 717
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 57 transition count 717
Applied a total of 136 rules in 553 ms. Remains 57 /89 variables (removed 32) and now considering 717/904 (removed 187) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 572 ms. Remains : 57/89 places, 717/904 transitions.
RANDOM walk for 40000 steps (14 resets) in 896 ms. (44 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (251 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 911039 steps, run timeout after 3001 ms. (steps per millisecond=303 ) properties seen :0 out of 1
Probabilistic random walk after 911039 steps, saw 114393 distinct states, run finished after 3010 ms. (steps per millisecond=302 ) properties seen :0
// Phase 1: matrix 717 rows 57 cols
[2024-05-22 05:41:32] [INFO ] Computed 14 invariants in 15 ms
[2024-05-22 05:41:32] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/57 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 717/774 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/774 variables, 174/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/774 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/774 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 245 constraints, problems are : Problem set: 0 solved, 1 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 57/57 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/57 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:41:33] [INFO ] Deduced a trap composed of 4 places in 645 ms of which 3 ms to minimize.
[2024-05-22 05:41:34] [INFO ] Deduced a trap composed of 14 places in 644 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 717/774 variables, 57/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/774 variables, 174/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/774 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/774 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 774/774 variables, and 248 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1858 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 57/57 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2358ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 448 ms.
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 717/717 transitions.
Applied a total of 0 rules in 83 ms. Remains 57 /57 variables (removed 0) and now considering 717/717 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 57/57 places, 717/717 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 717/717 transitions.
Applied a total of 0 rules in 99 ms. Remains 57 /57 variables (removed 0) and now considering 717/717 (removed 0) transitions.
[2024-05-22 05:41:35] [INFO ] Invariant cache hit.
[2024-05-22 05:41:35] [INFO ] Implicit Places using invariants in 474 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 489 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 56/57 places, 717/717 transitions.
Applied a total of 0 rules in 51 ms. Remains 56 /56 variables (removed 0) and now considering 717/717 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 642 ms. Remains : 56/57 places, 717/717 transitions.
RANDOM walk for 40000 steps (18 resets) in 1225 ms. (32 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (247 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1020315 steps, run timeout after 3001 ms. (steps per millisecond=339 ) properties seen :0 out of 1
Probabilistic random walk after 1020315 steps, saw 127266 distinct states, run finished after 3002 ms. (steps per millisecond=339 ) properties seen :0
// Phase 1: matrix 717 rows 56 cols
[2024-05-22 05:41:39] [INFO ] Computed 13 invariants in 8 ms
[2024-05-22 05:41:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/56 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:41:39] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 717/773 variables, 56/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/773 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/773 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/773 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 773/773 variables, and 71 constraints, problems are : Problem set: 0 solved, 1 unsolved in 934 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/56 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:41:41] [INFO ] Deduced a trap composed of 5 places in 638 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 717/773 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/773 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/773 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/773 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/773 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 773/773 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 989 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1950ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 330 ms.
Support contains 2 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 717/717 transitions.
Applied a total of 0 rules in 62 ms. Remains 56 /56 variables (removed 0) and now considering 717/717 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 56/56 places, 717/717 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 717/717 transitions.
Applied a total of 0 rules in 62 ms. Remains 56 /56 variables (removed 0) and now considering 717/717 (removed 0) transitions.
[2024-05-22 05:41:41] [INFO ] Invariant cache hit.
[2024-05-22 05:41:42] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-05-22 05:41:42] [INFO ] Invariant cache hit.
[2024-05-22 05:41:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 05:41:43] [INFO ] Implicit Places using invariants and state equation in 733 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1200 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 55/56 places, 717/717 transitions.
Applied a total of 0 rules in 39 ms. Remains 55 /55 variables (removed 0) and now considering 717/717 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1304 ms. Remains : 55/56 places, 717/717 transitions.
RANDOM walk for 40000 steps (36 resets) in 1829 ms. (21 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (245 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1120511 steps, run timeout after 3001 ms. (steps per millisecond=373 ) properties seen :0 out of 1
Probabilistic random walk after 1120511 steps, saw 139867 distinct states, run finished after 3001 ms. (steps per millisecond=373 ) properties seen :0
// Phase 1: matrix 717 rows 55 cols
[2024-05-22 05:41:46] [INFO ] Computed 12 invariants in 11 ms
[2024-05-22 05:41:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/53 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:41:47] [INFO ] Deduced a trap composed of 4 places in 605 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 717/770 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/772 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/772 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/772 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 772/772 variables, and 69 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1048 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/53 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 717/770 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/772 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/772 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:41:48] [INFO ] Deduced a trap composed of 21 places in 718 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/772 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/772 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/772 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 772/772 variables, and 71 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1136 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2221ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 435 ms.
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 717/717 transitions.
Applied a total of 0 rules in 61 ms. Remains 55 /55 variables (removed 0) and now considering 717/717 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 55/55 places, 717/717 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 717/717 transitions.
Applied a total of 0 rules in 60 ms. Remains 55 /55 variables (removed 0) and now considering 717/717 (removed 0) transitions.
[2024-05-22 05:41:49] [INFO ] Invariant cache hit.
[2024-05-22 05:41:49] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-22 05:41:49] [INFO ] Invariant cache hit.
[2024-05-22 05:41:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 05:41:50] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
[2024-05-22 05:41:50] [INFO ] Redundant transitions in 79 ms returned []
Running 716 sub problems to find dead transitions.
[2024-05-22 05:41:50] [INFO ] Invariant cache hit.
[2024-05-22 05:41:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 716 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 716 unsolved
[2024-05-22 05:42:17] [INFO ] Deduced a trap composed of 21 places in 754 ms of which 3 ms to minimize.
[2024-05-22 05:42:17] [INFO ] Deduced a trap composed of 4 places in 792 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 716 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 716 unsolved
Problem TDEAD716 is UNSAT
At refinement iteration 4 (OVERLAPS) 717/772 variables, 55/69 constraints. Problems are: Problem set: 1 solved, 715 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/772 variables, 1/70 constraints. Problems are: Problem set: 1 solved, 715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 772/772 variables, and 70 constraints, problems are : Problem set: 1 solved, 715 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 716/716 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 715 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 715 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 715 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 715 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 715 unsolved
At refinement iteration 4 (OVERLAPS) 717/772 variables, 55/69 constraints. Problems are: Problem set: 1 solved, 715 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/772 variables, 1/70 constraints. Problems are: Problem set: 1 solved, 715 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 772/772 variables, and 785 constraints, problems are : Problem set: 1 solved, 715 unsolved in 32546 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 715/716 constraints, Known Traps: 2/2 constraints]
After SMT, in 79013ms problems are : Problem set: 1 solved, 715 unsolved
Search for dead transitions found 1 dead transitions in 79040ms
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 : 55/55 places, 716/717 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 54 transition count 715
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 715
Applied a total of 2 rules in 61 ms. Remains 54 /55 variables (removed 1) and now considering 715/716 (removed 1) transitions.
// Phase 1: matrix 715 rows 54 cols
[2024-05-22 05:43:09] [INFO ] Computed 13 invariants in 7 ms
[2024-05-22 05:43:10] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-22 05:43:10] [INFO ] Invariant cache hit.
[2024-05-22 05:43:10] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 1104 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 54/55 places, 715/717 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 81596 ms. Remains : 54/55 places, 715/717 transitions.
RANDOM walk for 40000 steps (19 resets) in 786 ms. (50 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (246 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 929373 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :0 out of 1
Probabilistic random walk after 929373 steps, saw 115919 distinct states, run finished after 3001 ms. (steps per millisecond=309 ) properties seen :0
[2024-05-22 05:43:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/54 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 715/769 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/769 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 769/769 variables, and 67 constraints, problems are : Problem set: 0 solved, 1 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/54 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 715/769 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:43:15] [INFO ] Deduced a trap composed of 21 places in 735 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/769 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 769/769 variables, and 69 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1163 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1578ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 378 ms.
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 715/715 transitions.
Applied a total of 0 rules in 66 ms. Remains 54 /54 variables (removed 0) and now considering 715/715 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 54/54 places, 715/715 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 715/715 transitions.
Applied a total of 0 rules in 67 ms. Remains 54 /54 variables (removed 0) and now considering 715/715 (removed 0) transitions.
[2024-05-22 05:43:16] [INFO ] Invariant cache hit.
[2024-05-22 05:43:16] [INFO ] Implicit Places using invariants in 497 ms returned []
[2024-05-22 05:43:16] [INFO ] Invariant cache hit.
[2024-05-22 05:43:17] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1380 ms to find 0 implicit places.
[2024-05-22 05:43:17] [INFO ] Redundant transitions in 190 ms returned []
Running 714 sub problems to find dead transitions.
[2024-05-22 05:43:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 714 unsolved
[2024-05-22 05:43:43] [INFO ] Deduced a trap composed of 21 places in 482 ms of which 1 ms to minimize.
[2024-05-22 05:43:44] [INFO ] Deduced a trap composed of 4 places in 748 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 4 (OVERLAPS) 715/769 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 714 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/769 variables, and 69 constraints, problems are : Problem set: 0 solved, 714 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 714/714 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 714 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 4 (OVERLAPS) 715/769 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 714 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/769 variables, and 783 constraints, problems are : Problem set: 0 solved, 714 unsolved in 32404 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 714/714 constraints, Known Traps: 2/2 constraints]
After SMT, in 79039ms problems are : Problem set: 0 solved, 714 unsolved
Search for dead transitions found 0 dead transitions in 79055ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80719 ms. Remains : 54/54 places, 715/715 transitions.
[2024-05-22 05:44:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-22 05:44:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 715 transitions and 11348 arcs took 32 ms.
[2024-05-22 05:44:37] [INFO ] Flatten gal took : 564 ms
Total runtime 195676 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running AutonomousCar-PT-09a
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 54
TRANSITIONS: 715
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.067s, Sys 0.003s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.006s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 679
MODEL NAME: /home/mcc/execution/412/model
54 places, 715 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716356679997
--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
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-09a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is AutonomousCar-PT-09a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r025-smll-171620166400350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-09a.tgz
mv AutonomousCar-PT-09a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;