Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r468-smll-171620167200182.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is AutoFlight-PT-24b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167200182
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 22:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 120K Apr 12 22:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 538K 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 AutoFlight-PT-24b-ReachabilityCardinality-2024-00
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-2024-01
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-2024-02
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-2024-03
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-2024-04
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-2024-05
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-2024-06
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-2024-07
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-2024-08
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-2024-09
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-2024-10
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-2024-11
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-2024-12
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-2024-13
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-2024-14
FORMULA_NAME AutoFlight-PT-24b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717197653084

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-24b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:20:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:20:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:20:55] [INFO ] Load time of PNML (sax parser for PT used): 293 ms
[2024-05-31 23:20:55] [INFO ] Transformed 2230 places.
[2024-05-31 23:20:55] [INFO ] Transformed 2228 transitions.
[2024-05-31 23:20:55] [INFO ] Found NUPN structural information;
[2024-05-31 23:20:55] [INFO ] Parsed PT model containing 2230 places and 2228 transitions and 5186 arcs in 528 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 102 ms.
Working with output stream class java.io.PrintStream
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (36 resets) in 2127 ms. (18 steps per ms) remains 5/15 properties
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 625 ms. (63 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 680 ms. (58 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 442 ms. (90 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 5/5 properties
// Phase 1: matrix 2228 rows 2230 cols
[2024-05-31 23:20:57] [INFO ] Computed 148 invariants in 74 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 145/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1873/2018 variables, 134/279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2018 variables, 1873/2152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2018 variables, 0/2152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 97/2115 variables, 13/2165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2115 variables, 97/2262 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2115 variables, 0/2262 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AutoFlight-PT-24b-ReachabilityCardinality-2024-08 is UNSAT
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 115/2230 variables, 1/2263 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2230 variables, 115/2378 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2230 variables, 0/2378 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2228/4458 variables, 2230/4608 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4458 variables, 0/4608 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/4458 variables, 0/4608 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4458/4458 variables, and 4608 constraints, problems are : Problem set: 1 solved, 4 unsolved in 4710 ms.
Refiners :[Domain max(s): 2230/2230 constraints, Positive P Invariants (semi-flows): 147/147 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 2230/2230 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1886/2003 variables, 132/249 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2003 variables, 1886/2135 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-31 23:21:03] [INFO ] Deduced a trap composed of 23 places in 695 ms of which 82 ms to minimize.
[2024-05-31 23:21:04] [INFO ] Deduced a trap composed of 47 places in 583 ms of which 9 ms to minimize.
[2024-05-31 23:21:04] [INFO ] Deduced a trap composed of 69 places in 453 ms of which 8 ms to minimize.
[2024-05-31 23:21:05] [INFO ] Deduced a trap composed of 48 places in 533 ms of which 8 ms to minimize.
[2024-05-31 23:21:05] [INFO ] Deduced a trap composed of 47 places in 523 ms of which 7 ms to minimize.
[2024-05-31 23:21:06] [INFO ] Deduced a trap composed of 97 places in 466 ms of which 7 ms to minimize.
[2024-05-31 23:21:06] [INFO ] Deduced a trap composed of 113 places in 460 ms of which 7 ms to minimize.
[2024-05-31 23:21:07] [INFO ] Deduced a trap composed of 73 places in 489 ms of which 9 ms to minimize.
SMT process timed out in 10456ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 117 out of 2230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 773 transitions
Trivial Post-agglo rules discarded 773 transitions
Performed 773 trivial Post agglomeration. Transition count delta: 773
Iterating post reduction 0 with 773 rules applied. Total rules applied 773 place count 2230 transition count 1455
Reduce places removed 773 places and 0 transitions.
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 896 rules applied. Total rules applied 1669 place count 1457 transition count 1332
Reduce places removed 32 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 2 with 74 rules applied. Total rules applied 1743 place count 1425 transition count 1290
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 52 rules applied. Total rules applied 1795 place count 1383 transition count 1280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1796 place count 1382 transition count 1280
Performed 255 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 255 Pre rules applied. Total rules applied 1796 place count 1382 transition count 1025
Deduced a syphon composed of 255 places in 15 ms
Reduce places removed 255 places and 0 transitions.
Iterating global reduction 5 with 510 rules applied. Total rules applied 2306 place count 1127 transition count 1025
Discarding 192 places :
Symmetric choice reduction at 5 with 192 rule applications. Total rules 2498 place count 935 transition count 833
Iterating global reduction 5 with 192 rules applied. Total rules applied 2690 place count 935 transition count 833
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2694 place count 935 transition count 829
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 59 Pre rules applied. Total rules applied 2694 place count 935 transition count 770
Deduced a syphon composed of 59 places in 11 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 6 with 118 rules applied. Total rules applied 2812 place count 876 transition count 770
Performed 184 Post agglomeration using F-continuation condition.Transition count delta: 184
Deduced a syphon composed of 184 places in 2 ms
Reduce places removed 184 places and 0 transitions.
Iterating global reduction 6 with 368 rules applied. Total rules applied 3180 place count 692 transition count 586
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 3186 place count 689 transition count 586
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 3198 place count 689 transition count 574
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 6 with 4 rules applied. Total rules applied 3202 place count 687 transition count 572
Free-agglomeration rule applied 87 times.
Iterating global reduction 6 with 87 rules applied. Total rules applied 3289 place count 687 transition count 485
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 6 with 87 rules applied. Total rules applied 3376 place count 600 transition count 485
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 3377 place count 599 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 3379 place count 597 transition count 484
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 3379 place count 597 transition count 482
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 3383 place count 595 transition count 482
Applied a total of 3383 rules in 854 ms. Remains 595 /2230 variables (removed 1635) and now considering 482/2228 (removed 1746) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 871 ms. Remains : 595/2230 places, 482/2228 transitions.
RANDOM walk for 40000 steps (274 resets) in 1126 ms. (35 steps per ms) remains 3/4 properties
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (28 resets) in 413 ms. (96 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (28 resets) in 174 ms. (228 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (25 resets) in 289 ms. (137 steps per ms) remains 3/3 properties
// Phase 1: matrix 482 rows 595 cols
[2024-05-31 23:21:09] [INFO ] Computed 146 invariants in 8 ms
[2024-05-31 23:21:09] [INFO ] State equation strengthened by 172 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 348/433 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 88/521 variables, 15/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/521 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 72/593 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/593 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 482/1075 variables, 593/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1075 variables, 172/910 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1075 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/1077 variables, 2/912 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1077 variables, 1/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1077 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1077 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1077/1077 variables, and 913 constraints, problems are : Problem set: 0 solved, 3 unsolved in 999 ms.
Refiners :[Positive P Invariants (semi-flows): 144/144 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 595/595 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 348/433 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 23:21:10] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-31 23:21:10] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-05-31 23:21:10] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
[2024-05-31 23:21:10] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-31 23:21:10] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-05-31 23:21:10] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-31 23:21:10] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-31 23:21:10] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 2 ms to minimize.
[2024-05-31 23:21:10] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 2 ms to minimize.
[2024-05-31 23:21:11] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:21:11] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:21:11] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-31 23:21:11] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-31 23:21:11] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 2 ms to minimize.
[2024-05-31 23:21:11] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
[2024-05-31 23:21:11] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 16/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 23:21:11] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 3 ms to minimize.
[2024-05-31 23:21:11] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 2 ms to minimize.
[2024-05-31 23:21:11] [INFO ] Deduced a trap composed of 79 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:21:11] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:21:11] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 5/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 88/521 variables, 15/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 23:21:12] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 3 ms to minimize.
[2024-05-31 23:21:12] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:21:12] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 2 ms to minimize.
[2024-05-31 23:21:12] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
[2024-05-31 23:21:12] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 7 ms to minimize.
[2024-05-31 23:21:12] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 2 ms to minimize.
[2024-05-31 23:21:12] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-31 23:21:12] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-31 23:21:12] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 9/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 72/593 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 23:21:12] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 4 ms to minimize.
[2024-05-31 23:21:13] [INFO ] Deduced a trap composed of 131 places in 163 ms of which 5 ms to minimize.
[2024-05-31 23:21:13] [INFO ] Deduced a trap composed of 134 places in 169 ms of which 4 ms to minimize.
[2024-05-31 23:21:13] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 4 ms to minimize.
Problem AutoFlight-PT-24b-ReachabilityCardinality-2024-05 is UNSAT
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-31 23:21:13] [INFO ] Deduced a trap composed of 135 places in 163 ms of which 4 ms to minimize.
[2024-05-31 23:21:13] [INFO ] Deduced a trap composed of 129 places in 158 ms of which 4 ms to minimize.
[2024-05-31 23:21:13] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 4 ms to minimize.
[2024-05-31 23:21:14] [INFO ] Deduced a trap composed of 149 places in 168 ms of which 3 ms to minimize.
[2024-05-31 23:21:14] [INFO ] Deduced a trap composed of 133 places in 171 ms of which 4 ms to minimize.
[2024-05-31 23:21:14] [INFO ] Deduced a trap composed of 135 places in 170 ms of which 3 ms to minimize.
[2024-05-31 23:21:14] [INFO ] Deduced a trap composed of 133 places in 175 ms of which 4 ms to minimize.
[2024-05-31 23:21:14] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 3 ms to minimize.
[2024-05-31 23:21:15] [INFO ] Deduced a trap composed of 131 places in 174 ms of which 7 ms to minimize.
[2024-05-31 23:21:15] [INFO ] Deduced a trap composed of 133 places in 183 ms of which 4 ms to minimize.
[2024-05-31 23:21:15] [INFO ] Deduced a trap composed of 133 places in 181 ms of which 3 ms to minimize.
[2024-05-31 23:21:15] [INFO ] Deduced a trap composed of 135 places in 168 ms of which 4 ms to minimize.
[2024-05-31 23:21:15] [INFO ] Deduced a trap composed of 154 places in 170 ms of which 3 ms to minimize.
[2024-05-31 23:21:16] [INFO ] Deduced a trap composed of 199 places in 174 ms of which 5 ms to minimize.
[2024-05-31 23:21:16] [INFO ] Deduced a trap composed of 59 places in 192 ms of which 4 ms to minimize.
[2024-05-31 23:21:16] [INFO ] Deduced a trap composed of 132 places in 187 ms of which 5 ms to minimize.
Problem AutoFlight-PT-24b-ReachabilityCardinality-2024-05 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 20/195 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-31 23:21:16] [INFO ] Deduced a trap composed of 193 places in 166 ms of which 3 ms to minimize.
[2024-05-31 23:21:16] [INFO ] Deduced a trap composed of 206 places in 162 ms of which 3 ms to minimize.
[2024-05-31 23:21:17] [INFO ] Deduced a trap composed of 195 places in 157 ms of which 3 ms to minimize.
[2024-05-31 23:21:17] [INFO ] Deduced a trap composed of 197 places in 154 ms of which 4 ms to minimize.
[2024-05-31 23:21:17] [INFO ] Deduced a trap composed of 155 places in 155 ms of which 4 ms to minimize.
[2024-05-31 23:21:17] [INFO ] Deduced a trap composed of 225 places in 166 ms of which 4 ms to minimize.
[2024-05-31 23:21:17] [INFO ] Deduced a trap composed of 199 places in 172 ms of which 3 ms to minimize.
[2024-05-31 23:21:17] [INFO ] Deduced a trap composed of 155 places in 168 ms of which 4 ms to minimize.
[2024-05-31 23:21:18] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 4 ms to minimize.
[2024-05-31 23:21:18] [INFO ] Deduced a trap composed of 132 places in 166 ms of which 3 ms to minimize.
[2024-05-31 23:21:18] [INFO ] Deduced a trap composed of 157 places in 161 ms of which 3 ms to minimize.
[2024-05-31 23:21:18] [INFO ] Deduced a trap composed of 157 places in 152 ms of which 3 ms to minimize.
[2024-05-31 23:21:18] [INFO ] Deduced a trap composed of 140 places in 158 ms of which 4 ms to minimize.
[2024-05-31 23:21:18] [INFO ] Deduced a trap composed of 222 places in 163 ms of which 3 ms to minimize.
[2024-05-31 23:21:19] [INFO ] Deduced a trap composed of 137 places in 170 ms of which 4 ms to minimize.
[2024-05-31 23:21:19] [INFO ] Deduced a trap composed of 140 places in 174 ms of which 3 ms to minimize.
[2024-05-31 23:21:19] [INFO ] Deduced a trap composed of 147 places in 161 ms of which 4 ms to minimize.
[2024-05-31 23:21:19] [INFO ] Deduced a trap composed of 144 places in 156 ms of which 3 ms to minimize.
[2024-05-31 23:21:19] [INFO ] Deduced a trap composed of 168 places in 158 ms of which 4 ms to minimize.
[2024-05-31 23:21:20] [INFO ] Deduced a trap composed of 160 places in 164 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/593 variables, 20/215 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-31 23:21:20] [INFO ] Deduced a trap composed of 197 places in 171 ms of which 3 ms to minimize.
[2024-05-31 23:21:20] [INFO ] Deduced a trap composed of 196 places in 211 ms of which 3 ms to minimize.
[2024-05-31 23:21:20] [INFO ] Deduced a trap composed of 147 places in 166 ms of which 3 ms to minimize.
[2024-05-31 23:21:20] [INFO ] Deduced a trap composed of 228 places in 163 ms of which 4 ms to minimize.
[2024-05-31 23:21:21] [INFO ] Deduced a trap composed of 140 places in 166 ms of which 4 ms to minimize.
[2024-05-31 23:21:21] [INFO ] Deduced a trap composed of 157 places in 153 ms of which 3 ms to minimize.
[2024-05-31 23:21:21] [INFO ] Deduced a trap composed of 136 places in 174 ms of which 4 ms to minimize.
[2024-05-31 23:21:21] [INFO ] Deduced a trap composed of 58 places in 176 ms of which 3 ms to minimize.
[2024-05-31 23:21:21] [INFO ] Deduced a trap composed of 230 places in 164 ms of which 4 ms to minimize.
[2024-05-31 23:21:21] [INFO ] Deduced a trap composed of 216 places in 161 ms of which 3 ms to minimize.
[2024-05-31 23:21:22] [INFO ] Deduced a trap composed of 197 places in 166 ms of which 3 ms to minimize.
[2024-05-31 23:21:22] [INFO ] Deduced a trap composed of 166 places in 157 ms of which 4 ms to minimize.
[2024-05-31 23:21:22] [INFO ] Deduced a trap composed of 220 places in 151 ms of which 3 ms to minimize.
[2024-05-31 23:21:22] [INFO ] Deduced a trap composed of 196 places in 159 ms of which 3 ms to minimize.
[2024-05-31 23:21:22] [INFO ] Deduced a trap composed of 151 places in 164 ms of which 4 ms to minimize.
[2024-05-31 23:21:22] [INFO ] Deduced a trap composed of 200 places in 157 ms of which 3 ms to minimize.
[2024-05-31 23:21:23] [INFO ] Deduced a trap composed of 200 places in 161 ms of which 4 ms to minimize.
[2024-05-31 23:21:23] [INFO ] Deduced a trap composed of 179 places in 158 ms of which 3 ms to minimize.
[2024-05-31 23:21:23] [INFO ] Deduced a trap composed of 201 places in 154 ms of which 3 ms to minimize.
[2024-05-31 23:21:23] [INFO ] Deduced a trap composed of 200 places in 174 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/593 variables, 20/235 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-31 23:21:23] [INFO ] Deduced a trap composed of 207 places in 168 ms of which 4 ms to minimize.
[2024-05-31 23:21:24] [INFO ] Deduced a trap composed of 139 places in 158 ms of which 4 ms to minimize.
[2024-05-31 23:21:24] [INFO ] Deduced a trap composed of 214 places in 158 ms of which 4 ms to minimize.
[2024-05-31 23:21:24] [INFO ] Deduced a trap composed of 219 places in 153 ms of which 4 ms to minimize.
[2024-05-31 23:21:24] [INFO ] Deduced a trap composed of 219 places in 161 ms of which 3 ms to minimize.
[2024-05-31 23:21:24] [INFO ] Deduced a trap composed of 207 places in 162 ms of which 4 ms to minimize.
[2024-05-31 23:21:24] [INFO ] Deduced a trap composed of 204 places in 169 ms of which 3 ms to minimize.
[2024-05-31 23:21:25] [INFO ] Deduced a trap composed of 225 places in 159 ms of which 3 ms to minimize.
[2024-05-31 23:21:25] [INFO ] Deduced a trap composed of 228 places in 157 ms of which 3 ms to minimize.
[2024-05-31 23:21:25] [INFO ] Deduced a trap composed of 222 places in 163 ms of which 3 ms to minimize.
[2024-05-31 23:21:25] [INFO ] Deduced a trap composed of 225 places in 159 ms of which 4 ms to minimize.
[2024-05-31 23:21:25] [INFO ] Deduced a trap composed of 225 places in 166 ms of which 3 ms to minimize.
[2024-05-31 23:21:26] [INFO ] Deduced a trap composed of 210 places in 165 ms of which 4 ms to minimize.
[2024-05-31 23:21:26] [INFO ] Deduced a trap composed of 206 places in 155 ms of which 4 ms to minimize.
[2024-05-31 23:21:26] [INFO ] Deduced a trap composed of 206 places in 158 ms of which 3 ms to minimize.
[2024-05-31 23:21:26] [INFO ] Deduced a trap composed of 221 places in 155 ms of which 4 ms to minimize.
[2024-05-31 23:21:26] [INFO ] Deduced a trap composed of 223 places in 154 ms of which 3 ms to minimize.
[2024-05-31 23:21:26] [INFO ] Deduced a trap composed of 227 places in 152 ms of which 4 ms to minimize.
[2024-05-31 23:21:27] [INFO ] Deduced a trap composed of 201 places in 144 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/593 variables, 19/254 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/593 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 482/1075 variables, 593/847 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1075 variables, 172/1019 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1075 variables, 2/1021 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1075 variables, 0/1021 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/1077 variables, 2/1023 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1077 variables, 1/1024 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1077 variables, 0/1024 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1077 variables, 0/1024 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1077/1077 variables, and 1024 constraints, problems are : Problem set: 1 solved, 2 unsolved in 18318 ms.
Refiners :[Positive P Invariants (semi-flows): 144/144 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 595/595 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 109/109 constraints]
After SMT, in 19374ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 821 ms.
Support contains 43 out of 595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 482/482 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 595 transition count 447
Reduce places removed 35 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 72 place count 560 transition count 445
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 558 transition count 445
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 74 place count 558 transition count 427
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 110 place count 540 transition count 427
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 198 place count 496 transition count 383
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 202 place count 496 transition count 379
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 4 with 2 rules applied. Total rules applied 204 place count 495 transition count 378
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 213 place count 495 transition count 369
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 222 place count 486 transition count 369
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 223 place count 485 transition count 368
Applied a total of 223 rules in 130 ms. Remains 485 /595 variables (removed 110) and now considering 368/482 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 485/595 places, 368/482 transitions.
RANDOM walk for 40000 steps (426 resets) in 310 ms. (128 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (61 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (57 resets) in 277 ms. (143 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 239057 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 2
Probabilistic random walk after 239057 steps, saw 77255 distinct states, run finished after 3007 ms. (steps per millisecond=79 ) properties seen :0
// Phase 1: matrix 368 rows 485 cols
[2024-05-31 23:21:32] [INFO ] Computed 146 invariants in 7 ms
[2024-05-31 23:21:32] [INFO ] State equation strengthened by 211 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 216/259 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/297 variables, 29/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 151/448 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 35/483 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 368/851 variables, 483/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/851 variables, 211/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/851 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/853 variables, 2/841 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/853 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/853 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/853 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 842 constraints, problems are : Problem set: 0 solved, 2 unsolved in 751 ms.
Refiners :[Positive P Invariants (semi-flows): 144/144 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 485/485 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 216/259 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:21:33] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:21:33] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:21:33] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:21:33] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:21:33] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-05-31 23:21:33] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 2 ms to minimize.
[2024-05-31 23:21:33] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 2 ms to minimize.
[2024-05-31 23:21:34] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 8/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/297 variables, 29/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:21:34] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 151/448 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:21:34] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 35/483 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:21:34] [INFO ] Deduced a trap composed of 191 places in 148 ms of which 3 ms to minimize.
[2024-05-31 23:21:34] [INFO ] Deduced a trap composed of 193 places in 148 ms of which 3 ms to minimize.
[2024-05-31 23:21:34] [INFO ] Deduced a trap composed of 141 places in 155 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/483 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:21:35] [INFO ] Deduced a trap composed of 154 places in 135 ms of which 3 ms to minimize.
[2024-05-31 23:21:35] [INFO ] Deduced a trap composed of 194 places in 144 ms of which 4 ms to minimize.
[2024-05-31 23:21:35] [INFO ] Deduced a trap composed of 195 places in 140 ms of which 3 ms to minimize.
[2024-05-31 23:21:35] [INFO ] Deduced a trap composed of 196 places in 143 ms of which 3 ms to minimize.
[2024-05-31 23:21:35] [INFO ] Deduced a trap composed of 173 places in 135 ms of which 3 ms to minimize.
[2024-05-31 23:21:35] [INFO ] Deduced a trap composed of 197 places in 133 ms of which 3 ms to minimize.
[2024-05-31 23:21:35] [INFO ] Deduced a trap composed of 195 places in 132 ms of which 4 ms to minimize.
[2024-05-31 23:21:36] [INFO ] Deduced a trap composed of 195 places in 135 ms of which 3 ms to minimize.
[2024-05-31 23:21:36] [INFO ] Deduced a trap composed of 197 places in 142 ms of which 3 ms to minimize.
[2024-05-31 23:21:36] [INFO ] Deduced a trap composed of 194 places in 159 ms of which 3 ms to minimize.
[2024-05-31 23:21:36] [INFO ] Deduced a trap composed of 200 places in 136 ms of which 3 ms to minimize.
[2024-05-31 23:21:36] [INFO ] Deduced a trap composed of 196 places in 139 ms of which 5 ms to minimize.
[2024-05-31 23:21:36] [INFO ] Deduced a trap composed of 197 places in 134 ms of which 3 ms to minimize.
[2024-05-31 23:21:36] [INFO ] Deduced a trap composed of 195 places in 133 ms of which 4 ms to minimize.
[2024-05-31 23:21:37] [INFO ] Deduced a trap composed of 197 places in 143 ms of which 3 ms to minimize.
[2024-05-31 23:21:37] [INFO ] Deduced a trap composed of 175 places in 141 ms of which 3 ms to minimize.
[2024-05-31 23:21:37] [INFO ] Deduced a trap composed of 200 places in 139 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/483 variables, 17/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/483 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 368/851 variables, 483/658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/851 variables, 211/869 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/851 variables, 2/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/851 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/853 variables, 2/873 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/853 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/853 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/853 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 874 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4853 ms.
Refiners :[Positive P Invariants (semi-flows): 144/144 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 485/485 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 30/30 constraints]
After SMT, in 5629ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 122 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=61 )
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 66 ms.
All properties solved without resorting to model-checking.
Total runtime 43594 ms.
ITS solved all properties within timeout

BK_STOP 1717197698408

--------------------
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="AutoFlight-PT-24b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is AutoFlight-PT-24b, 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 r468-smll-171620167200182"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-24b.tgz
mv AutoFlight-PT-24b 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 ;