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

--------------------
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 1716313780340

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 17:49:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 17:49:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 17:49:42] [INFO ] Load time of PNML (sax parser for PT used): 478 ms
[2024-05-21 17:49:42] [INFO ] Transformed 2230 places.
[2024-05-21 17:49:42] [INFO ] Transformed 2228 transitions.
[2024-05-21 17:49:42] [INFO ] Found NUPN structural information;
[2024-05-21 17:49:42] [INFO ] Parsed PT model containing 2230 places and 2228 transitions and 5186 arcs in 732 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 35 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 2206 ms. (18 steps per ms) remains 6/15 properties
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 40004 steps (8 resets) in 816 ms. (48 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1025 ms. (38 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 596 ms. (67 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 224 ms. (177 steps per ms) remains 6/6 properties
// Phase 1: matrix 2228 rows 2230 cols
[2024-05-21 17:49:44] [INFO ] Computed 148 invariants in 71 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1880/2039 variables, 137/296 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2039 variables, 1880/2176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2039 variables, 0/2176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 76/2115 variables, 10/2186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2115 variables, 76/2262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2115 variables, 0/2262 constraints. Problems are: Problem set: 0 solved, 6 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, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2230 variables, 115/2378 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2230 variables, 0/2378 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2228/4458 variables, 2230/4608 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4458 variables, 0/4608 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4458/4458 variables, and 4608 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5076 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: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 131/131 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1893/2024 variables, 135/266 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2024 variables, 1893/2159 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 17:49:51] [INFO ] Deduced a trap composed of 39 places in 554 ms of which 78 ms to minimize.
[2024-05-21 17:49:52] [INFO ] Deduced a trap composed of 41 places in 500 ms of which 9 ms to minimize.
[2024-05-21 17:49:52] [INFO ] Deduced a trap composed of 72 places in 384 ms of which 7 ms to minimize.
[2024-05-21 17:49:53] [INFO ] Deduced a trap composed of 74 places in 515 ms of which 7 ms to minimize.
[2024-05-21 17:49:53] [INFO ] Deduced a trap composed of 63 places in 355 ms of which 7 ms to minimize.
[2024-05-21 17:49:54] [INFO ] Deduced a trap composed of 84 places in 458 ms of which 7 ms to minimize.
[2024-05-21 17:49:54] [INFO ] Deduced a trap composed of 51 places in 438 ms of which 6 ms to minimize.
[2024-05-21 17:49:55] [INFO ] Deduced a trap composed of 99 places in 461 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2024/4458 variables, and 2167 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5008 ms.
Refiners :[Domain max(s): 2024/2230 constraints, Positive P Invariants (semi-flows): 135/147 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/2230 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 8/8 constraints]
After SMT, in 10363ms problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 131 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 756 transitions
Trivial Post-agglo rules discarded 756 transitions
Performed 756 trivial Post agglomeration. Transition count delta: 756
Iterating post reduction 0 with 756 rules applied. Total rules applied 756 place count 2230 transition count 1472
Reduce places removed 756 places and 0 transitions.
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 869 rules applied. Total rules applied 1625 place count 1474 transition count 1359
Reduce places removed 26 places and 0 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Iterating post reduction 2 with 71 rules applied. Total rules applied 1696 place count 1448 transition count 1314
Reduce places removed 45 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 55 rules applied. Total rules applied 1751 place count 1403 transition count 1304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1752 place count 1402 transition count 1304
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 252 Pre rules applied. Total rules applied 1752 place count 1402 transition count 1052
Deduced a syphon composed of 252 places in 10 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 5 with 504 rules applied. Total rules applied 2256 place count 1150 transition count 1052
Discarding 191 places :
Symmetric choice reduction at 5 with 191 rule applications. Total rules 2447 place count 959 transition count 861
Iterating global reduction 5 with 191 rules applied. Total rules applied 2638 place count 959 transition count 861
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 2644 place count 959 transition count 855
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 59 Pre rules applied. Total rules applied 2644 place count 959 transition count 796
Deduced a syphon composed of 59 places in 5 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 6 with 118 rules applied. Total rules applied 2762 place count 900 transition count 796
Performed 187 Post agglomeration using F-continuation condition.Transition count delta: 187
Deduced a syphon composed of 187 places in 2 ms
Reduce places removed 187 places and 0 transitions.
Iterating global reduction 6 with 374 rules applied. Total rules applied 3136 place count 713 transition count 609
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 3144 place count 709 transition count 609
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 3157 place count 709 transition count 596
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 3161 place count 707 transition count 594
Free-agglomeration rule applied 87 times.
Iterating global reduction 6 with 87 rules applied. Total rules applied 3248 place count 707 transition count 507
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 6 with 87 rules applied. Total rules applied 3335 place count 620 transition count 507
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 3336 place count 619 transition count 506
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 3338 place count 617 transition count 506
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 3338 place count 617 transition count 504
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 3342 place count 615 transition count 504
Applied a total of 3342 rules in 993 ms. Remains 615 /2230 variables (removed 1615) and now considering 504/2228 (removed 1724) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1010 ms. Remains : 615/2230 places, 504/2228 transitions.
RANDOM walk for 40000 steps (243 resets) in 815 ms. (49 steps per ms) remains 3/5 properties
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (24 resets) in 373 ms. (106 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (24 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (23 resets) in 338 ms. (118 steps per ms) remains 3/3 properties
// Phase 1: matrix 504 rows 615 cols
[2024-05-21 17:49:56] [INFO ] Computed 146 invariants in 8 ms
[2024-05-21 17:49:56] [INFO ] State equation strengthened by 166 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) 364/449 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 92/541 variables, 15/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 72/613 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/613 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 504/1117 variables, 613/758 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1117 variables, 166/924 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1117 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/1119 variables, 2/926 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1119 variables, 1/927 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1119 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1119 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1119/1119 variables, and 927 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1106 ms.
Refiners :[Positive P Invariants (semi-flows): 144/144 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 615/615 constraints, ReadFeed: 166/166 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) 364/449 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 17:49:58] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-21 17:49:58] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-05-21 17:49:58] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-21 17:49:58] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 4 ms to minimize.
[2024-05-21 17:49:58] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 2 ms to minimize.
[2024-05-21 17:49:58] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 3 ms to minimize.
[2024-05-21 17:49:58] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-05-21 17:49:58] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-21 17:49:58] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 2 ms to minimize.
[2024-05-21 17:49:58] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2024-05-21 17:49:59] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 2 ms to minimize.
[2024-05-21 17:49:59] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 2 ms to minimize.
[2024-05-21 17:49:59] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 3 ms to minimize.
[2024-05-21 17:49:59] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-05-21 17:49:59] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 4 ms to minimize.
[2024-05-21 17:49:59] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2024-05-21 17:49:59] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 2 ms to minimize.
[2024-05-21 17:49:59] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 18/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 17:49:59] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 2 ms to minimize.
[2024-05-21 17:49:59] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 2 ms to minimize.
[2024-05-21 17:49:59] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 17:50:00] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 92/541 variables, 15/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 17:50:00] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 2 ms to minimize.
[2024-05-21 17:50:00] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-21 17:50:00] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-21 17:50:00] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 6 ms to minimize.
[2024-05-21 17:50:00] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 72/613 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 17:50:00] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 4 ms to minimize.
[2024-05-21 17:50:00] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 4 ms to minimize.
[2024-05-21 17:50:01] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 4 ms to minimize.
[2024-05-21 17:50:01] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 3 ms to minimize.
[2024-05-21 17:50:01] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 5 ms to minimize.
[2024-05-21 17:50:01] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 3 ms to minimize.
[2024-05-21 17:50:01] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 3 ms to minimize.
[2024-05-21 17:50:01] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 5 ms to minimize.
[2024-05-21 17:50:01] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 3 ms to minimize.
[2024-05-21 17:50:02] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 3 ms to minimize.
[2024-05-21 17:50:02] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 3 ms to minimize.
[2024-05-21 17:50:02] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 3 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-21 17:50:02] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 4 ms to minimize.
[2024-05-21 17:50:02] [INFO ] Deduced a trap composed of 168 places in 198 ms of which 4 ms to minimize.
[2024-05-21 17:50:03] [INFO ] Deduced a trap composed of 130 places in 203 ms of which 4 ms to minimize.
[2024-05-21 17:50:03] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 5 ms to minimize.
[2024-05-21 17:50:03] [INFO ] Deduced a trap composed of 94 places in 180 ms of which 4 ms to minimize.
[2024-05-21 17:50:03] [INFO ] Deduced a trap composed of 155 places in 226 ms of which 4 ms to minimize.
[2024-05-21 17:50:03] [INFO ] Deduced a trap composed of 146 places in 163 ms of which 5 ms to minimize.
[2024-05-21 17:50:04] [INFO ] Deduced a trap composed of 142 places in 200 ms of which 4 ms to minimize.
Problem AutoFlight-PT-24b-ReachabilityCardinality-2024-05 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/613 variables, 20/192 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 17:50:04] [INFO ] Deduced a trap composed of 145 places in 194 ms of which 16 ms to minimize.
[2024-05-21 17:50:04] [INFO ] Deduced a trap composed of 198 places in 191 ms of which 4 ms to minimize.
[2024-05-21 17:50:04] [INFO ] Deduced a trap composed of 203 places in 186 ms of which 4 ms to minimize.
[2024-05-21 17:50:04] [INFO ] Deduced a trap composed of 204 places in 185 ms of which 4 ms to minimize.
[2024-05-21 17:50:05] [INFO ] Deduced a trap composed of 159 places in 186 ms of which 3 ms to minimize.
[2024-05-21 17:50:05] [INFO ] Deduced a trap composed of 223 places in 200 ms of which 4 ms to minimize.
[2024-05-21 17:50:05] [INFO ] Deduced a trap composed of 148 places in 184 ms of which 4 ms to minimize.
[2024-05-21 17:50:05] [INFO ] Deduced a trap composed of 165 places in 198 ms of which 4 ms to minimize.
[2024-05-21 17:50:05] [INFO ] Deduced a trap composed of 204 places in 204 ms of which 5 ms to minimize.
[2024-05-21 17:50:06] [INFO ] Deduced a trap composed of 204 places in 190 ms of which 4 ms to minimize.
[2024-05-21 17:50:06] [INFO ] Deduced a trap composed of 171 places in 207 ms of which 4 ms to minimize.
[2024-05-21 17:50:06] [INFO ] Deduced a trap composed of 202 places in 174 ms of which 4 ms to minimize.
[2024-05-21 17:50:06] [INFO ] Deduced a trap composed of 207 places in 168 ms of which 4 ms to minimize.
[2024-05-21 17:50:06] [INFO ] Deduced a trap composed of 155 places in 173 ms of which 3 ms to minimize.
[2024-05-21 17:50:07] [INFO ] Deduced a trap composed of 204 places in 167 ms of which 4 ms to minimize.
[2024-05-21 17:50:07] [INFO ] Deduced a trap composed of 136 places in 252 ms of which 8 ms to minimize.
[2024-05-21 17:50:07] [INFO ] Deduced a trap composed of 205 places in 167 ms of which 4 ms to minimize.
[2024-05-21 17:50:07] [INFO ] Deduced a trap composed of 224 places in 171 ms of which 4 ms to minimize.
[2024-05-21 17:50:07] [INFO ] Deduced a trap composed of 165 places in 166 ms of which 4 ms to minimize.
[2024-05-21 17:50:08] [INFO ] Deduced a trap composed of 143 places in 169 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/613 variables, 20/212 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 17:50:08] [INFO ] Deduced a trap composed of 169 places in 199 ms of which 3 ms to minimize.
[2024-05-21 17:50:08] [INFO ] Deduced a trap composed of 144 places in 159 ms of which 3 ms to minimize.
[2024-05-21 17:50:08] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 3 ms to minimize.
[2024-05-21 17:50:08] [INFO ] Deduced a trap composed of 223 places in 167 ms of which 4 ms to minimize.
[2024-05-21 17:50:09] [INFO ] Deduced a trap composed of 149 places in 164 ms of which 3 ms to minimize.
[2024-05-21 17:50:09] [INFO ] Deduced a trap composed of 203 places in 162 ms of which 3 ms to minimize.
[2024-05-21 17:50:09] [INFO ] Deduced a trap composed of 140 places in 160 ms of which 4 ms to minimize.
[2024-05-21 17:50:09] [INFO ] Deduced a trap composed of 165 places in 161 ms of which 4 ms to minimize.
[2024-05-21 17:50:09] [INFO ] Deduced a trap composed of 144 places in 166 ms of which 4 ms to minimize.
[2024-05-21 17:50:10] [INFO ] Deduced a trap composed of 176 places in 249 ms of which 4 ms to minimize.
[2024-05-21 17:50:10] [INFO ] Deduced a trap composed of 223 places in 166 ms of which 4 ms to minimize.
[2024-05-21 17:50:10] [INFO ] Deduced a trap composed of 150 places in 172 ms of which 4 ms to minimize.
[2024-05-21 17:50:10] [INFO ] Deduced a trap composed of 209 places in 195 ms of which 4 ms to minimize.
[2024-05-21 17:50:10] [INFO ] Deduced a trap composed of 204 places in 175 ms of which 4 ms to minimize.
[2024-05-21 17:50:11] [INFO ] Deduced a trap composed of 140 places in 174 ms of which 4 ms to minimize.
[2024-05-21 17:50:11] [INFO ] Deduced a trap composed of 139 places in 181 ms of which 4 ms to minimize.
[2024-05-21 17:50:11] [INFO ] Deduced a trap composed of 207 places in 173 ms of which 4 ms to minimize.
[2024-05-21 17:50:11] [INFO ] Deduced a trap composed of 209 places in 165 ms of which 4 ms to minimize.
[2024-05-21 17:50:11] [INFO ] Deduced a trap composed of 147 places in 159 ms of which 4 ms to minimize.
[2024-05-21 17:50:12] [INFO ] Deduced a trap composed of 232 places in 155 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/613 variables, 20/232 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 17:50:12] [INFO ] Deduced a trap composed of 212 places in 158 ms of which 3 ms to minimize.
[2024-05-21 17:50:12] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 4 ms to minimize.
[2024-05-21 17:50:12] [INFO ] Deduced a trap composed of 61 places in 177 ms of which 4 ms to minimize.
[2024-05-21 17:50:12] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 3 ms to minimize.
[2024-05-21 17:50:13] [INFO ] Deduced a trap composed of 216 places in 177 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/613 variables, 5/237 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 17:50:13] [INFO ] Deduced a trap composed of 157 places in 155 ms of which 3 ms to minimize.
[2024-05-21 17:50:13] [INFO ] Deduced a trap composed of 224 places in 201 ms of which 4 ms to minimize.
[2024-05-21 17:50:13] [INFO ] Deduced a trap composed of 167 places in 175 ms of which 3 ms to minimize.
[2024-05-21 17:50:13] [INFO ] Deduced a trap composed of 160 places in 164 ms of which 3 ms to minimize.
[2024-05-21 17:50:13] [INFO ] Deduced a trap composed of 225 places in 167 ms of which 3 ms to minimize.
[2024-05-21 17:50:14] [INFO ] Deduced a trap composed of 225 places in 174 ms of which 4 ms to minimize.
[2024-05-21 17:50:14] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 3 ms to minimize.
[2024-05-21 17:50:14] [INFO ] Deduced a trap composed of 230 places in 185 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/613 variables, 8/245 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/613 variables, 0/245 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 504/1117 variables, 613/858 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1117 variables, 166/1024 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1117 variables, 2/1026 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1117 variables, 0/1026 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/1119 variables, 2/1028 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1119 variables, 1/1029 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1119 variables, 0/1029 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1119 variables, 0/1029 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1119/1119 variables, and 1029 constraints, problems are : Problem set: 1 solved, 2 unsolved in 18142 ms.
Refiners :[Positive P Invariants (semi-flows): 144/144 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 615/615 constraints, ReadFeed: 166/166 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 100/100 constraints]
After SMT, in 19327ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 1350 ms.
Support contains 43 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 504/504 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 615 transition count 461
Reduce places removed 43 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 45 rules applied. Total rules applied 88 place count 572 transition count 459
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 570 transition count 459
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 90 place count 570 transition count 436
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 136 place count 547 transition count 436
Performed 51 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 238 place count 496 transition count 384
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 243 place count 496 transition count 379
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 247 place count 494 transition count 377
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 257 place count 494 transition count 367
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 267 place count 484 transition count 367
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 268 place count 483 transition count 366
Applied a total of 268 rules in 131 ms. Remains 483 /615 variables (removed 132) and now considering 366/504 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 483/615 places, 366/504 transitions.
RANDOM walk for 40000 steps (418 resets) in 486 ms. (82 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (65 resets) in 239 ms. (166 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (54 resets) in 336 ms. (118 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 234554 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 2
Probabilistic random walk after 234554 steps, saw 78735 distinct states, run finished after 3006 ms. (steps per millisecond=78 ) properties seen :0
// Phase 1: matrix 366 rows 483 cols
[2024-05-21 17:50:20] [INFO ] Computed 146 invariants in 4 ms
[2024-05-21 17:50:20] [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) 36/295 variables, 29/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 143/438 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 43/481 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 366/847 variables, 481/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/847 variables, 211/837 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/847 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/849 variables, 2/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/849 variables, 1/840 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/849 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/849 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 849/849 variables, and 840 constraints, problems are : Problem set: 0 solved, 2 unsolved in 720 ms.
Refiners :[Positive P Invariants (semi-flows): 144/144 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 483/483 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-21 17:50:21] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 3 ms to minimize.
[2024-05-21 17:50:21] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 3 ms to minimize.
[2024-05-21 17:50:21] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 2 ms to minimize.
[2024-05-21 17:50:22] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-05-21 17:50:22] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 2 ms to minimize.
[2024-05-21 17:50:22] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 6/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 17:50:22] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 2 ms to minimize.
[2024-05-21 17:50:22] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2024-05-21 17:50:22] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 17:50:22] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 36/295 variables, 29/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 17:50:22] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 143/438 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 43/481 variables, 20/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 17:50:22] [INFO ] Deduced a trap composed of 165 places in 162 ms of which 3 ms to minimize.
[2024-05-21 17:50:23] [INFO ] Deduced a trap composed of 165 places in 159 ms of which 3 ms to minimize.
[2024-05-21 17:50:23] [INFO ] Deduced a trap composed of 167 places in 150 ms of which 3 ms to minimize.
[2024-05-21 17:50:23] [INFO ] Deduced a trap composed of 174 places in 163 ms of which 4 ms to minimize.
[2024-05-21 17:50:23] [INFO ] Deduced a trap composed of 176 places in 149 ms of which 4 ms to minimize.
[2024-05-21 17:50:23] [INFO ] Deduced a trap composed of 180 places in 156 ms of which 3 ms to minimize.
[2024-05-21 17:50:23] [INFO ] Deduced a trap composed of 156 places in 148 ms of which 3 ms to minimize.
[2024-05-21 17:50:24] [INFO ] Deduced a trap composed of 172 places in 150 ms of which 4 ms to minimize.
[2024-05-21 17:50:24] [INFO ] Deduced a trap composed of 177 places in 152 ms of which 3 ms to minimize.
[2024-05-21 17:50:24] [INFO ] Deduced a trap composed of 179 places in 149 ms of which 3 ms to minimize.
[2024-05-21 17:50:24] [INFO ] Deduced a trap composed of 179 places in 141 ms of which 3 ms to minimize.
[2024-05-21 17:50:24] [INFO ] Deduced a trap composed of 181 places in 143 ms of which 3 ms to minimize.
[2024-05-21 17:50:24] [INFO ] Deduced a trap composed of 181 places in 137 ms of which 3 ms to minimize.
[2024-05-21 17:50:24] [INFO ] Deduced a trap composed of 181 places in 139 ms of which 3 ms to minimize.
[2024-05-21 17:50:25] [INFO ] Deduced a trap composed of 183 places in 137 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/481 variables, 15/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/481 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 366/847 variables, 481/652 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/847 variables, 211/863 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/847 variables, 2/865 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 17:50:25] [INFO ] Deduced a trap composed of 147 places in 152 ms of which 3 ms to minimize.
[2024-05-21 17:50:25] [INFO ] Deduced a trap composed of 200 places in 143 ms of which 3 ms to minimize.
[2024-05-21 17:50:26] [INFO ] Deduced a trap composed of 201 places in 144 ms of which 3 ms to minimize.
[2024-05-21 17:50:26] [INFO ] Deduced a trap composed of 207 places in 161 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/847 variables, 4/869 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/847 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/849 variables, 2/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/849 variables, 1/872 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/849 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/849 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 849/849 variables, and 872 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5228 ms.
Refiners :[Positive P Invariants (semi-flows): 144/144 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 483/483 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 30/30 constraints]
After SMT, in 5970ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 126 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=63 )
FORMULA AutoFlight-PT-24b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 64 ms.
All properties solved without resorting to model-checking.
Total runtime 44753 ms.
ITS solved all properties within timeout

BK_STOP 1716313826946

--------------------
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="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 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 r025-smll-171620166100182"
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 ;