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.r026-smll-171620167100135.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 itstools
Input is AutoFlight-PT-05b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167100135
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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.6K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 22:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 22:16 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 113K 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-05b-ReachabilityFireability-2024-00
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-01
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-02
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-03
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-04
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-05
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-06
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-07
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-08
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-09
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-10
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-11
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-12
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-13
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-14
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716262273352

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-21 03:31:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 03:31:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:31:16] [INFO ] Load time of PNML (sax parser for PT used): 338 ms
[2024-05-21 03:31:16] [INFO ] Transformed 482 places.
[2024-05-21 03:31:16] [INFO ] Transformed 480 transitions.
[2024-05-21 03:31:16] [INFO ] Found NUPN structural information;
[2024-05-21 03:31:16] [INFO ] Parsed PT model containing 482 places and 480 transitions and 1120 arcs in 597 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (161 resets) in 2777 ms. (14 steps per ms) remains 5/16 properties
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (14 resets) in 477 ms. (83 steps per ms) remains 5/5 properties
[2024-05-21 03:31:17] [INFO ] Flatten gal took : 338 ms
BEST_FIRST walk for 40004 steps (14 resets) in 1206 ms. (33 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (14 resets) in 222 ms. (179 steps per ms) remains 5/5 properties
[2024-05-21 03:31:18] [INFO ] Flatten gal took : 166 ms
[2024-05-21 03:31:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13855659782934389846.gal : 57 ms
[2024-05-21 03:31:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4497677955812376230.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13855659782934389846.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4497677955812376230.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

BEST_FIRST walk for 40004 steps (14 resets) in 813 ms. (49 steps per ms) remains 5/5 properties
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40002 steps (15 resets) in 137 ms. (289 steps per ms) remains 5/5 properties
Loading property file /tmp/ReachabilityCardinality4497677955812376230.prop.
// Phase 1: matrix 480 rows 482 cols
[2024-05-21 03:31:18] [INFO ] Computed 34 invariants in 24 ms
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :3 after 8
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :8 after 17
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :17 after 34
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :34 after 476
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :476 after 198986
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :198986 after 3.86947e+10
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :3.86947e+10 after 8.79436e+19
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 382/449 variables, 31/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 382/480 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 8/457 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 8/490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 25/482 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 25/516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 480/962 variables, 482/998 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/962 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/962 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 962/962 variables, and 998 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1491 ms.
Refiners :[Domain max(s): 482/482 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 482/482 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 382/449 variables, 31/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 382/480 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 03:31:20] [INFO ] Deduced a trap composed of 32 places in 375 ms of which 59 ms to minimize.
[2024-05-21 03:31:21] [INFO ] Deduced a trap composed of 36 places in 249 ms of which 6 ms to minimize.
[2024-05-21 03:31:21] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 4 ms to minimize.
[2024-05-21 03:31:21] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 4 ms to minimize.
[2024-05-21 03:31:21] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 3 ms to minimize.
[2024-05-21 03:31:21] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 4 ms to minimize.
[2024-05-21 03:31:22] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 4 ms to minimize.
[2024-05-21 03:31:22] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 8/488 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 03:31:22] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
[2024-05-21 03:31:22] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 2/490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 8/457 variables, 2/492 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 8/500 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 03:31:22] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 2 ms to minimize.
[2024-05-21 03:31:22] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 03:31:22] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 3/503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 25/482 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/482 variables, 25/529 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 03:31:23] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 3 ms to minimize.
[2024-05-21 03:31:23] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 3 ms to minimize.
[2024-05-21 03:31:23] [INFO ] Deduced a trap composed of 73 places in 172 ms of which 3 ms to minimize.
[2024-05-21 03:31:23] [INFO ] Deduced a trap composed of 78 places in 161 ms of which 5 ms to minimize.
[2024-05-21 03:31:23] [INFO ] Deduced a trap composed of 56 places in 202 ms of which 5 ms to minimize.
[2024-05-21 03:31:24] [INFO ] Deduced a trap composed of 53 places in 211 ms of which 5 ms to minimize.
[2024-05-21 03:31:24] [INFO ] Deduced a trap composed of 51 places in 144 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/482 variables, 7/536 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 03:31:24] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/482 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 03:31:24] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 962/962 variables, and 1020 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5008 ms.
Refiners :[Domain max(s): 482/482 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 482/482 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 22/22 constraints]
After SMT, in 6637ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 67 out of 482 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482/482 places, 480/480 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 482 transition count 361
Reduce places removed 119 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 136 rules applied. Total rules applied 255 place count 363 transition count 344
Reduce places removed 2 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 21 rules applied. Total rules applied 276 place count 361 transition count 325
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 23 rules applied. Total rules applied 299 place count 342 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 300 place count 341 transition count 321
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 53 Pre rules applied. Total rules applied 300 place count 341 transition count 268
Deduced a syphon composed of 53 places in 2 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 5 with 106 rules applied. Total rules applied 406 place count 288 transition count 268
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 437 place count 257 transition count 237
Iterating global reduction 5 with 31 rules applied. Total rules applied 468 place count 257 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 470 place count 257 transition count 235
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 470 place count 257 transition count 226
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 488 place count 248 transition count 226
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 568 place count 208 transition count 186
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 574 place count 205 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 576 place count 205 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 578 place count 204 transition count 184
Free-agglomeration rule applied 14 times.
Iterating global reduction 6 with 14 rules applied. Total rules applied 592 place count 204 transition count 170
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 606 place count 190 transition count 170
Applied a total of 606 rules in 226 ms. Remains 190 /482 variables (removed 292) and now considering 170/480 (removed 310) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 190/482 places, 170/480 transitions.
RANDOM walk for 40000 steps (458 resets) in 848 ms. (47 steps per ms) remains 4/5 properties
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (67 resets) in 525 ms. (76 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (60 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (61 resets) in 207 ms. (192 steps per ms) remains 3/4 properties
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (62 resets) in 139 ms. (285 steps per ms) remains 3/3 properties
// Phase 1: matrix 170 rows 190 cols
[2024-05-21 03:31:25] [INFO ] Computed 34 invariants in 4 ms
[2024-05-21 03:31:25] [INFO ] State equation strengthened by 24 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 103/149 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 22/171 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 19/190 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 170/360 variables, 190/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 24/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/360 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 248 constraints, problems are : Problem set: 0 solved, 3 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 190/190 constraints, ReadFeed: 24/24 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/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 103/149 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 22/171 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 03:31:26] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 19/190 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 03:31:26] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 3 ms to minimize.
[2024-05-21 03:31:26] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-21 03:31:26] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-21 03:31:26] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2024-05-21 03:31:26] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 03:31:26] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2024-05-21 03:31:27] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2024-05-21 03:31:27] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 03:31:27] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-21 03:31:27] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-21 03:31:27] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 9 ms to minimize.
[2024-05-21 03:31:27] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-05-21 03:31:27] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-21 03:31:27] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
[2024-05-21 03:31:27] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2024-05-21 03:31:27] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
[2024-05-21 03:31:27] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 170/360 variables, 190/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 24/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 03:31:28] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/360 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 270 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2112 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 190/190 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 19/19 constraints]
After SMT, in 2543ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 95 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=47 )
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 13 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 12693 ms.

BK_STOP 1716262288589

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-05b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is AutoFlight-PT-05b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-smll-171620167100135"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-05b.tgz
mv AutoFlight-PT-05b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;