Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r034-tall-177946841700021.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
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 r034-tall-177946841700021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.0K Mar 5 08:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 5 08:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 5 08:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 5 08:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 07:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 15 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 08:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Mar 5 08:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 08:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 5 08:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 39K Mar 3 18:30 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

echo here is the order used to build the result vector(from xml 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 1779481368911

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V20P10N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202604301425
[2026-05-22 20:22:50] [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]
[2026-05-22 20:22:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 20:22:50] [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.
[2026-05-22 20:22:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-22 20:22:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 540 ms
[2026-05-22 20:22:50] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 68 PT places and 19578.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Reduction of identical properties reduced properties to check from 16 to 10
[2026-05-22 20:22:50] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2026-05-22 20:22:50] [INFO ] Skeletonized 10 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.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-414706100197966301.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12395508428257825280.kers'
[2026-05-22 20:22:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-414706100197966301.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12395508428257825280.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 12 cols 28 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-22 20:22:50] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12395508428257825280.kers
Total runtime 0 ms.
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 1, 0, 1, 1, 20, 20] Max Struct:[20, 20, 20, 1, 1, 10, 1, 1, 20, 20]
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-14 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-12 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-15 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-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-22 20:22:50] [INFO ] Invariant cache hit.
[2026-05-22 20:22:50] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-22 20:22:50] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2026-05-22 20:22:51] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-22 20:22:51] [INFO ] Added : 2 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 6 ms.
[2026-05-22 20:22:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-22 20:22:51] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-22 20:22:51] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-22 20:22:51] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 3 ms.
[2026-05-22 20:22:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-22 20:22:51] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-22 20:22:51] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-22 20:22:51] [INFO ] Added : 4 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2026-05-22 20:22:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 20:22:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-22 20:22:51] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-22 20:22:51] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-22 20:22:51] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2026-05-22 20:22:51] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-22 20:22:51] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-22 20:22:51] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-22 20:22:51] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2026-05-22 20:22:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 20:22:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-22 20:22:51] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-05-22 20:22:51] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-22 20:22:51] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 4 ms.
[2026-05-22 20:22:51] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-22 20:22:51] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-22 20:22:51] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-22 20:22:51] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2026-05-22 20:22:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 20:22:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-22 20:22:51] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2026-05-22 20:22:51] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-22 20:22:51] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[20, 20, 20, 1, 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
[2026-05-22 20:22:51] [INFO ] Unfolded HLPN to a Petri net with 68 places and 548 transitions 4070 arcs in 41 ms.
[2026-05-22 20:22:51] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[20, 20, 20, 1, 10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[20, 20, 20, 1, 10]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5015623898785866001.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15464026064517214271.kers'
[2026-05-22 20:22:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5015623898785866001.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15464026064517214271.kers]
Normalized transition count is 130 out of 548 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 68 cols 630 entries
Finished phase 1 with 21 SingleSign rule and 40 generalized
[2026-05-22 20:22:51] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15464026064517214271.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[20, 20, 20, 1, 10]
RANDOM walk for 10000 steps (56 resets) in 78 ms. (126 steps per ms)
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-02 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-11 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-01 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-09 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-13 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-00 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10000 steps (21 resets) in 29 ms. (333 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[10]
[2026-05-22 20:22:51] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7252362669414942610.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6541934172845403944.kers'
[2026-05-22 20:22:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7252362669414942610.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6541934172845403944.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 68 cols 630 entries
Finished phase 1 with 21 SingleSign rule and 40 generalized
[2026-05-22 20:22:51] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6541934172845403944.kers
Total runtime 2 ms.
[2026-05-22 20:22:51] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-22 20:22:51] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2026-05-22 20:22:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-22 20:22:51] [INFO ] [Real]Added 22 Read/Feed constraints in 11 ms returned sat
[2026-05-22 20:22:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 20:22:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-22 20:22:51] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2026-05-22 20:22:51] [INFO ] [Nat]Added 22 Read/Feed constraints in 8 ms returned sat
[2026-05-22 20:22:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2026-05-22 20:22:51] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 25 ms.
[2026-05-22 20:22:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2026-05-22 20:22:52] [INFO ] Added : 3 causal constraints over 2 iterations in 164 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[10]
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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.3 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 68 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
Running 544 sub problems to find dead transitions.
[2026-05-22 20:22:52] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5822367129892925194.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10574012140162313706.kers'
[2026-05-22 20:22:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5822367129892925194.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10574012140162313706.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 129 rows 64 cols 565 entries
Finished phase 1 with 60 SingleSign rule and 0 generalized
[2026-05-22 20:22:52] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10574012140162313706.kers
Total runtime 3 ms.
[2026-05-22 20:22:52] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/7 constraints. Problems are: Problem set: 40 solved, 504 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 40 solved, 504 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 3 (OVERLAPS) 129/194 variables, 65/72 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 22/94 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/94 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 0/194 variables, 0/94 constraints. Problems are: Problem set: 42 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 94 constraints, problems are : Problem set: 42 solved, 502 unsolved in 15539 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 65/65 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 42 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/7 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 129/194 variables, 65/72 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 22/94 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 502/596 constraints. Problems are: Problem set: 42 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 194/194 variables, and 596 constraints, problems are : Problem set: 42 solved, 502 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 65/65 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 502/544 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36390ms problems are : Problem set: 42 solved, 502 unsolved
Search for dead transitions found 42 dead transitions in 36407ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 42 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/68 places, 505/548 transitions.
Applied a total of 0 rules in 22 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36525 ms. Remains : 65/68 places, 505/548 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11629327763491257670.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6214736488904813669.kers'
[2026-05-22 20:23:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11629327763491257670.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6214736488904813669.kers]
Normalized transition count is 125 out of 505 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 125 rows 64 cols 553 entries
Finished phase 1 with 57 SingleSign rule and 1 generalized
[2026-05-22 20:23:28] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6214736488904813669.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[10]
RANDOM walk for 1000000 steps (6488 resets) in 2626 ms. (380 steps per ms)
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2453 resets) in 1034 ms. (966 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 42366 ms.

BK_STOP 1779481412467

--------------------
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
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-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-5973"
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 r034-tall-177946841700021"
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.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 ;