Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r305-smll-165463878600207.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is AutonomousCar-PT-09b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878600207
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 6.7K Jun 7 15:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 7 15:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 7 15:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 7 15:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 3 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 3 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 3 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 3 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 16K Jun 7 15:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Jun 7 15:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 7 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Jun 7 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 865K Jun 3 16:02 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 AutonomousCar-PT-09b-ReachabilityFireability-00
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-01
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-02
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-03
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-04
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-05
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-06
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-07
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-08
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-09
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-10
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-11
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-12
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-13
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-14
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654737171252

Running Version 0
[2022-06-09 01:12:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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-09 01:12:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 01:12:55] [INFO ] Load time of PNML (sax parser for PT used): 520 ms
[2022-06-09 01:12:55] [INFO ] Transformed 391 places.
[2022-06-09 01:12:55] [INFO ] Transformed 1554 transitions.
[2022-06-09 01:12:55] [INFO ] Found NUPN structural information;
[2022-06-09 01:12:55] [INFO ] Parsed PT model containing 391 places and 1554 transitions in 668 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 71 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 16) seen :4
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 12) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1554 rows 391 cols
[2022-06-09 01:12:57] [INFO ] Computed 14 place invariants in 67 ms
[2022-06-09 01:12:57] [INFO ] [Real]Absence check using 14 positive place invariants in 25 ms returned sat
[2022-06-09 01:12:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:12:58] [INFO ] [Real]Absence check using state equation in 711 ms returned sat
[2022-06-09 01:12:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:12:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 27 ms returned sat
[2022-06-09 01:12:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:12:59] [INFO ] [Nat]Absence check using state equation in 919 ms returned sat
[2022-06-09 01:13:00] [INFO ] Deduced a trap composed of 34 places in 785 ms of which 8 ms to minimize.
[2022-06-09 01:13:01] [INFO ] Deduced a trap composed of 7 places in 745 ms of which 2 ms to minimize.
[2022-06-09 01:13:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1838 ms
[2022-06-09 01:13:02] [INFO ] Computed and/alt/rep : 315/361/315 causal constraints (skipped 1238 transitions) in 902 ms.
[2022-06-09 01:13:04] [INFO ] Deduced a trap composed of 7 places in 1442 ms of which 3 ms to minimize.
[2022-06-09 01:13:04] [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 0
[2022-06-09 01:13:04] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2022-06-09 01:13:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:13:05] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2022-06-09 01:13:06] [INFO ] Deduced a trap composed of 35 places in 793 ms of which 3 ms to minimize.
[2022-06-09 01:13:07] [INFO ] Deduced a trap composed of 35 places in 1021 ms of which 3 ms to minimize.
[2022-06-09 01:13:08] [INFO ] Deduced a trap composed of 35 places in 1012 ms of which 2 ms to minimize.
[2022-06-09 01:13:09] [INFO ] Deduced a trap composed of 35 places in 872 ms of which 0 ms to minimize.
[2022-06-09 01:13:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4028 ms
[2022-06-09 01:13:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:13:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 23 ms returned sat
[2022-06-09 01:13:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:13:10] [INFO ] [Nat]Absence check using state equation in 637 ms returned sat
[2022-06-09 01:13:11] [INFO ] Deduced a trap composed of 35 places in 850 ms of which 1 ms to minimize.
[2022-06-09 01:13:12] [INFO ] Deduced a trap composed of 35 places in 996 ms of which 1 ms to minimize.
[2022-06-09 01:13:13] [INFO ] Deduced a trap composed of 49 places in 965 ms of which 1 ms to minimize.
[2022-06-09 01:13:14] [INFO ] Deduced a trap composed of 35 places in 901 ms of which 1 ms to minimize.
[2022-06-09 01:13:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4067 ms
[2022-06-09 01:13:15] [INFO ] Computed and/alt/rep : 315/361/315 causal constraints (skipped 1238 transitions) in 840 ms.
[2022-06-09 01:13:15] [INFO ] Added : 0 causal constraints over 0 iterations in 844 ms. Result :unknown
[2022-06-09 01:13:15] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned unsat
[2022-06-09 01:13:15] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2022-06-09 01:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:13:16] [INFO ] [Real]Absence check using state equation in 815 ms returned sat
[2022-06-09 01:13:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:13:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 17 ms returned unsat
[2022-06-09 01:13:16] [INFO ] [Real]Absence check using 14 positive place invariants in 28 ms returned sat
[2022-06-09 01:13:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:13:17] [INFO ] [Real]Absence check using state equation in 765 ms returned sat
[2022-06-09 01:13:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:13:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 17 ms returned sat
[2022-06-09 01:13:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:13:18] [INFO ] [Nat]Absence check using state equation in 709 ms returned sat
[2022-06-09 01:13:19] [INFO ] Deduced a trap composed of 35 places in 1072 ms of which 2 ms to minimize.
[2022-06-09 01:13:20] [INFO ] Deduced a trap composed of 22 places in 1032 ms of which 1 ms to minimize.
[2022-06-09 01:13:21] [INFO ] Deduced a trap composed of 35 places in 1101 ms of which 2 ms to minimize.
[2022-06-09 01:13:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3505 ms
[2022-06-09 01:13:22] [INFO ] Computed and/alt/rep : 315/361/315 causal constraints (skipped 1238 transitions) in 772 ms.
[2022-06-09 01:13:22] [INFO ] Added : 0 causal constraints over 0 iterations in 773 ms. Result :unknown
[2022-06-09 01:13:22] [INFO ] [Real]Absence check using 14 positive place invariants in 29 ms returned sat
[2022-06-09 01:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:13:23] [INFO ] [Real]Absence check using state equation in 911 ms returned sat
[2022-06-09 01:13:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:13:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned unsat
[2022-06-09 01:13:24] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned unsat
[2022-06-09 01:13:24] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2022-06-09 01:13:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:13:24] [INFO ] [Real]Absence check using state equation in 732 ms returned sat
[2022-06-09 01:13:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:13:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned sat
[2022-06-09 01:13:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:13:25] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2022-06-09 01:13:26] [INFO ] Deduced a trap composed of 95 places in 895 ms of which 1 ms to minimize.
[2022-06-09 01:13:27] [INFO ] Deduced a trap composed of 35 places in 1031 ms of which 1 ms to minimize.
[2022-06-09 01:13:28] [INFO ] Deduced a trap composed of 35 places in 1037 ms of which 2 ms to minimize.
[2022-06-09 01:13:29] [INFO ] Deduced a trap composed of 35 places in 1054 ms of which 1 ms to minimize.
[2022-06-09 01:13:31] [INFO ] Deduced a trap composed of 7 places in 1396 ms of which 1 ms to minimize.
[2022-06-09 01:13:31] [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 7
[2022-06-09 01:13:31] [INFO ] [Real]Absence check using 14 positive place invariants in 30 ms returned sat
[2022-06-09 01:13:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:13:32] [INFO ] [Real]Absence check using state equation in 944 ms returned sat
[2022-06-09 01:13:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:13:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned unsat
[2022-06-09 01:13:32] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2022-06-09 01:13:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:13:33] [INFO ] [Real]Absence check using state equation in 704 ms returned sat
[2022-06-09 01:13:34] [INFO ] Deduced a trap composed of 35 places in 1028 ms of which 3 ms to minimize.
[2022-06-09 01:13:35] [INFO ] Deduced a trap composed of 35 places in 1004 ms of which 1 ms to minimize.
[2022-06-09 01:13:36] [INFO ] Deduced a trap composed of 35 places in 955 ms of which 2 ms to minimize.
[2022-06-09 01:13:37] [INFO ] Deduced a trap composed of 35 places in 920 ms of which 1 ms to minimize.
[2022-06-09 01:13:37] [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 9
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 3 different solutions.
Incomplete Parikh walk after 19500 steps, including 279 resets, run finished after 168 ms. (steps per millisecond=116 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 41500 steps, including 526 resets, run finished after 316 ms. (steps per millisecond=131 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 56 out of 391 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 391/391 places, 1554/1554 transitions.
Graph (trivial) has 268 edges and 391 vertex of which 4 / 391 are part of one of the 2 SCC in 15 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1699 edges and 389 vertex of which 382 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.45 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 131 rules applied. Total rules applied 133 place count 382 transition count 1414
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 166 rules applied. Total rules applied 299 place count 253 transition count 1377
Reduce places removed 20 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 26 rules applied. Total rules applied 325 place count 233 transition count 1371
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 334 place count 227 transition count 1368
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 335 place count 226 transition count 1368
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 29 Pre rules applied. Total rules applied 335 place count 226 transition count 1339
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 393 place count 197 transition count 1339
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 428 place count 162 transition count 1304
Iterating global reduction 5 with 35 rules applied. Total rules applied 463 place count 162 transition count 1304
Ensure Unique test removed 325 transitions
Reduce isomorphic transitions removed 325 transitions.
Iterating post reduction 5 with 325 rules applied. Total rules applied 788 place count 162 transition count 979
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 789 place count 161 transition count 970
Iterating global reduction 6 with 1 rules applied. Total rules applied 790 place count 161 transition count 970
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 792 place count 161 transition count 968
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 793 place count 160 transition count 968
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 8 with 56 rules applied. Total rules applied 849 place count 132 transition count 940
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 850 place count 132 transition count 939
Free-agglomeration rule applied 24 times.
Iterating global reduction 8 with 24 rules applied. Total rules applied 874 place count 132 transition count 915
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 898 place count 108 transition count 915
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 900 place count 108 transition count 913
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 905 place count 108 transition count 913
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 906 place count 107 transition count 912
Applied a total of 906 rules in 690 ms. Remains 107 /391 variables (removed 284) and now considering 912/1554 (removed 642) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/391 places, 912/1554 transitions.
[2022-06-09 01:13:40] [INFO ] Flatten gal took : 551 ms
[2022-06-09 01:13:40] [INFO ] Flatten gal took : 217 ms
[2022-06-09 01:13:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3827906670028885378.gal : 74 ms
[2022-06-09 01:13:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12350406652244168774.prop : 2 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/ReachabilityCardinality3827906670028885378.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12350406652244168774.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/ReachabilityCardinality3827906670028885378.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12350406652244168774.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality12350406652244168774.prop.
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 48
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :48 after 3072
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :3072 after 3084
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :3084 after 3127
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :3127 after 3296
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :3296 after 4050
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :4050 after 7341
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :7341 after 21924
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :21924 after 73984
Detected timeout of ITS tools.
[2022-06-09 01:13:55] [INFO ] Flatten gal took : 155 ms
[2022-06-09 01:13:55] [INFO ] Applying decomposition
[2022-06-09 01:13:55] [INFO ] Flatten gal took : 153 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/graph12341252407227478853.txt, -o, /tmp/graph12341252407227478853.bin, -w, /tmp/graph12341252407227478853.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/graph12341252407227478853.bin, -l, -1, -v, -w, /tmp/graph12341252407227478853.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 01:13:56] [INFO ] Decomposing Gal with order
[2022-06-09 01:13:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 01:13:57] [INFO ] Removed a total of 5846 redundant transitions.
[2022-06-09 01:13:57] [INFO ] Flatten gal took : 447 ms
[2022-06-09 01:13:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 61 ms.
[2022-06-09 01:13:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8608978517156799847.gal : 7 ms
[2022-06-09 01:13:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18045154673377261575.prop : 2 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/ReachabilityCardinality8608978517156799847.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality18045154673377261575.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/ReachabilityCardinality8608978517156799847.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality18045154673377261575.prop --nowitness
Loading property file /tmp/ReachabilityCardinality18045154673377261575.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :9 after 61056
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :61056 after 61056
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :61056 after 63576
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :63576 after 84672
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :84672 after 91170
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4058546457411836839
[2022-06-09 01:14:12] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4058546457411836839
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/ltsmin4058546457411836839]
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/ltsmin4058546457411836839] 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/ltsmin4058546457411836839] 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)
Incomplete random walk after 1000000 steps, including 27574 resets, run finished after 8852 ms. (steps per millisecond=112 ) properties (out of 5) seen :4
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 132707 steps, including 319 resets, run visited all 1 properties in 198 ms. (steps per millisecond=670 )
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1654737263980

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="AutonomousCar-PT-09b"
export BK_EXAMINATION="ReachabilityFireability"
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 AutonomousCar-PT-09b, 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 r305-smll-165463878600207"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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