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-171620167100134.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167100134
=====================================================================

--------------------
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-ReachabilityCardinality-2024-00
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-01
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-02
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-03
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-04
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-05
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-06
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-07
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-08
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-09
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-10
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-11
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-12
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-13
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-14
FORMULA_NAME AutoFlight-PT-05b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716262244406

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
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
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-21 03:30:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 03:30:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:30:47] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2024-05-21 03:30:47] [INFO ] Transformed 482 places.
[2024-05-21 03:30:47] [INFO ] Transformed 480 transitions.
[2024-05-21 03:30:47] [INFO ] Found NUPN structural information;
[2024-05-21 03:30:47] [INFO ] Parsed PT model containing 482 places and 480 transitions and 1120 arcs in 441 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 59 ms.
Working with output stream class java.io.PrintStream
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (162 resets) in 3466 ms. (11 steps per ms) remains 6/14 properties
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 03:30:48] [INFO ] Flatten gal took : 301 ms
BEST_FIRST walk for 40004 steps (16 resets) in 1019 ms. (39 steps per ms) remains 6/6 properties
[2024-05-21 03:30:49] [INFO ] Flatten gal took : 129 ms
BEST_FIRST walk for 40003 steps (19 resets) in 266 ms. (149 steps per ms) remains 6/6 properties
[2024-05-21 03:30:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11014396486578723206.gal : 57 ms
[2024-05-21 03:30:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6422383421683705781.prop : 17 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/ReachabilityCardinality11014396486578723206.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6422383421683705781.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

BEST_FIRST walk for 40002 steps (14 resets) in 619 ms. (64 steps per ms) remains 6/6 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 40003 steps (19 resets) in 178 ms. (223 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 231 ms. (172 steps per ms) remains 6/6 properties
Loading property file /tmp/ReachabilityCardinality6422383421683705781.prop.
BEST_FIRST walk for 40004 steps (12 resets) in 150 ms. (264 steps per ms) remains 5/6 properties
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 480 rows 482 cols
[2024-05-21 03:30:49] [INFO ] Computed 34 invariants in 37 ms
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 8
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :8 after 17
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :17 after 34
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :34 after 476
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :476 after 198986
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :198986 after 3.86947e+10
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AutoFlight-PT-05b-ReachabilityCardinality-2024-07 is UNSAT
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 370/459 variables, 32/121 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 370/491 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 0/491 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/463 variables, 1/492 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 4/496 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/496 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 19/482 variables, 1/497 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 19/516 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/516 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 480/962 variables, 482/998 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/962 variables, 0/998 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/962 variables, 0/998 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 962/962 variables, and 998 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1679 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: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 385/453 variables, 31/99 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 385/484 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 03:30:51] [INFO ] Deduced a trap composed of 28 places in 228 ms of which 35 ms to minimize.
[2024-05-21 03:30:52] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-21 03:30:52] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 3 ms to minimize.
[2024-05-21 03:30:52] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 3 ms to minimize.
[2024-05-21 03:30:52] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 2 ms to minimize.
[2024-05-21 03:30:52] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2024-05-21 03:30:52] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 7/491 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 03:30:53] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 1/492 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 03:30:53] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 1/493 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 03:30:53] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
[2024-05-21 03:30:53] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 2/495 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 0/495 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 8/461 variables, 2/497 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 8/505 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 0/505 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 21/482 variables, 1/506 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/482 variables, 21/527 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 03:30:53] [INFO ] Deduced a trap composed of 24 places in 189 ms of which 3 ms to minimize.
[2024-05-21 03:30:54] [INFO ] Deduced a trap composed of 107 places in 171 ms of which 4 ms to minimize.
[2024-05-21 03:30:54] [INFO ] Deduced a trap composed of 54 places in 141 ms of which 3 ms to minimize.
[2024-05-21 03:30:54] [INFO ] Deduced a trap composed of 55 places in 164 ms of which 3 ms to minimize.
[2024-05-21 03:30:54] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 3 ms to minimize.
[2024-05-21 03:30:54] [INFO ] Deduced a trap composed of 70 places in 164 ms of which 3 ms to minimize.
[2024-05-21 03:30:55] [INFO ] Deduced a trap composed of 59 places in 124 ms of which 3 ms to minimize.
[2024-05-21 03:30:55] [INFO ] Deduced a trap composed of 67 places in 142 ms of which 3 ms to minimize.
[2024-05-21 03:30:55] [INFO ] Deduced a trap composed of 63 places in 144 ms of which 3 ms to minimize.
[2024-05-21 03:30:55] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 3 ms to minimize.
[2024-05-21 03:30:55] [INFO ] Deduced a trap composed of 52 places in 143 ms of which 4 ms to minimize.
[2024-05-21 03:30:55] [INFO ] Deduced a trap composed of 53 places in 147 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/482 variables, 12/539 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 03:30:56] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 4 ms to minimize.
[2024-05-21 03:30:56] [INFO ] Deduced a trap composed of 46 places in 187 ms of which 4 ms to minimize.
[2024-05-21 03:30:56] [INFO ] Deduced a trap composed of 60 places in 153 ms of which 3 ms to minimize.
SMT process timed out in 6992ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 68 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 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 482 transition count 355
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 145 rules applied. Total rules applied 270 place count 357 transition count 335
Reduce places removed 4 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 23 rules applied. Total rules applied 293 place count 353 transition count 316
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 312 place count 334 transition count 316
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 52 Pre rules applied. Total rules applied 312 place count 334 transition count 264
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 416 place count 282 transition count 264
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 445 place count 253 transition count 235
Iterating global reduction 4 with 29 rules applied. Total rules applied 474 place count 253 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 477 place count 253 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 478 place count 252 transition count 232
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 478 place count 252 transition count 227
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 488 place count 247 transition count 227
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 562 place count 210 transition count 190
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 568 place count 210 transition count 184
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 570 place count 209 transition count 183
Free-agglomeration rule applied 17 times.
Iterating global reduction 6 with 17 rules applied. Total rules applied 587 place count 209 transition count 166
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 604 place count 192 transition count 166
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 605 place count 191 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 606 place count 190 transition count 165
Applied a total of 606 rules in 195 ms. Remains 190 /482 variables (removed 292) and now considering 165/480 (removed 315) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 190/482 places, 165/480 transitions.
RANDOM walk for 40000 steps (454 resets) in 698 ms. (57 steps per ms) remains 3/4 properties
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (71 resets) in 207 ms. (192 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (93 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (77 resets) in 114 ms. (347 steps per ms) remains 2/3 properties
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 165 rows 190 cols
[2024-05-21 03:30:57] [INFO ] Computed 33 invariants in 3 ms
[2024-05-21 03:30:57] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 128/167 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/171 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/190 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 165/355 variables, 190/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 17/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/355 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 240 constraints, problems are : Problem set: 0 solved, 2 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 190/190 constraints, ReadFeed: 17/17 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/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 128/167 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 03:30:57] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-21 03:30:57] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-21 03:30:57] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2024-05-21 03:30:57] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-21 03:30:57] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 2 ms to minimize.
[2024-05-21 03:30:57] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 2 ms to minimize.
[2024-05-21 03:30:57] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 4/171 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 03:30:58] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
[2024-05-21 03:30:58] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 19/190 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 03:30:58] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 3 ms to minimize.
[2024-05-21 03:30:58] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
[2024-05-21 03:30:58] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-21 03:30:58] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 1 ms to minimize.
[2024-05-21 03:30:58] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 2 ms to minimize.
[2024-05-21 03:30:58] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 2 ms to minimize.
[2024-05-21 03:30:58] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 4 ms to minimize.
[2024-05-21 03:30:58] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-05-21 03:30:58] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-21 03:30:59] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 2 ms to minimize.
[2024-05-21 03:30:59] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 2 ms to minimize.
[2024-05-21 03:30:59] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2024-05-21 03:30:59] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 2 ms to minimize.
[2024-05-21 03:30:59] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 3 ms to minimize.
[2024-05-21 03:30:59] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 3 ms to minimize.
[2024-05-21 03:30:59] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 3 ms to minimize.
[2024-05-21 03:30:59] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 2 ms to minimize.
[2024-05-21 03:30:59] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 2 ms to minimize.
[2024-05-21 03:30:59] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 165/355 variables, 190/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 17/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 03:31:00] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2024-05-21 03:31:00] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 12 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/355 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 272 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3011 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 190/190 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 30/30 constraints]
After SMT, in 3280ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 552 steps, including 9 resets, run visited all 1 properties in 3 ms. (steps per millisecond=184 )
FORMULA AutoFlight-PT-05b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 88 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 13721 ms.

BK_STOP 1716262260627

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="ReachabilityCardinality"
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 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 r026-smll-171620167100134"
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 [ "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 ;