fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r010-tajo-165245701800194
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for AutoFlight-PT-96a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
707.023 90367.00 116090.00 81.30 FTTFTTTTTTFFTFTF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r010-tajo-165245701800194.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is AutoFlight-PT-96a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-tajo-165245701800194
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K Apr 30 04:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 30 04:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 30 03:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 30 03:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 07:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 30 06:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 54K Apr 30 06:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 30 05:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 30 05:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 629K May 10 09:33 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-96a-ReachabilityCardinality-00
FORMULA_NAME AutoFlight-PT-96a-ReachabilityCardinality-01
FORMULA_NAME AutoFlight-PT-96a-ReachabilityCardinality-02
FORMULA_NAME AutoFlight-PT-96a-ReachabilityCardinality-03
FORMULA_NAME AutoFlight-PT-96a-ReachabilityCardinality-04
FORMULA_NAME AutoFlight-PT-96a-ReachabilityCardinality-05
FORMULA_NAME AutoFlight-PT-96a-ReachabilityCardinality-06
FORMULA_NAME AutoFlight-PT-96a-ReachabilityCardinality-07
FORMULA_NAME AutoFlight-PT-96a-ReachabilityCardinality-08
FORMULA_NAME AutoFlight-PT-96a-ReachabilityCardinality-09
FORMULA_NAME AutoFlight-PT-96a-ReachabilityCardinality-10
FORMULA_NAME AutoFlight-PT-96a-ReachabilityCardinality-11
FORMULA_NAME AutoFlight-PT-96a-ReachabilityCardinality-12
FORMULA_NAME AutoFlight-PT-96a-ReachabilityCardinality-13
FORMULA_NAME AutoFlight-PT-96a-ReachabilityCardinality-14
FORMULA_NAME AutoFlight-PT-96a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655069934660

