fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r024-tall-165251918100101
Last Updated
Jun 22, 2022

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
4710.104 1136692.00 1174084.00 6208.00 50 20 50 1 50 1 1 1 1 20 50 1 1 1 20 50 normal

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.r024-tall-165251918100101.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 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 r024-tall-165251918100101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 7.7K Apr 29 23:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 23:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 23:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 29 23:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K 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 2.8K May 9 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 42K 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-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 1652557574637

Running Version 202205111006
[2022-05-14 19:46:15] [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 19:46:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 19:46:15] [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.
[2022-05-14 19:46:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-14 19:46:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 590 ms
[2022-05-14 19:46:16] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 138 PT places and 218878.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2022-05-14 19:46:16] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2022-05-14 19:46:16] [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
[2022-05-14 19:46:16] [INFO ] Computed 4 place invariants in 9 ms
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-05 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-02 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 10 rows 12 cols
[2022-05-14 19:46:16] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 19:46:16] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-14 19:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:16] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-14 19:46:16] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-14 19:46:16] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2022-05-14 19:46:16] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-14 19:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:16] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-14 19:46:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:46:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 19:46:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:16] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-14 19:46:16] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-14 19:46:16] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 2 ms.
[2022-05-14 19:46:16] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 19:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:16] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-14 19:46:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:46:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 19:46:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:16] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-14 19:46:16] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 19:46:16] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2022-05-14 19:46:16] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 19:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:16] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-14 19:46:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:46:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 19:46:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:17] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-14 19:46:17] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 19:46:17] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 1 ms.
[2022-05-14 19:46:17] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 19:46:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:17] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-14 19:46:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:46:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 19:46:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:17] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-14 19:46:17] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-14 19:46:17] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 3 ms.
[2022-05-14 19:46:17] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 19:46:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:17] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-14 19:46:17] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-14 19:46:17] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2022-05-14 19:46:17] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-14 19:46:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:17] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-14 19:46:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:46:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 19:46:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:17] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-14 19:46:17] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 19:46:17] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2022-05-14 19:46:17] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 19:46:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:17] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-14 19:46:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:46:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 19:46:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:17] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-14 19:46:17] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 19:46:17] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2022-05-14 19:46:17] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 19:46:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:17] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-14 19:46:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:46:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 19:46:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:17] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-14 19:46:17] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 19:46:17] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50, 1, 50, 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
[2022-05-14 19:46:17] [INFO ] Unfolded HLPN to a Petri net with 138 places and 2348 transitions 18090 arcs in 105 ms.
[2022-05-14 19:46:17] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 9) seen :222
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :46
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :30
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :44
[2022-05-14 19:46:17] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2022-05-14 19:46:17] [INFO ] Computed 7 place invariants in 19 ms
[2022-05-14 19:46:17] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-14 19:46:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:18] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-14 19:46:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:46:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-14 19:46:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:18] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2022-05-14 19:46:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:46:18] [INFO ] [Nat]Added 42 Read/Feed constraints in 29 ms returned sat
[2022-05-14 19:46:18] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 125 ms.
[2022-05-14 19:46:18] [INFO ] Added : 22 causal constraints over 13 iterations in 446 ms. Result :sat
Minimization took 154 ms.
[2022-05-14 19:46:18] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-14 19:46:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:18] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2022-05-14 19:46:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:46:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-14 19:46:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:19] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2022-05-14 19:46:19] [INFO ] [Nat]Added 42 Read/Feed constraints in 19 ms returned sat
[2022-05-14 19:46:19] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 3 ms to minimize.
[2022-05-14 19:46:19] [INFO ] Deduced a trap composed of 6 places in 327 ms of which 1 ms to minimize.
[2022-05-14 19:46:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 634 ms
[2022-05-14 19:46:19] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 146 ms.
[2022-05-14 19:46:20] [INFO ] Added : 21 causal constraints over 5 iterations in 452 ms. Result :sat
Minimization took 174 ms.
[2022-05-14 19:46:20] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-14 19:46:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:20] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2022-05-14 19:46:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:46:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-14 19:46:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:20] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2022-05-14 19:46:20] [INFO ] [Nat]Added 42 Read/Feed constraints in 20 ms returned sat
[2022-05-14 19:46:20] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 56 ms.
[2022-05-14 19:46:21] [INFO ] Added : 22 causal constraints over 13 iterations in 332 ms. Result :sat
Minimization took 156 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50] Max seen :[20, 20, 20]
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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.12 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 400 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
[2022-05-14 19:46:22] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 19:46:22] [INFO ] Computed 5 place invariants in 7 ms
[2022-05-14 19:46:23] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/138 places, 2348/2348 transitions.
Normalized transition count is 290 out of 2348 initially.
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 19:46:23] [INFO ] Computed 5 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2316 resets, run finished after 7351 ms. (steps per millisecond=136 ) properties (out of 3) seen :23
Incomplete Best-First random walk after 1000001 steps, including 778 resets, run finished after 2555 ms. (steps per millisecond=391 ) properties (out of 3) seen :50
Incomplete Best-First random walk after 1000001 steps, including 844 resets, run finished after 2739 ms. (steps per millisecond=365 ) properties (out of 3) seen :42
Incomplete Best-First random walk after 1000001 steps, including 780 resets, run finished after 2497 ms. (steps per millisecond=400 ) properties (out of 3) seen :49
[2022-05-14 19:46:38] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 19:46:38] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:46:38] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:46:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:38] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2022-05-14 19:46:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:46:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:46:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:38] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2022-05-14 19:46:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:46:38] [INFO ] [Nat]Added 42 Read/Feed constraints in 73 ms returned sat
[2022-05-14 19:46:39] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 1 ms to minimize.
[2022-05-14 19:46:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2022-05-14 19:46:39] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 50 ms.
[2022-05-14 19:46:39] [INFO ] Added : 3 causal constraints over 2 iterations in 117 ms. Result :sat
Minimization took 162 ms.
[2022-05-14 19:46:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:46:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:39] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-05-14 19:46:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:46:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:46:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:39] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2022-05-14 19:46:39] [INFO ] [Nat]Added 42 Read/Feed constraints in 34 ms returned sat
[2022-05-14 19:46:39] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 52 ms.
[2022-05-14 19:46:40] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 1 ms to minimize.
[2022-05-14 19:46:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2022-05-14 19:46:40] [INFO ] Added : 21 causal constraints over 5 iterations in 502 ms. Result :sat
Minimization took 130 ms.
[2022-05-14 19:46:40] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:46:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:40] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2022-05-14 19:46:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:46:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:46:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:40] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-14 19:46:40] [INFO ] [Nat]Added 42 Read/Feed constraints in 64 ms returned sat
[2022-05-14 19:46:40] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 1 ms to minimize.
[2022-05-14 19:46:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2022-05-14 19:46:40] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 55 ms.
[2022-05-14 19:46:40] [INFO ] Added : 3 causal constraints over 2 iterations in 133 ms. Result :sat
Minimization took 164 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50] Max seen :[20, 20, 20]
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 176 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 136/136 places, 2348/2348 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 280 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2022-05-14 19:46:42] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 19:46:42] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:46:42] [INFO ] Implicit Places using invariants in 402 ms returned []
[2022-05-14 19:46:42] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 19:46:42] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 19:46:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:46:43] [INFO ] Implicit Places using invariants and state equation in 966 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1391 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 134/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 174 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 134/136 places, 2348/2348 transitions.
Normalized transition count is 290 out of 2348 initially.
// Phase 1: matrix 290 rows 134 cols
[2022-05-14 19:46:43] [INFO ] Computed 5 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2316 resets, run finished after 6748 ms. (steps per millisecond=148 ) properties (out of 3) seen :27
Incomplete Best-First random walk after 1000000 steps, including 778 resets, run finished after 2299 ms. (steps per millisecond=434 ) properties (out of 3) seen :49
Incomplete Best-First random walk after 1000001 steps, including 842 resets, run finished after 2466 ms. (steps per millisecond=405 ) properties (out of 3) seen :38
Incomplete Best-First random walk after 1000000 steps, including 781 resets, run finished after 2269 ms. (steps per millisecond=440 ) properties (out of 3) seen :50
[2022-05-14 19:46:57] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2022-05-14 19:46:57] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 19:46:57] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:46:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:57] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-05-14 19:46:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:46:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-14 19:46:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:57] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2022-05-14 19:46:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:46:57] [INFO ] [Nat]Added 42 Read/Feed constraints in 27 ms returned sat
[2022-05-14 19:46:58] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 0 ms to minimize.
[2022-05-14 19:46:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2022-05-14 19:46:58] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 48 ms.
[2022-05-14 19:46:58] [INFO ] Added : 22 causal constraints over 20 iterations in 423 ms. Result :sat
Minimization took 239 ms.
[2022-05-14 19:46:58] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:58] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2022-05-14 19:46:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:46:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:58] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2022-05-14 19:46:58] [INFO ] [Nat]Added 42 Read/Feed constraints in 19 ms returned sat
[2022-05-14 19:46:58] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 52 ms.
[2022-05-14 19:46:59] [INFO ] Added : 21 causal constraints over 5 iterations in 192 ms. Result :sat
Minimization took 134 ms.
[2022-05-14 19:46:59] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:46:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:59] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2022-05-14 19:46:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:46:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:46:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:46:59] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2022-05-14 19:46:59] [INFO ] [Nat]Added 42 Read/Feed constraints in 21 ms returned sat
[2022-05-14 19:46:59] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 0 ms to minimize.
[2022-05-14 19:46:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2022-05-14 19:46:59] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 56 ms.
[2022-05-14 19:47:00] [INFO ] Added : 22 causal constraints over 20 iterations in 399 ms. Result :sat
Minimization took 225 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50] Max seen :[20, 20, 20]
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Applied a total of 0 rules in 192 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 134/134 places, 2348/2348 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Applied a total of 0 rules in 178 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2022-05-14 19:47:01] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2022-05-14 19:47:01] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 19:47:02] [INFO ] Implicit Places using invariants in 330 ms returned []
[2022-05-14 19:47:02] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2022-05-14 19:47:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:47:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:47:03] [INFO ] Implicit Places using invariants and state equation in 1237 ms returned []
Implicit Place search using SMT with State Equation took 1572 ms to find 0 implicit places.
[2022-05-14 19:47:03] [INFO ] Redundant transitions in 130 ms returned []
[2022-05-14 19:47:03] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2022-05-14 19:47:03] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:47:04] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 134/134 places, 2348/2348 transitions.
Starting property specific reduction for BridgeAndVehicles-COL-V50P50N20-UpperBounds-01
Normalized transition count is 290 out of 2348 initially.
// Phase 1: matrix 290 rows 134 cols
[2022-05-14 19:47:04] [INFO ] Computed 5 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 23 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :20
[2022-05-14 19:47:04] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2022-05-14 19:47:04] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 19:47:04] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-14 19:47:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:47:04] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2022-05-14 19:47:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:47:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-14 19:47:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:47:04] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-05-14 19:47:04] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:47:04] [INFO ] [Nat]Added 42 Read/Feed constraints in 27 ms returned sat
[2022-05-14 19:47:04] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 1 ms to minimize.
[2022-05-14 19:47:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2022-05-14 19:47:04] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 53 ms.
[2022-05-14 19:47:05] [INFO ] Added : 22 causal constraints over 20 iterations in 387 ms. Result :sat
Minimization took 220 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 133 transition count 2347
Applied a total of 2 rules in 185 ms. Remains 133 /134 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2022-05-14 19:47:06] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:47:06] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:47:06] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/134 places, 2347/2348 transitions.
Normalized transition count is 289 out of 2347 initially.
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:47:06] [INFO ] Computed 5 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2682 resets, run finished after 7205 ms. (steps per millisecond=138 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000012 steps, including 992 resets, run finished after 2629 ms. (steps per millisecond=380 ) properties (out of 1) seen :20
[2022-05-14 19:47:16] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:47:16] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 19:47:16] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-14 19:47:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:47:16] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2022-05-14 19:47:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:47:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:47:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:47:16] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-05-14 19:47:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:47:16] [INFO ] [Nat]Added 42 Read/Feed constraints in 24 ms returned sat
[2022-05-14 19:47:16] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 51 ms.
[2022-05-14 19:47:17] [INFO ] Added : 3 causal constraints over 3 iterations in 144 ms. Result :sat
Minimization took 278 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 SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 196 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 172 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 19:47:17] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:47:17] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:47:18] [INFO ] Implicit Places using invariants in 324 ms returned []
[2022-05-14 19:47:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:47:18] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 19:47:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:47:18] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
[2022-05-14 19:47:18] [INFO ] Redundant transitions in 120 ms returned []
[2022-05-14 19:47:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:47:18] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 19:47:19] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V50P50N20-UpperBounds-01 in 15293 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V50P50N20-UpperBounds-09
Normalized transition count is 290 out of 2348 initially.
// Phase 1: matrix 290 rows 134 cols
[2022-05-14 19:47:19] [INFO ] Computed 5 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 23 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :20
[2022-05-14 19:47:19] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2022-05-14 19:47:19] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 19:47:19] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-14 19:47:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:47:19] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2022-05-14 19:47:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:47:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:47:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:47:19] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-05-14 19:47:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:47:19] [INFO ] [Nat]Added 42 Read/Feed constraints in 19 ms returned sat
[2022-05-14 19:47:19] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 49 ms.
[2022-05-14 19:47:20] [INFO ] Added : 21 causal constraints over 5 iterations in 189 ms. Result :sat
Minimization took 129 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 133 transition count 2347
Applied a total of 2 rules in 223 ms. Remains 133 /134 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2022-05-14 19:47:20] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:47:20] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:47:21] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/134 places, 2347/2348 transitions.
Normalized transition count is 289 out of 2347 initially.
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:47:21] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2682 resets, run finished after 7182 ms. (steps per millisecond=139 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000000 steps, including 1065 resets, run finished after 2806 ms. (steps per millisecond=356 ) properties (out of 1) seen :20
[2022-05-14 19:47:31] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:47:31] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 19:47:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:47:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:47:31] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-05-14 19:47:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:47:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:47:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:47:31] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2022-05-14 19:47:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:47:31] [INFO ] [Nat]Added 42 Read/Feed constraints in 60 ms returned sat
[2022-05-14 19:47:31] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 48 ms.
[2022-05-14 19:47:31] [INFO ] Added : 20 causal constraints over 4 iterations in 236 ms. Result :sat
Minimization took 111 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 SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 181 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 174 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 19:47:32] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:47:32] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 19:47:33] [INFO ] Implicit Places using invariants in 326 ms returned []
[2022-05-14 19:47:33] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:47:33] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 19:47:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:47:33] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
[2022-05-14 19:47:33] [INFO ] Redundant transitions in 46 ms returned []
[2022-05-14 19:47:33] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:47:33] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 19:47:34] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V50P50N20-UpperBounds-09 in 15044 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V50P50N20-UpperBounds-14
Normalized transition count is 290 out of 2348 initially.
// Phase 1: matrix 290 rows 134 cols
[2022-05-14 19:47:34] [INFO ] Computed 5 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 23 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :20
[2022-05-14 19:47:34] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2022-05-14 19:47:34] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 19:47:34] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-14 19:47:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:47:34] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-05-14 19:47:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:47:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:47:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:47:34] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2022-05-14 19:47:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:47:34] [INFO ] [Nat]Added 42 Read/Feed constraints in 25 ms returned sat
[2022-05-14 19:47:35] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 0 ms to minimize.
[2022-05-14 19:47:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2022-05-14 19:47:35] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 50 ms.
[2022-05-14 19:47:35] [INFO ] Added : 22 causal constraints over 20 iterations in 388 ms. Result :sat
Minimization took 227 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[20]
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 133 transition count 2347
Applied a total of 2 rules in 177 ms. Remains 133 /134 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2022-05-14 19:47:36] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:47:36] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:47:37] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/134 places, 2347/2348 transitions.
Normalized transition count is 289 out of 2347 initially.
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:47:37] [INFO ] Computed 5 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2682 resets, run finished after 7107 ms. (steps per millisecond=140 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 994 resets, run finished after 2629 ms. (steps per millisecond=380 ) properties (out of 1) seen :20
[2022-05-14 19:47:46] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:47:46] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 19:47:46] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 19:47:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 19:47:46] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2022-05-14 19:47:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 19:47:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-14 19:47:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 19:47:46] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-14 19:47:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:47:47] [INFO ] [Nat]Added 42 Read/Feed constraints in 24 ms returned sat
[2022-05-14 19:47:47] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 67 ms.
[2022-05-14 19:47:47] [INFO ] Added : 3 causal constraints over 3 iterations in 157 ms. Result :sat
Minimization took 279 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 SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 195 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 166 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 19:47:47] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:47:47] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:47:48] [INFO ] Implicit Places using invariants in 325 ms returned []
[2022-05-14 19:47:48] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:47:48] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:47:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 19:47:48] [INFO ] Implicit Places using invariants and state equation in 737 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
[2022-05-14 19:47:48] [INFO ] Redundant transitions in 45 ms returned []
[2022-05-14 19:47:48] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 19:47:48] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 19:47:49] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V50P50N20-UpperBounds-14 in 15002 ms.
[2022-05-14 19:47:49] [INFO ] Flatten gal took : 201 ms
[2022-05-14 19:47:50] [INFO ] Applying decomposition
[2022-05-14 19:47:50] [INFO ] Flatten gal took : 121 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2883536486123212348.txt' '-o' '/tmp/graph2883536486123212348.bin' '-w' '/tmp/graph2883536486123212348.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2883536486123212348.bin' '-l' '-1' '-v' '-w' '/tmp/graph2883536486123212348.weights' '-q' '0' '-e' '0.001'
[2022-05-14 19:47:50] [INFO ] Decomposing Gal with order
[2022-05-14 19:47:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 19:47:51] [INFO ] Removed a total of 4373 redundant transitions.
[2022-05-14 19:47:51] [INFO ] Flatten gal took : 949 ms
[2022-05-14 19:47:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 327 labels/synchronizations in 30 ms.
[2022-05-14 19:47:51] [INFO ] Time to serialize gal into /tmp/UpperBounds7128426702614050753.gal : 5 ms
[2022-05-14 19:47:51] [INFO ] Time to serialize properties into /tmp/UpperBounds16974532690739026408.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7128426702614050753.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16974532690739026408.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds16974532690739026408.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,8.9629e+08,1032.39,3881792,1719,30555,298505,3.33478e+06,109,6.51309e+06,421,6.56252e+07,0
Total reachable state count : 896290210

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 20
Bounds property BridgeAndVehicles-COL-V50P50N20-UpperBounds-01 :0 <= u0.SUR_PONT_B_0 <= 20
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-01 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-01,0,1037.55,3881792,1,0,298505,3.33478e+06,136,6.51309e+06,503,6.56252e+07,280
Min sum of variable value : 0
Maximum sum along a path : 20
Bounds property BridgeAndVehicles-COL-V50P50N20-UpperBounds-09 :0 <= u0.SUR_PONT_A_0 <= 20
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-09 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-09,0,1037.56,3881792,1,0,298505,3.33478e+06,141,6.51309e+06,533,6.56252e+07,286
Min sum of variable value : 0
Maximum sum along a path : 20
Bounds property BridgeAndVehicles-COL-V50P50N20-UpperBounds-14 :0 <= u0.SUR_PONT_B_0 <= 20
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-14 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-14,0,1037.56,3881792,1,0,298505,3.33478e+06,141,6.51309e+06,533,6.56252e+07,286
Total runtime 1135484 ms.

BK_STOP 1652558711329

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-4028"
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 r024-tall-165251918100101"
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 ;