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-171620166400342.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-08b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166400342
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 517K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716355386885

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-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 05:23:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 05:23:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 05:23:09] [INFO ] Load time of PNML (sax parser for PT used): 304 ms
[2024-05-22 05:23:09] [INFO ] Transformed 357 places.
[2024-05-22 05:23:09] [INFO ] Transformed 1128 transitions.
[2024-05-22 05:23:09] [INFO ] Found NUPN structural information;
[2024-05-22 05:23:09] [INFO ] Parsed PT model containing 357 places and 1128 transitions and 9454 arcs in 538 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 50 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (164 resets) in 2504 ms. (15 steps per ms) remains 4/14 properties
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (43 resets) in 744 ms. (53 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (52 resets) in 215 ms. (185 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (43 resets) in 341 ms. (116 steps per ms) remains 3/4 properties
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (55 resets) in 420 ms. (95 steps per ms) remains 3/3 properties
// Phase 1: matrix 1128 rows 357 cols
[2024-05-22 05:23:11] [INFO ] Computed 13 invariants in 46 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 319/357 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 319/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AutonomousCar-PT-08b-ReachabilityCardinality-2024-01 is UNSAT
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 1128/1485 variables, 357/727 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1485 variables, 0/727 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1485 variables, 0/727 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1485/1485 variables, and 727 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1230 ms.
Refiners :[Domain max(s): 357/357 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 176/190 variables, 6/20 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 176/196 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 05:23:13] [INFO ] Deduced a trap composed of 42 places in 316 ms of which 26 ms to minimize.
[2024-05-22 05:23:13] [INFO ] Deduced a trap composed of 35 places in 395 ms of which 4 ms to minimize.
[2024-05-22 05:23:14] [INFO ] Deduced a trap composed of 45 places in 443 ms of which 4 ms to minimize.
[2024-05-22 05:23:14] [INFO ] Deduced a trap composed of 52 places in 377 ms of which 4 ms to minimize.
[2024-05-22 05:23:15] [INFO ] Deduced a trap composed of 57 places in 371 ms of which 3 ms to minimize.
[2024-05-22 05:23:15] [INFO ] Deduced a trap composed of 50 places in 355 ms of which 3 ms to minimize.
[2024-05-22 05:23:15] [INFO ] Deduced a trap composed of 46 places in 281 ms of which 3 ms to minimize.
[2024-05-22 05:23:15] [INFO ] Deduced a trap composed of 52 places in 230 ms of which 3 ms to minimize.
Problem AutonomousCar-PT-08b-ReachabilityCardinality-2024-11 is UNSAT
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 8/204 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/204 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 167/357 variables, 7/211 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 167/378 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-22 05:23:16] [INFO ] Deduced a trap composed of 42 places in 582 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 1/379 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/379 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1128/1485 variables, 357/736 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1485 variables, 1/737 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-22 05:23:17] [INFO ] Deduced a trap composed of 30 places in 537 ms of which 4 ms to minimize.
[2024-05-22 05:23:18] [INFO ] Deduced a trap composed of 33 places in 533 ms of which 4 ms to minimize.
SMT process timed out in 6948ms, After SMT, problems are : Problem set: 2 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 1128/1128 transitions.
Graph (trivial) has 330 edges and 357 vertex of which 4 / 357 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1428 edges and 355 vertex of which 348 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.21 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 150 rules applied. Total rules applied 152 place count 348 transition count 969
Reduce places removed 148 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 190 rules applied. Total rules applied 342 place count 200 transition count 927
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 26 rules applied. Total rules applied 368 place count 176 transition count 925
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 370 place count 174 transition count 925
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 370 place count 174 transition count 919
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 382 place count 168 transition count 919
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 411 place count 139 transition count 890
Iterating global reduction 4 with 29 rules applied. Total rules applied 440 place count 139 transition count 890
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 4 with 256 rules applied. Total rules applied 696 place count 139 transition count 634
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 696 place count 139 transition count 632
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 700 place count 137 transition count 632
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 708 place count 129 transition count 575
Iterating global reduction 5 with 8 rules applied. Total rules applied 716 place count 129 transition count 575
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 5 with 12 rules applied. Total rules applied 728 place count 129 transition count 563
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 734 place count 123 transition count 563
Performed 42 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 7 with 84 rules applied. Total rules applied 818 place count 81 transition count 520
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 825 place count 74 transition count 457
Iterating global reduction 7 with 7 rules applied. Total rules applied 832 place count 74 transition count 457
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 833 place count 74 transition count 456
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 844 place count 74 transition count 445
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 855 place count 63 transition count 445
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 857 place count 63 transition count 443
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 858 place count 63 transition count 443
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 859 place count 62 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 860 place count 61 transition count 442
Applied a total of 860 rules in 559 ms. Remains 61 /357 variables (removed 296) and now considering 442/1128 (removed 686) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 577 ms. Remains : 61/357 places, 442/1128 transitions.
RANDOM walk for 40000 steps (510 resets) in 596 ms. (67 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (262 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1370978 steps, run timeout after 3001 ms. (steps per millisecond=456 ) properties seen :0 out of 1
Probabilistic random walk after 1370978 steps, saw 195738 distinct states, run finished after 3006 ms. (steps per millisecond=456 ) properties seen :0
// Phase 1: matrix 442 rows 61 cols
[2024-05-22 05:23:22] [INFO ] Computed 12 invariants in 6 ms
[2024-05-22 05:23:22] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/30 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 364/394 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 109/503 variables, 31/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/503 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 74 constraints, problems are : Problem set: 0 solved, 1 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/30 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 364/394 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 109/503 variables, 31/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/503 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/503 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 75 constraints, problems are : Problem set: 0 solved, 1 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 636ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 100 ms.
Support contains 8 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 442/442 transitions.
Applied a total of 0 rules in 39 ms. Remains 61 /61 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 61/61 places, 442/442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 442/442 transitions.
Applied a total of 0 rules in 50 ms. Remains 61 /61 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-05-22 05:23:23] [INFO ] Invariant cache hit.
[2024-05-22 05:23:23] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-22 05:23:23] [INFO ] Invariant cache hit.
[2024-05-22 05:23:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 05:23:24] [INFO ] Implicit Places using invariants and state equation in 556 ms returned [53, 60]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 925 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/61 places, 442/442 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 58 transition count 441
Applied a total of 2 rules in 45 ms. Remains 58 /59 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 58 cols
[2024-05-22 05:23:24] [INFO ] Computed 10 invariants in 7 ms
[2024-05-22 05:23:24] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-22 05:23:24] [INFO ] Invariant cache hit.
[2024-05-22 05:23:24] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/61 places, 441/442 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1816 ms. Remains : 58/61 places, 441/442 transitions.
RANDOM walk for 40000 steps (443 resets) in 2917 ms. (13 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (270 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1396356 steps, run timeout after 3001 ms. (steps per millisecond=465 ) properties seen :0 out of 1
Probabilistic random walk after 1396356 steps, saw 197869 distinct states, run finished after 3001 ms. (steps per millisecond=465 ) properties seen :0
[2024-05-22 05:23:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 363/390 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 109/499 variables, 31/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/499 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 68 constraints, problems are : Problem set: 0 solved, 1 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 58/58 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 363/390 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 109/499 variables, 31/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/499 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 69 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 575ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 8 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 441/441 transitions.
Applied a total of 0 rules in 18 ms. Remains 58 /58 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 58/58 places, 441/441 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 441/441 transitions.
Applied a total of 0 rules in 18 ms. Remains 58 /58 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-05-22 05:23:29] [INFO ] Invariant cache hit.
[2024-05-22 05:23:29] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-22 05:23:29] [INFO ] Invariant cache hit.
[2024-05-22 05:23:30] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1095 ms to find 0 implicit places.
[2024-05-22 05:23:30] [INFO ] Redundant transitions in 62 ms returned []
Running 440 sub problems to find dead transitions.
[2024-05-22 05:23:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-05-22 05:23:40] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 2 ms to minimize.
[2024-05-22 05:23:41] [INFO ] Deduced a trap composed of 9 places in 380 ms of which 2 ms to minimize.
[2024-05-22 05:23:41] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 1 ms to minimize.
[2024-05-22 05:23:41] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 1 ms to minimize.
[2024-05-22 05:23:41] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 2 ms to minimize.
[2024-05-22 05:23:42] [INFO ] Deduced a trap composed of 9 places in 260 ms of which 2 ms to minimize.
[2024-05-22 05:23:42] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 1 ms to minimize.
[2024-05-22 05:23:42] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Problem TDEAD370 is UNSAT
At refinement iteration 5 (OVERLAPS) 441/499 variables, 58/76 constraints. Problems are: Problem set: 1 solved, 439 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 439 unsolved
At refinement iteration 7 (OVERLAPS) 0/499 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 439 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 76 constraints, problems are : Problem set: 1 solved, 439 unsolved in 23008 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 1 solved, 439 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 439 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 7/15 constraints. Problems are: Problem set: 1 solved, 439 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 439 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 2/17 constraints. Problems are: Problem set: 1 solved, 439 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 439 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 439 unsolved
At refinement iteration 6 (OVERLAPS) 441/499 variables, 58/76 constraints. Problems are: Problem set: 1 solved, 439 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 439/515 constraints. Problems are: Problem set: 1 solved, 439 unsolved
[2024-05-22 05:24:26] [INFO ] Deduced a trap composed of 20 places in 324 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/499 variables, and 516 constraints, problems are : Problem set: 1 solved, 439 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 439/440 constraints, Known Traps: 9/9 constraints]
After SMT, in 58981ms problems are : Problem set: 1 solved, 439 unsolved
Search for dead transitions found 1 dead transitions in 58995ms
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 : 58/58 places, 440/441 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 57 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 439
Applied a total of 2 rules in 39 ms. Remains 57 /58 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 57 cols
[2024-05-22 05:24:29] [INFO ] Computed 10 invariants in 7 ms
[2024-05-22 05:24:30] [INFO ] Implicit Places using invariants in 552 ms returned []
[2024-05-22 05:24:30] [INFO ] Invariant cache hit.
[2024-05-22 05:24:30] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 1000 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 57/58 places, 439/441 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61231 ms. Remains : 57/58 places, 439/441 transitions.
RANDOM walk for 40000 steps (432 resets) in 517 ms. (77 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (269 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1345186 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :0 out of 1
Probabilistic random walk after 1345186 steps, saw 188816 distinct states, run finished after 3001 ms. (steps per millisecond=448 ) properties seen :0
[2024-05-22 05:24:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 362/389 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 107/496 variables, 30/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/496 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 67 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 362/389 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 107/496 variables, 30/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/496 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 68 constraints, problems are : Problem set: 0 solved, 1 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 431ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 8 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 439/439 transitions.
Applied a total of 0 rules in 17 ms. Remains 57 /57 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 57/57 places, 439/439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 439/439 transitions.
Applied a total of 0 rules in 17 ms. Remains 57 /57 variables (removed 0) and now considering 439/439 (removed 0) transitions.
[2024-05-22 05:24:34] [INFO ] Invariant cache hit.
[2024-05-22 05:24:34] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-22 05:24:34] [INFO ] Invariant cache hit.
[2024-05-22 05:24:34] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
[2024-05-22 05:24:34] [INFO ] Redundant transitions in 8 ms returned []
Running 438 sub problems to find dead transitions.
[2024-05-22 05:24:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-22 05:24:44] [INFO ] Deduced a trap composed of 7 places in 354 ms of which 1 ms to minimize.
[2024-05-22 05:24:44] [INFO ] Deduced a trap composed of 9 places in 336 ms of which 2 ms to minimize.
[2024-05-22 05:24:44] [INFO ] Deduced a trap composed of 9 places in 285 ms of which 1 ms to minimize.
[2024-05-22 05:24:45] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 1 ms to minimize.
[2024-05-22 05:24:45] [INFO ] Deduced a trap composed of 9 places in 253 ms of which 2 ms to minimize.
[2024-05-22 05:24:45] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 1 ms to minimize.
[2024-05-22 05:24:45] [INFO ] Deduced a trap composed of 9 places in 228 ms of which 1 ms to minimize.
[2024-05-22 05:24:45] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 5 (OVERLAPS) 439/496 variables, 57/75 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 7 (OVERLAPS) 0/496 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 438 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 75 constraints, problems are : Problem set: 0 solved, 438 unsolved in 25474 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 438 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (OVERLAPS) 1/57 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 6 (OVERLAPS) 439/496 variables, 57/75 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 438/513 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-05-22 05:25:31] [INFO ] Deduced a trap composed of 20 places in 301 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 514 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 9/9 constraints]
After SMT, in 60231ms problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 60236ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60936 ms. Remains : 57/57 places, 439/439 transitions.
[2024-05-22 05:25:35] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2024-05-22 05:25:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 57 places, 439 transitions and 5554 arcs took 15 ms.
[2024-05-22 05:25:35] [INFO ] Flatten gal took : 244 ms
Total runtime 146365 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-08b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 57
TRANSITIONS: 439
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.059s, Sys 0.003s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.005s, 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: 724
MODEL NAME: /home/mcc/execution/414/model
57 places, 439 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.
Building monolithic NSF...
FORMULA AutonomousCar-PT-08b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716355537221

--------------------
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-08b"
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-08b, 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-171620166400342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-08b.tgz
mv AutonomousCar-PT-08b execution
cd execution
if [ "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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;