Running Version 0
[2022-06-12 21:38:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 21:38:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:38:56] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2022-06-12 21:38:56] [INFO ] Transformed 2251 places.
[2022-06-12 21:38:56] [INFO ] Transformed 2225 transitions.
[2022-06-12 21:38:56] [INFO ] Found NUPN structural information;
[2022-06-12 21:38:56] [INFO ] Parsed PT model containing 2251 places and 2225 transitions in 226 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 384 transitions
Reduce redundant transitions removed 384 transitions.
FORMULA AutoFlight-PT-96a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 38 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 15) seen :4
FORMULA AutoFlight-PT-96a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1841 rows 2251 cols
[2022-06-12 21:38:57] [INFO ] Computed 514 place invariants in 76 ms
[2022-06-12 21:38:58] [INFO ] [Real]Absence check using 513 positive place invariants in 323 ms returned unsat
[2022-06-12 21:38:59] [INFO ] [Real]Absence check using 513 positive place invariants in 311 ms returned sat
[2022-06-12 21:38:59] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 5 ms returned sat
[2022-06-12 21:38:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:00] [INFO ] [Real]Absence check using state equation in 807 ms returned sat
[2022-06-12 21:39:00] [INFO ] State equation strengthened by 384 read => feed constraints.
[2022-06-12 21:39:00] [INFO ] [Real]Added 384 Read/Feed constraints in 95 ms returned sat
[2022-06-12 21:39:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:39:01] [INFO ] [Nat]Absence check using 513 positive place invariants in 523 ms returned sat
[2022-06-12 21:39:01] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 14 ms returned sat
[2022-06-12 21:39:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:03] [INFO ] [Nat]Absence check using state equation in 1705 ms returned sat
[2022-06-12 21:39:03] [INFO ] [Nat]Added 384 Read/Feed constraints in 151 ms returned sat
[2022-06-12 21:39:04] [INFO ] Deduced a trap composed of 1265 places in 820 ms of which 10 ms to minimize.
[2022-06-12 21:39:05] [INFO ] Deduced a trap composed of 1275 places in 804 ms of which 4 ms to minimize.
[2022-06-12 21:39:06] [INFO ] Deduced a trap composed of 1267 places in 819 ms of which 12 ms to minimize.
[2022-06-12 21:39:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2022-06-12 21:39:06] [INFO ] [Real]Absence check using 513 positive place invariants in 283 ms returned sat
[2022-06-12 21:39:06] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:39:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:07] [INFO ] [Real]Absence check using state equation in 1074 ms returned sat
[2022-06-12 21:39:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:39:08] [INFO ] [Real]Absence check using 513 positive place invariants in 162 ms returned sat
[2022-06-12 21:39:08] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 13 ms returned sat
[2022-06-12 21:39:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:09] [INFO ] [Real]Absence check using state equation in 872 ms returned sat
[2022-06-12 21:39:09] [INFO ] [Real]Added 384 Read/Feed constraints in 70 ms returned sat
[2022-06-12 21:39:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:39:10] [INFO ] [Nat]Absence check using 513 positive place invariants in 134 ms returned sat
[2022-06-12 21:39:10] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:39:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:11] [INFO ] [Nat]Absence check using state equation in 730 ms returned sat
[2022-06-12 21:39:11] [INFO ] [Nat]Added 384 Read/Feed constraints in 65 ms returned sat
[2022-06-12 21:39:12] [INFO ] Deduced a trap composed of 1238 places in 709 ms of which 3 ms to minimize.
[2022-06-12 21:39:12] [INFO ] Deduced a trap composed of 1237 places in 632 ms of which 1 ms to minimize.
[2022-06-12 21:39:13] [INFO ] Deduced a trap composed of 1245 places in 876 ms of which 1 ms to minimize.
[2022-06-12 21:39:14] [INFO ] Deduced a trap composed of 1240 places in 573 ms of which 1 ms to minimize.
[2022-06-12 21:39:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3399 ms
[2022-06-12 21:39:14] [INFO ] Computed and/alt/rep : 1632/3072/1632 causal constraints (skipped 208 transitions) in 171 ms.
[2022-06-12 21:39:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2022-06-12 21:39:15] [INFO ] [Real]Absence check using 513 positive place invariants in 167 ms returned sat
[2022-06-12 21:39:15] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-12 21:39:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:16] [INFO ] [Real]Absence check using state equation in 952 ms returned sat
[2022-06-12 21:39:16] [INFO ] [Real]Added 384 Read/Feed constraints in 110 ms returned sat
[2022-06-12 21:39:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:39:17] [INFO ] [Nat]Absence check using 513 positive place invariants in 170 ms returned sat
[2022-06-12 21:39:17] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:39:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:18] [INFO ] [Nat]Absence check using state equation in 931 ms returned sat
[2022-06-12 21:39:18] [INFO ] [Nat]Added 384 Read/Feed constraints in 67 ms returned sat
[2022-06-12 21:39:19] [INFO ] Deduced a trap composed of 1268 places in 686 ms of which 3 ms to minimize.
[2022-06-12 21:39:20] [INFO ] Deduced a trap composed of 1077 places in 703 ms of which 1 ms to minimize.
[2022-06-12 21:39:20] [INFO ] Deduced a trap composed of 1165 places in 677 ms of which 1 ms to minimize.
[2022-06-12 21:39:21] [INFO ] Deduced a trap composed of 1261 places in 550 ms of which 1 ms to minimize.
[2022-06-12 21:39:22] [INFO ] Deduced a trap composed of 1282 places in 630 ms of which 1 ms to minimize.
[2022-06-12 21:39:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2022-06-12 21:39:22] [INFO ] [Real]Absence check using 513 positive place invariants in 172 ms returned sat
[2022-06-12 21:39:22] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-12 21:39:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:23] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2022-06-12 21:39:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:39:24] [INFO ] [Real]Absence check using 513 positive place invariants in 172 ms returned sat
[2022-06-12 21:39:24] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-12 21:39:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:25] [INFO ] [Real]Absence check using state equation in 798 ms returned sat
[2022-06-12 21:39:25] [INFO ] [Real]Added 384 Read/Feed constraints in 71 ms returned sat
[2022-06-12 21:39:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:39:26] [INFO ] [Nat]Absence check using 513 positive place invariants in 173 ms returned sat
[2022-06-12 21:39:26] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-12 21:39:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:26] [INFO ] [Nat]Absence check using state equation in 774 ms returned sat
[2022-06-12 21:39:26] [INFO ] [Nat]Added 384 Read/Feed constraints in 76 ms returned sat
[2022-06-12 21:39:27] [INFO ] Computed and/alt/rep : 1632/3072/1632 causal constraints (skipped 208 transitions) in 161 ms.
[2022-06-12 21:39:32] [INFO ] Deduced a trap composed of 2 places in 1480 ms of which 2 ms to minimize.
[2022-06-12 21:39:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2022-06-12 21:39:32] [INFO ] [Real]Absence check using 513 positive place invariants in 124 ms returned sat
[2022-06-12 21:39:32] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:39:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:33] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2022-06-12 21:39:33] [INFO ] [Real]Added 384 Read/Feed constraints in 61 ms returned sat
[2022-06-12 21:39:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:39:33] [INFO ] [Nat]Absence check using 513 positive place invariants in 177 ms returned sat
[2022-06-12 21:39:33] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-12 21:39:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:34] [INFO ] [Nat]Absence check using state equation in 796 ms returned sat
[2022-06-12 21:39:34] [INFO ] [Nat]Added 384 Read/Feed constraints in 66 ms returned sat
[2022-06-12 21:39:35] [INFO ] Deduced a trap composed of 1238 places in 602 ms of which 2 ms to minimize.
[2022-06-12 21:39:36] [INFO ] Deduced a trap composed of 1237 places in 737 ms of which 2 ms to minimize.
[2022-06-12 21:39:37] [INFO ] Deduced a trap composed of 1136 places in 726 ms of which 2 ms to minimize.
[2022-06-12 21:39:38] [INFO ] Deduced a trap composed of 1240 places in 770 ms of which 1 ms to minimize.
[2022-06-12 21:39:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3610 ms
[2022-06-12 21:39:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 7
[2022-06-12 21:39:39] [INFO ] [Real]Absence check using 513 positive place invariants in 456 ms returned unsat
[2022-06-12 21:39:39] [INFO ] [Real]Absence check using 513 positive place invariants in 172 ms returned sat
[2022-06-12 21:39:39] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-12 21:39:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:40] [INFO ] [Real]Absence check using state equation in 851 ms returned sat
[2022-06-12 21:39:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:39:42] [INFO ] [Real]Absence check using 513 positive place invariants in 392 ms returned sat
[2022-06-12 21:39:42] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 18 ms returned sat
[2022-06-12 21:39:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:45] [INFO ] [Real]Absence check using state equation in 3431 ms returned sat
[2022-06-12 21:39:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:39:46] [INFO ] [Nat]Absence check using 513 positive place invariants in 760 ms returned sat
[2022-06-12 21:39:46] [INFO ] [Nat]Absence check using 513 positive and 1 generalized place invariants in 122 ms returned sat
[2022-06-12 21:39:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:49] [INFO ] [Nat]Absence check using state equation in 2688 ms returned sat
[2022-06-12 21:39:49] [INFO ] [Nat]Added 384 Read/Feed constraints in 154 ms returned sat
[2022-06-12 21:39:50] [INFO ] Deduced a trap composed of 1241 places in 647 ms of which 2 ms to minimize.
[2022-06-12 21:39:51] [INFO ] Deduced a trap composed of 1148 places in 606 ms of which 1 ms to minimize.
[2022-06-12 21:39:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
FORMULA AutoFlight-PT-96a-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-96a-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-96a-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-96a-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-96a-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 1 different solutions.
Support contains 47 out of 2251 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2251/2251 places, 1841/1841 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 2251 transition count 1422
Reduce places removed 419 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 426 rules applied. Total rules applied 845 place count 1832 transition count 1415
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 852 place count 1825 transition count 1415
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 128 Pre rules applied. Total rules applied 852 place count 1825 transition count 1287
Deduced a syphon composed of 128 places in 2 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 1108 place count 1697 transition count 1287
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 135
Deduced a syphon composed of 135 places in 14 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 270 rules applied. Total rules applied 1378 place count 1562 transition count 1152
Free-agglomeration rule applied 136 times.
Iterating global reduction 3 with 136 rules applied. Total rules applied 1514 place count 1562 transition count 1016
Reduce places removed 136 places and 0 transitions.
Iterating post reduction 3 with 136 rules applied. Total rules applied 1650 place count 1426 transition count 1016
Applied a total of 1650 rules in 749 ms. Remains 1426 /2251 variables (removed 825) and now considering 1016/1841 (removed 825) transitions.
Finished structural reductions, in 1 iterations. Remains : 1426/2251 places, 1016/1841 transitions.
[2022-06-12 21:39:52] [INFO ] Flatten gal took : 212 ms
[2022-06-12 21:39:52] [INFO ] Flatten gal took : 85 ms
[2022-06-12 21:39:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17315530236615556082.gal : 29 ms
[2022-06-12 21:39:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5886634764118898103.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality17315530236615556082.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5886634764118898103.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality17315530236615556082.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5886634764118898103.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5886634764118898103.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :9 after 33
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :33 after 65
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :65 after 2049
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :2049 after 8193
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :8193 after 32769
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :32769 after 2.3593e+06
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :2.3593e+06 after 2.49037e+06
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :2.49037e+06 after 2.75251e+06
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :2.75251e+06 after 3.21971e+06
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :3.21971e+06 after 3.22608e+06
Detected timeout of ITS tools.
[2022-06-12 21:40:07] [INFO ] Flatten gal took : 135 ms
[2022-06-12 21:40:07] [INFO ] Applying decomposition
[2022-06-12 21:40:07] [INFO ] Flatten gal took : 93 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6121873330063765925.txt, -o, /tmp/graph6121873330063765925.bin, -w, /tmp/graph6121873330063765925.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6121873330063765925.bin, -l, -1, -v, -w, /tmp/graph6121873330063765925.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:40:08] [INFO ] Decomposing Gal with order
[2022-06-12 21:40:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:40:08] [INFO ] Removed a total of 144 redundant transitions.
[2022-06-12 21:40:08] [INFO ] Flatten gal took : 259 ms
[2022-06-12 21:40:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 46 ms.
[2022-06-12 21:40:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1552617129373944543.gal : 26 ms
[2022-06-12 21:40:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12454132815457248450.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality1552617129373944543.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12454132815457248450.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality1552617129373944543.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12454132815457248450.prop --nowitness
Loading property file /tmp/ReachabilityCardinality12454132815457248450.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :9 after 65
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :65 after 18945
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :18945 after 51201
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :51201 after 113153
Invariant property AutoFlight-PT-96a-ReachabilityCardinality-15 does not hold.
FORMULA AutoFlight-PT-96a-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property AutoFlight-PT-96a-ReachabilityCardinality-12 is true.
FORMULA AutoFlight-PT-96a-ReachabilityCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property AutoFlight-PT-96a-ReachabilityCardinality-08 is true.
FORMULA AutoFlight-PT-96a-ReachabilityCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property AutoFlight-PT-96a-ReachabilityCardinality-07 is true.
FORMULA AutoFlight-PT-96a-ReachabilityCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :113153 after 620033
Invariant property AutoFlight-PT-96a-ReachabilityCardinality-11 does not hold.
FORMULA AutoFlight-PT-96a-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :620033 after 650241
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :650241 after 1.45203e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8597226658050831025
[2022-06-12 21:40:23] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8597226658050831025
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8597226658050831025]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8597226658050831025] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8597226658050831025] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Finished random walk after 699 steps, including 7 resets, run visited all 1 properties in 38 ms. (steps per millisecond=18 )
FORMULA AutoFlight-PT-96a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655070025027

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-96a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is AutoFlight-PT-96a, 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 r010-tajo-165245701800194"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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