fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r037-tajo-167813689900101
Last Updated
May 14, 2023

About the Execution of ITS-Tools for BridgeAndVehicles-COL-V50P50N20

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3382.331 768081.00 800963.00 377.10 50 1 1 1 1 50 1 20 1 1 50 1 50 1 50 50 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/mcc2023-input.r037-tajo-167813689900101.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is BridgeAndVehicles-COL-V50P50N20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813689900101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 8.7K Feb 25 12:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 12:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 12:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 12:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 12:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 42K Mar 5 18:22 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-V50P50N20-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678322164704

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V50P50N20
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202303021504
[2023-03-09 00:36:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 00:36:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 00:36:06] [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.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-09 00:36:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-09 00:36:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 559 ms
[2023-03-09 00:36:07] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 138 PT places and 218878.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
[2023-03-09 00:36:07] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2023-03-09 00:36:07] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
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
[2023-03-09 00:36:07] [INFO ] Computed 4 place invariants in 3 ms
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-09 00:36:07] [INFO ] Invariant cache hit.
[2023-03-09 00:36:07] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-09 00:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:07] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-09 00:36:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:36:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 00:36:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:07] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-09 00:36:07] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-09 00:36:07] [INFO ] Added : 2 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 5 ms.
[2023-03-09 00:36:07] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 00:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:07] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-09 00:36:07] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-09 00:36:07] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 13 ms.
[2023-03-09 00:36:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:36:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 12 ms returned sat
[2023-03-09 00:36:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:07] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-09 00:36:07] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 00:36:07] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2023-03-09 00:36:07] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 00:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:07] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-09 00:36:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:36:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 00:36:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:07] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-09 00:36:07] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-09 00:36:07] [INFO ] Added : 2 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 4 ms.
[2023-03-09 00:36:07] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 00:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-09 00:36:07] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 00:36:07] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2023-03-09 00:36:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:36:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 00:36:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:07] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-09 00:36:07] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 00:36:07] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2023-03-09 00:36:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 00:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:08] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-09 00:36:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:36:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2023-03-09 00:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:08] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-09 00:36:08] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-09 00:36:08] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2023-03-09 00:36:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 00:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:08] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-09 00:36:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:36:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-09 00:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:08] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-09 00:36:08] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-09 00:36:08] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 2 ms.
[2023-03-09 00:36:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 00:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:08] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-09 00:36:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:36:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 00:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:08] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-09 00:36:08] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-09 00:36:08] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2023-03-09 00:36:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 00:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:08] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-09 00:36:08] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 00:36:08] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2023-03-09 00:36:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:36:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 00:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:08] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-09 00:36:08] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 00:36:08] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2023-03-09 00:36:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 00:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:08] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-09 00:36:08] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 00:36:08] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2023-03-09 00:36:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-09 00:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:08] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-09 00:36:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:36:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-09 00:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:08] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-09 00:36:08] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-09 00:36:08] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [50, 1, 50, 1, 50, 1, 50, 1, 50, 50]
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2023-03-09 00:36:08] [INFO ] Unfolded HLPN to a Petri net with 138 places and 2348 transitions 18090 arcs in 107 ms.
[2023-03-09 00:36:08] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 10) seen :255
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :201
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-09 00:36:08] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2023-03-09 00:36:08] [INFO ] Computed 7 place invariants in 18 ms
[2023-03-09 00:36:08] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-09 00:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:09] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-09 00:36:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:36:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-09 00:36:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:09] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2023-03-09 00:36:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 00:36:09] [INFO ] [Nat]Added 42 Read/Feed constraints in 37 ms returned sat
[2023-03-09 00:36:09] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 120 ms.
[2023-03-09 00:36:09] [INFO ] Added : 20 causal constraints over 4 iterations in 311 ms. Result :sat
Minimization took 300 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[5]
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 411 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2023-03-09 00:36:10] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-09 00:36:10] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-09 00:36:11] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1268 ms. Remains : 135/138 places, 2347/2348 transitions.
Normalized transition count is 289 out of 2347 initially.
// Phase 1: matrix 289 rows 135 cols
[2023-03-09 00:36:11] [INFO ] Computed 5 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2682 resets, run finished after 8977 ms. (steps per millisecond=111 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000002 steps, including 1064 resets, run finished after 3263 ms. (steps per millisecond=306 ) properties (out of 1) seen :20
[2023-03-09 00:36:24] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-09 00:36:24] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-09 00:36:24] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 00:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:24] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-09 00:36:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:36:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 00:36:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:24] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-09 00:36:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 00:36:24] [INFO ] [Nat]Added 42 Read/Feed constraints in 107 ms returned sat
[2023-03-09 00:36:24] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 102 ms.
[2023-03-09 00:36:24] [INFO ] Added : 20 causal constraints over 4 iterations in 326 ms. Result :sat
Minimization took 123 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 287 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 135/135 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 299 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-09 00:36:26] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-09 00:36:26] [INFO ] Invariant cache hit.
[2023-03-09 00:36:26] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-09 00:36:26] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-09 00:36:26] [INFO ] Invariant cache hit.
[2023-03-09 00:36:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 00:36:27] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1428 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 133/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 311 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2039 ms. Remains : 133/135 places, 2347/2347 transitions.
Normalized transition count is 289 out of 2347 initially.
// Phase 1: matrix 289 rows 133 cols
[2023-03-09 00:36:27] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2682 resets, run finished after 7338 ms. (steps per millisecond=136 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000000 steps, including 1062 resets, run finished after 2787 ms. (steps per millisecond=358 ) properties (out of 1) seen :20
[2023-03-09 00:36:37] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-09 00:36:38] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-09 00:36:38] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 00:36:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:38] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-09 00:36:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:36:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 00:36:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:38] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-09 00:36:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 00:36:38] [INFO ] [Nat]Added 42 Read/Feed constraints in 57 ms returned sat
[2023-03-09 00:36:38] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 117 ms.
[2023-03-09 00:36:38] [INFO ] Added : 20 causal constraints over 4 iterations in 423 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 241 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 208 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-09 00:36:39] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-09 00:36:39] [INFO ] Invariant cache hit.
[2023-03-09 00:36:40] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-09 00:36:40] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-09 00:36:40] [INFO ] Invariant cache hit.
[2023-03-09 00:36:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 00:36:40] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
[2023-03-09 00:36:41] [INFO ] Redundant transitions in 111 ms returned []
[2023-03-09 00:36:41] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-09 00:36:41] [INFO ] Invariant cache hit.
[2023-03-09 00:36:41] [INFO ] Dead Transitions using invariants and state equation in 896 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2270 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting property specific reduction for BridgeAndVehicles-COL-V50P50N20-UpperBounds-07
Normalized transition count is 289 out of 2347 initially.
// Phase 1: matrix 289 rows 133 cols
[2023-03-09 00:36:41] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 26 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10010 steps, including 10 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :20
[2023-03-09 00:36:42] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-09 00:36:42] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 00:36:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 00:36:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:42] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-09 00:36:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:36:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 00:36:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:42] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-09 00:36:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 00:36:42] [INFO ] [Nat]Added 42 Read/Feed constraints in 52 ms returned sat
[2023-03-09 00:36:42] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 78 ms.
[2023-03-09 00:36:42] [INFO ] Added : 20 causal constraints over 4 iterations in 237 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 219 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-09 00:36:43] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-09 00:36:43] [INFO ] Invariant cache hit.
[2023-03-09 00:36:44] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 964 ms. Remains : 133/133 places, 2347/2347 transitions.
Normalized transition count is 289 out of 2347 initially.
// Phase 1: matrix 289 rows 133 cols
[2023-03-09 00:36:44] [INFO ] Computed 5 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2682 resets, run finished after 7793 ms. (steps per millisecond=128 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 1064 resets, run finished after 3019 ms. (steps per millisecond=331 ) properties (out of 1) seen :20
[2023-03-09 00:36:55] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-09 00:36:55] [INFO ] Computed 5 place invariants in 11 ms
[2023-03-09 00:36:55] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-09 00:36:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:55] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-09 00:36:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:36:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 00:36:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:36:55] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-09 00:36:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 00:36:55] [INFO ] [Nat]Added 42 Read/Feed constraints in 72 ms returned sat
[2023-03-09 00:36:55] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 67 ms.
[2023-03-09 00:36:55] [INFO ] Added : 20 causal constraints over 4 iterations in 213 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 267 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 242 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-09 00:36:56] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-09 00:36:56] [INFO ] Invariant cache hit.
[2023-03-09 00:36:57] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-03-09 00:36:57] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-09 00:36:57] [INFO ] Invariant cache hit.
[2023-03-09 00:36:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-09 00:36:58] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
[2023-03-09 00:36:58] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-09 00:36:58] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-09 00:36:58] [INFO ] Invariant cache hit.
[2023-03-09 00:36:59] [INFO ] Dead Transitions using invariants and state equation in 777 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2448 ms. Remains : 133/133 places, 2347/2347 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V50P50N20-UpperBounds-07 in 17140 ms.
[2023-03-09 00:36:59] [INFO ] Flatten gal took : 183 ms
[2023-03-09 00:36:59] [INFO ] Applying decomposition
[2023-03-09 00:36:59] [INFO ] Flatten gal took : 114 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18251325239959171711.txt' '-o' '/tmp/graph18251325239959171711.bin' '-w' '/tmp/graph18251325239959171711.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18251325239959171711.bin' '-l' '-1' '-v' '-w' '/tmp/graph18251325239959171711.weights' '-q' '0' '-e' '0.001'
[2023-03-09 00:37:00] [INFO ] Decomposing Gal with order
[2023-03-09 00:37:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 00:37:01] [INFO ] Removed a total of 4373 redundant transitions.
[2023-03-09 00:37:01] [INFO ] Flatten gal took : 724 ms
[2023-03-09 00:37:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 327 labels/synchronizations in 53 ms.
[2023-03-09 00:37:01] [INFO ] Time to serialize gal into /tmp/UpperBounds14475364206677450548.gal : 4 ms
[2023-03-09 00:37:01] [INFO ] Time to serialize properties into /tmp/UpperBounds16950401652684142040.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14475364206677450548.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16950401652684142040.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds16950401652684142040.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.96312e+08,707.071,2756748,2510,24670,495396,3.34838e+06,109,1.71358e+06,419,4.56619e+07,0
Total reachable state count : 496311560

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 20
Bounds property BridgeAndVehicles-COL-V50P50N20-UpperBounds-07 :0 <= u1.SUR_PONT_A_0 <= 20
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-07 20 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-COL-V50P50N20-UpperBounds-07,0,710.283,2756748,1,0,495396,3.34838e+06,136,1.71358e+06,503,4.56619e+07,178
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 765946 ms.

BK_STOP 1678322932785

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V50P50N20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-V50P50N20, 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 r037-tajo-167813689900101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V50P50N20.tgz
mv BridgeAndVehicles-COL-V50P50N20 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;