Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414300056.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BridgeAndVehicles-COL-V50P50N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414300056
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.4K Apr 13 02:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 13 02:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 02:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 02:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 02:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 13 02:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 13 02:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 13 02:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:42 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-V50P50N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716624485457

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V50P50N10
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-25 08:08:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 08:08:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 08:08:07] [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.
[2024-05-25 08:08:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 08:08:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 418 ms
[2024-05-25 08:08:07] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 128 PT places and 114798.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-05-25 08:08:07] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-05-25 08:08:07] [INFO ] Skeletonized 16 HLPN properties in 1 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
[2024-05-25 08:08:07] [INFO ] Computed 4 invariants in 4 ms
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-25 08:08:07] [INFO ] Invariant cache hit.
[2024-05-25 08:08:07] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-25 08:08:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:07] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 08:08:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:08:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 08:08:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:07] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 08:08:07] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 08:08:07] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 08:08:07] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-25 08:08:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:07] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 08:08:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:08:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 08:08:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:07] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-25 08:08:07] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 08:08:07] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 08:08:07] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 08:08:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:07] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 08:08:07] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 08:08:07] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 2 ms.
[2024-05-25 08:08:07] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-25 08:08:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:07] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 08:08:07] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 08:08:07] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 08:08:08] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-25 08:08:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:08] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 08:08:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:08:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-25 08:08:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:08] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-25 08:08:08] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 08:08:08] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 08:08:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 08:08:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:08] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 08:08:08] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 08:08:08] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 08:08:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:08:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 08:08:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:08] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-25 08:08:08] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 08:08:08] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 08:08:08] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-25 08:08:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:08] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-25 08:08:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:08:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 08:08:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:08] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-25 08:08:08] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 08:08:08] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 08:08:08] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-25 08:08:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:08] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 08:08:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:08:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 08:08:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:08] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 08:08:08] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 08:08:08] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 08:08:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 08:08:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:08] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-25 08:08:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:08:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 08:08:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:08] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 08:08:08] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 08:08:08] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 08:08:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 08:08:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:08] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 08:08:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:08:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-25 08:08:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:08] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 08:08:08] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 08:08:08] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 08:08:08] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-25 08:08:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:08] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 08:08:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:08:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 08:08:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:08] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-25 08:08:08] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 08:08:08] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 08:08:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 08:08:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:08] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 08:08:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:08:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 08:08:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 08:08:08] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 08:08:08] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50, 50, 50, 1, 50, 50, 50, 50, 1, 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) 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
[2024-05-25 08:08:08] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions 10010 arcs in 80 ms.
[2024-05-25 08:08:08] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 12) seen :382
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :252
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :20
[2024-05-25 08:08:08] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2024-05-25 08:08:08] [INFO ] Computed 7 invariants in 17 ms
[2024-05-25 08:08:09] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-25 08:08:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:09] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-25 08:08:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:08:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-25 08:08:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:09] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-25 08:08:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:08:09] [INFO ] [Nat]Added 22 Read/Feed constraints in 20 ms returned sat
[2024-05-25 08:08:09] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 88 ms.
[2024-05-25 08:08:09] [INFO ] Added : 11 causal constraints over 10 iterations in 222 ms. Result :sat
Minimization took 155 ms.
[2024-05-25 08:08:09] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-25 08:08:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:09] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-25 08:08:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:08:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-25 08:08:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:09] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-25 08:08:09] [INFO ] [Nat]Added 22 Read/Feed constraints in 18 ms returned sat
[2024-05-25 08:08:09] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 73 ms.
[2024-05-25 08:08:10] [INFO ] Added : 11 causal constraints over 10 iterations in 195 ms. Result :sat
Minimization took 153 ms.
Current structural bounds on expressions (after SMT) : [50, 50] Max seen :[10, 10]
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 1222 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 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 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 1327
Applied a total of 3 rules in 224 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2024-05-25 08:08:10] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2024-05-25 08:08:10] [INFO ] Computed 5 invariants in 13 ms
[2024-05-25 08:08:11] [INFO ] Dead Transitions using invariants and state equation in 459 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 686 ms. Remains : 125/128 places, 1327/1328 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 125 cols
[2024-05-25 08:08:11] [INFO ] Computed 5 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 4780 ms. (steps per millisecond=209 ) properties (out of 2) seen :20
Incomplete Best-First random walk after 1000001 steps, including 1029 resets, run finished after 1762 ms. (steps per millisecond=567 ) properties (out of 2) seen :20
Incomplete Best-First random walk after 1000001 steps, including 1030 resets, run finished after 1713 ms. (steps per millisecond=583 ) properties (out of 2) seen :20
[2024-05-25 08:08:19] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2024-05-25 08:08:19] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 08:08:19] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 08:08:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:19] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-25 08:08:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:08:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:08:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:19] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-25 08:08:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:08:20] [INFO ] [Nat]Added 22 Read/Feed constraints in 128 ms returned sat
[2024-05-25 08:08:20] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 60 ms.
[2024-05-25 08:08:20] [INFO ] Added : 13 causal constraints over 10 iterations in 264 ms. Result :sat
Minimization took 169 ms.
[2024-05-25 08:08:20] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 08:08:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:20] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-25 08:08:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:08:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 08:08:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:20] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-25 08:08:20] [INFO ] [Nat]Added 22 Read/Feed constraints in 94 ms returned sat
[2024-05-25 08:08:21] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 63 ms.
[2024-05-25 08:08:21] [INFO ] Added : 13 causal constraints over 10 iterations in 270 ms. Result :sat
Minimization took 136 ms.
Current structural bounds on expressions (after SMT) : [50, 50] Max seen :[10, 10]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 90 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 125/125 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 122 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2024-05-25 08:08:22] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2024-05-25 08:08:22] [INFO ] Invariant cache hit.
[2024-05-25 08:08:22] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-25 08:08:22] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2024-05-25 08:08:22] [INFO ] Invariant cache hit.
[2024-05-25 08:08:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:08:22] [INFO ] Implicit Places using invariants and state equation in 587 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 874 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 77 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1074 ms. Remains : 123/125 places, 1327/1327 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2024-05-25 08:08:23] [INFO ] Computed 5 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 4017 ms. (steps per millisecond=248 ) properties (out of 2) seen :20
Incomplete Best-First random walk after 1000001 steps, including 1030 resets, run finished after 1512 ms. (steps per millisecond=661 ) properties (out of 2) seen :20
Incomplete Best-First random walk after 1000000 steps, including 1028 resets, run finished after 1515 ms. (steps per millisecond=660 ) properties (out of 2) seen :20
[2024-05-25 08:08:30] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2024-05-25 08:08:30] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 08:08:30] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 08:08:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:30] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-25 08:08:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:08:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 08:08:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:30] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-25 08:08:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:08:30] [INFO ] [Nat]Added 22 Read/Feed constraints in 17 ms returned sat
[2024-05-25 08:08:30] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 3 ms to minimize.
[2024-05-25 08:08:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2024-05-25 08:08:30] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 34 ms.
[2024-05-25 08:08:30] [INFO ] Added : 12 causal constraints over 10 iterations in 178 ms. Result :sat
Minimization took 53 ms.
[2024-05-25 08:08:30] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 08:08:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:30] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-25 08:08:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:08:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2024-05-25 08:08:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:31] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-25 08:08:31] [INFO ] [Nat]Added 22 Read/Feed constraints in 15 ms returned sat
[2024-05-25 08:08:31] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2024-05-25 08:08:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2024-05-25 08:08:31] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 35 ms.
[2024-05-25 08:08:31] [INFO ] Added : 12 causal constraints over 10 iterations in 228 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [50, 50] Max seen :[10, 10]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 56 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 58 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2024-05-25 08:08:31] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2024-05-25 08:08:31] [INFO ] Invariant cache hit.
[2024-05-25 08:08:32] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-25 08:08:32] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2024-05-25 08:08:32] [INFO ] Invariant cache hit.
[2024-05-25 08:08:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:08:32] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
[2024-05-25 08:08:32] [INFO ] Redundant transitions in 130 ms returned []
[2024-05-25 08:08:32] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2024-05-25 08:08:32] [INFO ] Invariant cache hit.
[2024-05-25 08:08:33] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1592 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting property specific reduction for BridgeAndVehicles-COL-V50P50N10-UpperBounds-08
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2024-05-25 08:08:33] [INFO ] Computed 5 invariants in 6 ms
Incomplete random walk after 10000 steps, including 26 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :10
[2024-05-25 08:08:33] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2024-05-25 08:08:33] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 08:08:33] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 08:08:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:33] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-25 08:08:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:08:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 08:08:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:33] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-25 08:08:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:08:33] [INFO ] [Nat]Added 22 Read/Feed constraints in 17 ms returned sat
[2024-05-25 08:08:34] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 2 ms to minimize.
[2024-05-25 08:08:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2024-05-25 08:08:34] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 38 ms.
[2024-05-25 08:08:34] [INFO ] Added : 12 causal constraints over 10 iterations in 198 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 72 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2024-05-25 08:08:34] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2024-05-25 08:08:34] [INFO ] Invariant cache hit.
[2024-05-25 08:08:35] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 577 ms. Remains : 123/123 places, 1327/1327 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2024-05-25 08:08:35] [INFO ] Computed 5 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 3970 ms. (steps per millisecond=251 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000000 steps, including 1028 resets, run finished after 1525 ms. (steps per millisecond=655 ) properties (out of 1) seen :10
[2024-05-25 08:08:40] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2024-05-25 08:08:40] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 08:08:40] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 08:08:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:40] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-25 08:08:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:08:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 08:08:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:40] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-25 08:08:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:08:40] [INFO ] [Nat]Added 22 Read/Feed constraints in 18 ms returned sat
[2024-05-25 08:08:41] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 2 ms to minimize.
[2024-05-25 08:08:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2024-05-25 08:08:41] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 33 ms.
[2024-05-25 08:08:41] [INFO ] Added : 12 causal constraints over 10 iterations in 197 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 56 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 56 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2024-05-25 08:08:41] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2024-05-25 08:08:41] [INFO ] Invariant cache hit.
[2024-05-25 08:08:41] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-25 08:08:41] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2024-05-25 08:08:41] [INFO ] Invariant cache hit.
[2024-05-25 08:08:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:08:42] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 895 ms to find 0 implicit places.
[2024-05-25 08:08:42] [INFO ] Redundant transitions in 52 ms returned []
[2024-05-25 08:08:42] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2024-05-25 08:08:42] [INFO ] Invariant cache hit.
[2024-05-25 08:08:42] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1449 ms. Remains : 123/123 places, 1327/1327 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V50P50N10-UpperBounds-08 in 9481 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V50P50N10-UpperBounds-15
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2024-05-25 08:08:42] [INFO ] Computed 5 invariants in 1 ms
Incomplete random walk after 10000 steps, including 26 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :10
[2024-05-25 08:08:43] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2024-05-25 08:08:43] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 08:08:43] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:08:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:43] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-25 08:08:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:08:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:08:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:43] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-25 08:08:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:08:43] [INFO ] [Nat]Added 22 Read/Feed constraints in 16 ms returned sat
[2024-05-25 08:08:43] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 2 ms to minimize.
[2024-05-25 08:08:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2024-05-25 08:08:43] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 41 ms.
[2024-05-25 08:08:43] [INFO ] Added : 12 causal constraints over 10 iterations in 212 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 73 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2024-05-25 08:08:44] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2024-05-25 08:08:44] [INFO ] Invariant cache hit.
[2024-05-25 08:08:44] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 596 ms. Remains : 123/123 places, 1327/1327 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2024-05-25 08:08:44] [INFO ] Computed 5 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 3893 ms. (steps per millisecond=256 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 1029 resets, run finished after 1532 ms. (steps per millisecond=652 ) properties (out of 1) seen :10
[2024-05-25 08:08:50] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2024-05-25 08:08:50] [INFO ] Computed 5 invariants in 6 ms
[2024-05-25 08:08:50] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-25 08:08:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:50] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-25 08:08:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:08:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 08:08:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:08:50] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-25 08:08:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:08:50] [INFO ] [Nat]Added 22 Read/Feed constraints in 25 ms returned sat
[2024-05-25 08:08:50] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 0 ms to minimize.
[2024-05-25 08:08:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2024-05-25 08:08:50] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 32 ms.
[2024-05-25 08:08:50] [INFO ] Added : 12 causal constraints over 10 iterations in 223 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 58 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 54 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2024-05-25 08:08:51] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2024-05-25 08:08:51] [INFO ] Invariant cache hit.
[2024-05-25 08:08:51] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-25 08:08:51] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2024-05-25 08:08:51] [INFO ] Invariant cache hit.
[2024-05-25 08:08:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:08:51] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
[2024-05-25 08:08:51] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-25 08:08:51] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2024-05-25 08:08:51] [INFO ] Invariant cache hit.
[2024-05-25 08:08:52] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1353 ms. Remains : 123/123 places, 1327/1327 transitions.
Ending property specific reduction for BridgeAndVehicles-COL-V50P50N10-UpperBounds-15 in 9467 ms.
[2024-05-25 08:08:52] [INFO ] Flatten gal took : 148 ms
[2024-05-25 08:08:52] [INFO ] Applying decomposition
[2024-05-25 08:08:52] [INFO ] Flatten gal took : 96 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11340890006369586529.txt' '-o' '/tmp/graph11340890006369586529.bin' '-w' '/tmp/graph11340890006369586529.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11340890006369586529.bin' '-l' '-1' '-v' '-w' '/tmp/graph11340890006369586529.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:08:53] [INFO ] Decomposing Gal with order
[2024-05-25 08:08:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:08:53] [INFO ] Removed a total of 3253 redundant transitions.
[2024-05-25 08:08:53] [INFO ] Flatten gal took : 359 ms
[2024-05-25 08:08:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 408 labels/synchronizations in 32 ms.
[2024-05-25 08:08:53] [INFO ] Time to serialize gal into /tmp/UpperBounds10153127727582820671.gal : 4 ms
[2024-05-25 08:08:53] [INFO ] Time to serialize properties into /tmp/UpperBounds6859459676634445308.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10153127727582820671.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6859459676634445308.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds6859459676634445308.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,2.04953e+08,378.271,2474912,2712,9101,1.25875e+06,1.30081e+06,415,1.97377e+07,285,1.13012e+07,0
Total reachable state count : 204953172

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property BridgeAndVehicles-COL-V50P50N10-UpperBounds-08 :0 <= i1.u19.SUR_PONT_B_0 <= 10
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-08 10 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-V50P50N10-UpperBounds-08,0,379.48,2474912,1,0,1.25875e+06,1.30081e+06,557,1.97377e+07,333,1.13012e+07,1059
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property BridgeAndVehicles-COL-V50P50N10-UpperBounds-15 :0 <= i1.u19.SUR_PONT_B_0 <= 10
FORMULA BridgeAndVehicles-COL-V50P50N10-UpperBounds-15 10 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-V50P50N10-UpperBounds-15,0,379.484,2474912,1,0,1.25875e+06,1.30081e+06,557,1.97377e+07,333,1.13012e+07,1059
Total runtime 426455 ms.

BK_STOP 1716624913732

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V50P50N10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is BridgeAndVehicles-COL-V50P50N10, 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 r065-tajo-171620414300056"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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