About the Execution of 2021-gold for BridgeAndVehicles-COL-V80P50N20
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.r028-tall-165251936000055.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 BridgeAndVehicles-COL-V80P50N20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936000055
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 7.5K Apr 29 22:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 22:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 29 22:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 29 22:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 45K 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 positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652537457916
Running Version 0
[2022-05-14 14:10:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -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-05-14 14:10:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 14:10:59] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-05-14 14:10:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-14 14:11:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 537 ms
[2022-05-14 14:11:00] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 198 PT places and 551698.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2022-05-14 14:11:00] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions in 3 ms.
[2022-05-14 14:11:00] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_4233103792580447008.dot
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-14 14:11:00] [INFO ] Computed 4 place invariants in 9 ms
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-04 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-03 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-14 14:11:00] [INFO ] Unfolded HLPN to a Petri net with 198 places and 3728 transitions in 82 ms.
[2022-05-14 14:11:00] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 10 rows 12 cols
[2022-05-14 14:11:00] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 14:11:00] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-14 14:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:11:00] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-14 14:11:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:11:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:11:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:11:00] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-14 14:11:00] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-14 14:11:00] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2022-05-14 14:11:00] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:11:00] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-14 14:11:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:11:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:11:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:11:00] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-14 14:11:00] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 14:11:00] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 2 ms.
[2022-05-14 14:11:00] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:11:00] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-14 14:11:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:11:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:11:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:11:00] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-14 14:11:00] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-14 14:11:00] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 3 ms.
[2022-05-14 14:11:00] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2022-05-14 14:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:11:00] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-14 14:11:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:11:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:11:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:11:00] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-14 14:11:00] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 14:11:00] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2022-05-14 14:11:00] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:11:00] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-14 14:11:00] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 14:11:00] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 3 ms.
[2022-05-14 14:11:00] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-14 14:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:11:00] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-14 14:11:00] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 14:11:00] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2022-05-14 14:11:00] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:11:00] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-14 14:11:00] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 14:11:00] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2022-05-14 14:11:00] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:11:00] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-14 14:11:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:11:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:11:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:11:00] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-14 14:11:00] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-14 14:11:00] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [80, 50, 80, 80, 80, 1, 80, 80]
[2022-05-14 14:11:00] [INFO ] Unfolded HLPN to a Petri net with 198 places and 3728 transitions in 43 ms.
[2022-05-14 14:11:00] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_10978537916101625180.dot
Incomplete random walk after 10000 steps, including 14 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 8) seen :475
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-15 80 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-08 80 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-07 80 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-01 80 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :176
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-09 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :81
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-14 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-05-14 14:11:01] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 198 cols
[2022-05-14 14:11:01] [INFO ] Computed 7 place invariants in 31 ms
[2022-05-14 14:11:01] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-14 14:11:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:11:01] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2022-05-14 14:11:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:11:01] [INFO ] [Real]Added 42 Read/Feed constraints in 41 ms returned sat
[2022-05-14 14:11:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:11:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-14 14:11:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:11:01] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2022-05-14 14:11:01] [INFO ] [Nat]Added 42 Read/Feed constraints in 106 ms returned sat
[2022-05-14 14:11:02] [INFO ] Deduced a trap composed of 24 places in 376 ms of which 2 ms to minimize.
[2022-05-14 14:11:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 455 ms
[2022-05-14 14:11:02] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 159 ms.
[2022-05-14 14:11:03] [INFO ] Added : 174 causal constraints over 39 iterations in 1475 ms. Result :sat
Minimization took 339 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Incomplete Parikh walk after 202800 steps, including 1099 resets, run finished after 2415 ms. (steps per millisecond=83 ) properties (out of 1) seen :20 could not realise parikh vector
Support contains 1 out of 198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 198/198 places, 3728/3728 transitions.
Graph (complete) has 1962 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 195 transition count 3727
Applied a total of 3 rules in 767 ms. Remains 195 /198 variables (removed 3) and now considering 3727/3728 (removed 1) transitions.
[2022-05-14 14:11:07] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-14 14:11:07] [INFO ] Computed 5 place invariants in 7 ms
[2022-05-14 14:11:08] [INFO ] Dead Transitions using invariants and state equation in 1105 ms returned []
Finished structural reductions, in 1 iterations. Remains : 195/198 places, 3727/3728 transitions.
Normalized transition count is 409 out of 3727 initially.
// Phase 1: matrix 409 rows 195 cols
[2022-05-14 14:11:08] [INFO ] Computed 5 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 1686 resets, run finished after 12529 ms. (steps per millisecond=79 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000001 steps, including 637 resets, run finished after 4546 ms. (steps per millisecond=219 ) properties (out of 1) seen :20
[2022-05-14 14:11:25] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-14 14:11:25] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 14:11:25] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-14 14:11:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:11:26] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2022-05-14 14:11:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:11:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-14 14:11:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:11:26] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2022-05-14 14:11:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:11:26] [INFO ] [Nat]Added 42 Read/Feed constraints in 164 ms returned sat
[2022-05-14 14:11:27] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 1 ms to minimize.
[2022-05-14 14:11:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 348 ms
[2022-05-14 14:11:27] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 226 transitions) in 233 ms.
[2022-05-14 14:11:28] [INFO ] Added : 176 causal constraints over 38 iterations in 1532 ms. Result :sat
Minimization took 173 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Incomplete Parikh walk after 221000 steps, including 1123 resets, run finished after 2540 ms. (steps per millisecond=87 ) properties (out of 1) seen :20 could not realise parikh vector
Support contains 1 out of 195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 195/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 574 ms. Remains 195 /195 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 3727/3727 transitions.
Starting structural reductions, iteration 0 : 195/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 512 ms. Remains 195 /195 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2022-05-14 14:11:32] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-14 14:11:32] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-14 14:11:32] [INFO ] Implicit Places using invariants in 555 ms returned []
[2022-05-14 14:11:32] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2022-05-14 14:11:32] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 14:11:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:11:35] [INFO ] Implicit Places using invariants and state equation in 2454 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3022 ms to find 2 implicit places.
[2022-05-14 14:11:35] [INFO ] Redundant transitions in 238 ms returned []
[2022-05-14 14:11:35] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2022-05-14 14:11:35] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 14:11:36] [INFO ] Dead Transitions using invariants and state equation in 1101 ms returned []
Starting structural reductions, iteration 1 : 193/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 474 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2022-05-14 14:11:37] [INFO ] Redundant transitions in 210 ms returned []
[2022-05-14 14:11:37] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2022-05-14 14:11:37] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 14:11:38] [INFO ] Dead Transitions using invariants and state equation in 1059 ms returned []
Finished structural reductions, in 2 iterations. Remains : 193/195 places, 3727/3727 transitions.
Normalized transition count is 409 out of 3727 initially.
// Phase 1: matrix 409 rows 193 cols
[2022-05-14 14:11:38] [INFO ] Computed 5 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 1686 resets, run finished after 11645 ms. (steps per millisecond=85 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 635 resets, run finished after 4326 ms. (steps per millisecond=231 ) properties (out of 1) seen :20
[2022-05-14 14:11:54] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2022-05-14 14:11:54] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 14:11:54] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 14:11:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:11:54] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2022-05-14 14:11:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:11:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-14 14:11:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:11:54] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2022-05-14 14:11:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:11:55] [INFO ] [Nat]Added 42 Read/Feed constraints in 159 ms returned sat
[2022-05-14 14:11:55] [INFO ] Deduced a trap composed of 25 places in 263 ms of which 2 ms to minimize.
[2022-05-14 14:11:55] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 0 ms to minimize.
[2022-05-14 14:11:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 582 ms
[2022-05-14 14:11:55] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 226 transitions) in 78 ms.
[2022-05-14 14:11:56] [INFO ] Added : 175 causal constraints over 38 iterations in 1168 ms. Result :sat
Minimization took 203 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Incomplete Parikh walk after 129500 steps, including 890 resets, run finished after 1106 ms. (steps per millisecond=117 ) properties (out of 1) seen :20 could not realise parikh vector
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 459 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 3727/3727 transitions.
Starting structural reductions, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 450 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2022-05-14 14:11:59] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2022-05-14 14:11:59] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 14:11:59] [INFO ] Implicit Places using invariants in 511 ms returned []
[2022-05-14 14:11:59] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2022-05-14 14:11:59] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:11:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:12:00] [INFO ] Implicit Places using invariants and state equation in 1282 ms returned []
Implicit Place search using SMT with State Equation took 1795 ms to find 0 implicit places.
[2022-05-14 14:12:00] [INFO ] Redundant transitions in 126 ms returned []
[2022-05-14 14:12:00] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2022-05-14 14:12:00] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 14:12:01] [INFO ] Dead Transitions using invariants and state equation in 1040 ms returned []
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 3727/3727 transitions.
Starting property specific reduction for BridgeAndVehicles-COL-V80P50N20-UpperBounds-05
Normalized transition count is 409 out of 3727 initially.
// Phase 1: matrix 409 rows 193 cols
[2022-05-14 14:12:02] [INFO ] Computed 5 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 16 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :20
[2022-05-14 14:12:02] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2022-05-14 14:12:02] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 14:12:02] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 14:12:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:12:02] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2022-05-14 14:12:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:12:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 14:12:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:12:02] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2022-05-14 14:12:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:12:02] [INFO ] [Nat]Added 42 Read/Feed constraints in 150 ms returned sat
[2022-05-14 14:12:02] [INFO ] Deduced a trap composed of 25 places in 269 ms of which 1 ms to minimize.
[2022-05-14 14:12:03] [INFO ] Deduced a trap composed of 24 places in 244 ms of which 1 ms to minimize.
[2022-05-14 14:12:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 577 ms
[2022-05-14 14:12:03] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 226 transitions) in 79 ms.
[2022-05-14 14:12:04] [INFO ] Added : 175 causal constraints over 38 iterations in 1137 ms. Result :sat
Minimization took 203 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Incomplete Parikh walk after 129500 steps, including 889 resets, run finished after 1086 ms. (steps per millisecond=119 ) properties (out of 1) seen :20 could not realise parikh vector
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 453 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2022-05-14 14:12:06] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2022-05-14 14:12:06] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 14:12:07] [INFO ] Dead Transitions using invariants and state equation in 942 ms returned []
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 3727/3727 transitions.
Normalized transition count is 409 out of 3727 initially.
// Phase 1: matrix 409 rows 193 cols
[2022-05-14 14:12:07] [INFO ] Computed 5 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 1686 resets, run finished after 11365 ms. (steps per millisecond=87 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 636 resets, run finished after 4196 ms. (steps per millisecond=238 ) properties (out of 1) seen :20
[2022-05-14 14:12:22] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2022-05-14 14:12:22] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 14:12:22] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-14 14:12:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:12:22] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2022-05-14 14:12:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:12:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-14 14:12:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:12:22] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2022-05-14 14:12:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:12:23] [INFO ] [Nat]Added 42 Read/Feed constraints in 158 ms returned sat
[2022-05-14 14:12:23] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 0 ms to minimize.
[2022-05-14 14:12:23] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 2 ms to minimize.
[2022-05-14 14:12:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 569 ms
[2022-05-14 14:12:23] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 226 transitions) in 106 ms.
[2022-05-14 14:12:24] [INFO ] Added : 175 causal constraints over 38 iterations in 1163 ms. Result :sat
Minimization took 208 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Incomplete Parikh walk after 129500 steps, including 897 resets, run finished after 1072 ms. (steps per millisecond=120 ) properties (out of 1) seen :20 could not realise parikh vector
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 448 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 3727/3727 transitions.
Starting structural reductions, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 430 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2022-05-14 14:12:27] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2022-05-14 14:12:27] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 14:12:27] [INFO ] Implicit Places using invariants in 484 ms returned []
[2022-05-14 14:12:27] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2022-05-14 14:12:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 14:12:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 14:12:28] [INFO ] Implicit Places using invariants and state equation in 1271 ms returned []
Implicit Place search using SMT with State Equation took 1758 ms to find 0 implicit places.
[2022-05-14 14:12:28] [INFO ] Redundant transitions in 133 ms returned []
[2022-05-14 14:12:28] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2022-05-14 14:12:28] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-14 14:12:29] [INFO ] Dead Transitions using invariants and state equation in 1048 ms returned []
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 3727/3727 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V80P50N20-UpperBounds-05 in 27986 ms.
[2022-05-14 14:12:30] [INFO ] Flatten gal took : 342 ms
[2022-05-14 14:12:30] [INFO ] Applying decomposition
[2022-05-14 14:12:30] [INFO ] Flatten gal took : 189 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/graph11066904315310235385.txt, -o, /tmp/graph11066904315310235385.bin, -w, /tmp/graph11066904315310235385.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/graph11066904315310235385.bin, -l, -1, -v, -w, /tmp/graph11066904315310235385.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-14 14:12:31] [INFO ] Decomposing Gal with order
[2022-05-14 14:12:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 14:12:33] [INFO ] Removed a total of 6953 redundant transitions.
[2022-05-14 14:12:33] [INFO ] Flatten gal took : 1574 ms
[2022-05-14 14:12:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 477 labels/synchronizations in 94 ms.
[2022-05-14 14:12:33] [INFO ] Time to serialize gal into /tmp/UpperBounds16599225535772363705.gal : 6 ms
[2022-05-14 14:12:33] [INFO ] Time to serialize properties into /tmp/UpperBounds16504678143585760093.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/UpperBounds16599225535772363705.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds16504678143585760093.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/UpperBounds16599225535772363705.gal -t CGAL -reachable-file /tmp/UpperBounds16504678143585760093.prop --nowitness
Loading property file /tmp/UpperBounds16504678143585760093.prop.
Detected timeout of ITS tools.
[2022-05-14 14:33:03] [INFO ] Applying decomposition
[2022-05-14 14:33:03] [INFO ] Flatten gal took : 167 ms
[2022-05-14 14:33:04] [INFO ] Decomposing Gal with order
[2022-05-14 14:33:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 14:33:04] [INFO ] Removed a total of 20791 redundant transitions.
[2022-05-14 14:33:04] [INFO ] Flatten gal took : 414 ms
[2022-05-14 14:33:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 77 ms.
[2022-05-14 14:33:04] [INFO ] Time to serialize gal into /tmp/UpperBounds11363478526892519093.gal : 44 ms
[2022-05-14 14:33:04] [INFO ] Time to serialize properties into /tmp/UpperBounds7049398993805479463.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/UpperBounds11363478526892519093.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7049398993805479463.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/UpperBounds11363478526892519093.gal -t CGAL -reachable-file /tmp/UpperBounds7049398993805479463.prop --nowitness
Loading property file /tmp/UpperBounds7049398993805479463.prop.
Detected timeout of ITS tools.
[2022-05-14 14:53:35] [INFO ] Flatten gal took : 129 ms
[2022-05-14 14:53:35] [INFO ] Input system was already deterministic with 3727 transitions.
[2022-05-14 14:53:35] [INFO ] Transformed 193 places.
[2022-05-14 14:53:35] [INFO ] Transformed 3727 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-14 14:53:35] [INFO ] Time to serialize gal into /tmp/UpperBounds8194150199315787408.gal : 21 ms
[2022-05-14 14:53:35] [INFO ] Time to serialize properties into /tmp/UpperBounds8998249071474378794.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/UpperBounds8194150199315787408.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds8998249071474378794.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --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/UpperBounds8194150199315787408.gal -t CGAL -reachable-file /tmp/UpperBounds8998249071474378794.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds8998249071474378794.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="BridgeAndVehicles-COL-V80P50N20"
export BK_EXAMINATION="UpperBounds"
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 BridgeAndVehicles-COL-V80P50N20, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r028-tall-165251936000055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P50N20.tgz
mv BridgeAndVehicles-COL-V80P50N20 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;