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-165251917900021.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-V20P10N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251917900021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 7.3K Apr 29 22:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 29 22:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 29 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 22:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:07 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 39K 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-V20P10N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652537435659

Running Version 202205111006
[2022-05-14 14:10:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 14:10:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 14:10:36] [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 14:10:37] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-14 14:10:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 584 ms
[2022-05-14 14:10:37] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 68 PT places and 19578.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
[2022-05-14 14:10:37] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2022-05-14 14:10:37] [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 14:10:37] [INFO ] Computed 4 place invariants in 10 ms
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 10 rows 12 cols
[2022-05-14 14:10:37] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 14:10:37] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-14 14:10:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:10:37] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-14 14:10:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:10:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-14 14:10:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:10:37] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-14 14:10:37] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-14 14:10:37] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2022-05-14 14:10:37] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:10:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:10:37] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-14 14:10:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:10:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-14 14:10:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:10:37] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-14 14:10:37] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-14 14:10:37] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 3 ms.
[2022-05-14 14:10:37] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:10:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:10:37] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-14 14:10:37] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 14:10:37] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2022-05-14 14:10:37] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:10:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:10:37] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-14 14:10:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:10:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-14 14:10:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:10:37] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-14 14:10:37] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-14 14:10:37] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2022-05-14 14:10:37] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:10:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:10:37] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-14 14:10:37] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 14:10:37] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 2 ms.
[2022-05-14 14:10:38] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-14 14:10:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:10:38] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-14 14:10:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:10:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:10:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:10:38] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-14 14:10:38] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-14 14:10:38] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2022-05-14 14:10:38] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:10:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:10:38] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-14 14:10:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:10:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:10:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:10:38] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-14 14:10:38] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 14:10:38] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2022-05-14 14:10:38] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:10:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:10:38] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-14 14:10:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:10:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:10:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:10:38] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-14 14:10:38] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 14:10:38] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2022-05-14 14:10:38] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-14 14:10:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:10:38] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-14 14:10:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:10:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:10:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:10:38] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-14 14:10:38] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 14:10:38] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 2 ms.
[2022-05-14 14:10:38] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:10:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:10:38] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-14 14:10:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:10:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:10:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:10:38] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-14 14:10:38] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-14 14:10:38] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2022-05-14 14:10:38] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:10:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:10:38] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-14 14:10:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:10:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 14:10:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:10:38] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-14 14:10:38] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-14 14:10:38] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [10, 20, 20, 1, 1, 10, 1, 10, 1, 10, 10]
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] 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 14:10:38] [INFO ] Unfolded HLPN to a Petri net with 68 places and 548 transitions 4070 arcs in 39 ms.
[2022-05-14 14:10:38] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :69
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-02 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10009 steps, including 20 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :46
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-05-14 14:10:38] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2022-05-14 14:10:38] [INFO ] Computed 7 place invariants in 9 ms
[2022-05-14 14:10:38] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-14 14:10:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 14:10:38] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-05-14 14:10:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 14:10:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-14 14:10:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 14:10:38] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-05-14 14:10:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-14 14:10:38] [INFO ] [Nat]Added 22 Read/Feed constraints in 11 ms returned sat
[2022-05-14 14:10:38] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 3 ms to minimize.
[2022-05-14 14:10:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2022-05-14 14:10:38] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 38 ms.
[2022-05-14 14:10:38] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2022-05-14 14:10:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2022-05-14 14:10:39] [INFO ] Added : 12 causal constraints over 5 iterations in 197 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[6]
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 65 transition count 547
Applied a total of 3 rules in 82 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2022-05-14 14:10:39] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-14 14:10:39] [INFO ] Computed 5 place invariants in 7 ms
[2022-05-14 14:10:39] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/68 places, 547/548 transitions.
Normalized transition count is 129 out of 547 initially.
// Phase 1: matrix 129 rows 65 cols
[2022-05-14 14:10:39] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 6489 resets, run finished after 2531 ms. (steps per millisecond=395 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 1000000 steps, including 2449 resets, run finished after 1041 ms. (steps per millisecond=960 ) properties (out of 1) seen :10
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 6182 ms.

BK_STOP 1652537443020

--------------------
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-V20P10N10"
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-V20P10N10, 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-165251917900021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P10N10.tgz
mv BridgeAndVehicles-COL-V20P10N10 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 ;