Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399200309.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 itstools
Input is BridgeAndVehicles-PT-V80P50N20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399200309
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 21K Apr 13 01:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 13 01:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 386K Apr 13 00:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 13 00:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 286K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 828K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Apr 13 02:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 198K Apr 13 02:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 963K Apr 13 01:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.7M Apr 13 01:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M 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-PT-V80P50N20-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716330826638

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P50N20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 22:33:48] [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-21 22:33:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:33:48] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2024-05-21 22:33:48] [INFO ] Transformed 198 places.
[2024-05-21 22:33:48] [INFO ] Transformed 3728 transitions.
[2024-05-21 22:33:48] [INFO ] Parsed PT model containing 198 places and 3728 transitions and 28830 arcs in 344 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 11
FORMULA BridgeAndVehicles-PT-V80P50N20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 80, 50, 0, 80, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 80, 50, 0, 80, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-21 22:33:48] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 198 cols
[2024-05-21 22:33:48] [INFO ] Computed 7 invariants in 46 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 80, 50, 0, 80, 0, 0, 0, 0] Max Struct:[50, 80, 80, 50, 80, 80, 1, 1, 1, 1]
FORMULA BridgeAndVehicles-PT-V80P50N20-UpperBounds-09 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N20-UpperBounds-07 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N20-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N20-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N20-UpperBounds-04 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N20-UpperBounds-03 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (14 resets) in 264 ms. (37 steps per ms)
FORMULA BridgeAndVehicles-PT-V80P50N20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P50N20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P50N20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P50N20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P50N20-UpperBounds-10 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P50N20-UpperBounds-06 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P50N20-UpperBounds-02 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (5 resets) in 40 ms. (243 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[50]
[2024-05-21 22:33:49] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 22:33:49] [INFO ] Invariant cache hit.
[2024-05-21 22:33:49] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-05-21 22:33:49] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2024-05-21 22:33:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:33:49] [INFO ] [Real]Added 42 Read/Feed constraints in 30 ms returned sat
[2024-05-21 22:33:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:33:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 22:33:49] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-21 22:33:49] [INFO ] [Nat]Added 42 Read/Feed constraints in 54 ms returned sat
[2024-05-21 22:33:50] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 209 ms.
[2024-05-21 22:33:50] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 16 ms to minimize.
[2024-05-21 22:33:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2024-05-21 22:33:50] [INFO ] Added : 5 causal constraints over 4 iterations in 776 ms. Result :sat
Minimization took 422 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[50]
Support contains 1 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Graph (complete) has 1962 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.26 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 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 195 transition count 3727
Applied a total of 3 rules in 899 ms. Remains 195 /198 variables (removed 3) and now considering 3727/3728 (removed 1) transitions.
Running 3724 sub problems to find dead transitions.
[2024-05-21 22:33:52] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2024-05-21 22:33:52] [INFO ] Computed 5 invariants in 8 ms
[2024-05-21 22:33:52] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
[2024-05-21 22:34:55] [INFO ] Deduced a trap composed of 5 places in 529 ms of which 2 ms to minimize.
SMT process timed out in 63088ms, After SMT, problems are : Problem set: 0 solved, 3724 unsolved
Search for dead transitions found 0 dead transitions in 63179ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64122 ms. Remains : 195/198 places, 3727/3728 transitions.
[2024-05-21 22:34:55] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 22:34:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[20] Max Struct:[50]
RANDOM walk for 1000000 steps (1686 resets) in 9765 ms. (102 steps per ms)
BEST_FIRST walk for 1000001 steps (636 resets) in 3429 ms. (291 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[50]
[2024-05-21 22:35:08] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 22:35:08] [INFO ] Invariant cache hit.
[2024-05-21 22:35:08] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 22:35:08] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2024-05-21 22:35:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:35:08] [INFO ] [Real]Added 42 Read/Feed constraints in 22 ms returned sat
[2024-05-21 22:35:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:35:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 22:35:08] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-21 22:35:08] [INFO ] [Nat]Added 42 Read/Feed constraints in 100 ms returned sat
[2024-05-21 22:35:09] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 226 transitions) in 307 ms.
[2024-05-21 22:35:09] [INFO ] Added : 22 causal constraints over 20 iterations in 897 ms. Result :sat
Minimization took 486 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[50]
Support contains 1 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 562 ms. Remains 195 /195 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 564 ms. Remains : 195/195 places, 3727/3727 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 592 ms. Remains 195 /195 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2024-05-21 22:35:12] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 22:35:12] [INFO ] Invariant cache hit.
[2024-05-21 22:35:13] [INFO ] Implicit Places using invariants in 678 ms returned []
[2024-05-21 22:35:13] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 22:35:13] [INFO ] Invariant cache hit.
[2024-05-21 22:35:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:35:15] [INFO ] Implicit Places using invariants and state equation in 2333 ms returned [82, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3028 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 193/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 631 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4257 ms. Remains : 193/195 places, 3727/3727 transitions.
[2024-05-21 22:35:16] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2024-05-21 22:35:16] [INFO ] Computed 5 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[20] Max Struct:[50]
RANDOM walk for 1000000 steps (1686 resets) in 10270 ms. (97 steps per ms)
BEST_FIRST walk for 1000001 steps (637 resets) in 3516 ms. (284 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[50]
[2024-05-21 22:35:30] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 22:35:30] [INFO ] Invariant cache hit.
[2024-05-21 22:35:30] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 22:35:30] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-05-21 22:35:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:35:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 22:35:30] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-21 22:35:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:35:30] [INFO ] [Nat]Added 42 Read/Feed constraints in 126 ms returned sat
[2024-05-21 22:35:30] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 226 transitions) in 135 ms.
[2024-05-21 22:35:31] [INFO ] Added : 4 causal constraints over 3 iterations in 541 ms. Result :sat
Minimization took 271 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[50]
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 722 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 723 ms. Remains : 193/193 places, 3727/3727 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 543 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2024-05-21 22:35:32] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 22:35:32] [INFO ] Invariant cache hit.
[2024-05-21 22:35:33] [INFO ] Implicit Places using invariants in 536 ms returned []
[2024-05-21 22:35:33] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 22:35:33] [INFO ] Invariant cache hit.
[2024-05-21 22:35:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:35:34] [INFO ] Implicit Places using invariants and state equation in 1560 ms returned []
Implicit Place search using SMT with State Equation took 2099 ms to find 0 implicit places.
[2024-05-21 22:35:35] [INFO ] Redundant transitions in 300 ms returned []
Running 3724 sub problems to find dead transitions.
[2024-05-21 22:35:35] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 22:35:35] [INFO ] Invariant cache hit.
[2024-05-21 22:35:35] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
[2024-05-21 22:36:45] [INFO ] Deduced a trap composed of 5 places in 740 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 193/602 variables, and 6 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 30100 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/193 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3724/3724 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/602 variables, and 6 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/193 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3724 constraints, Known Traps: 1/1 constraints]
After SMT, in 109086ms problems are : Problem set: 0 solved, 3724 unsolved
Search for dead transitions found 0 dead transitions in 109150ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112114 ms. Remains : 193/193 places, 3727/3727 transitions.
RANDOM walk for 40000 steps (64 resets) in 1780 ms. (22 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (24 resets) in 591 ms. (67 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (24 resets) in 485 ms. (82 steps per ms) remains 2/2 properties
[2024-05-21 22:37:25] [INFO ] Flatten gal took : 383 ms
[2024-05-21 22:37:25] [INFO ] Flatten gal took : 185 ms
[2024-05-21 22:37:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2049235766450630582.gal : 61 ms
[2024-05-21 22:37:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16760715944788064943.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2049235766450630582.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16760715944788064943.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16760715944788064943.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 36
Interrupted probabilistic random walk after 126311 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 2
Probabilistic random walk after 126311 steps, saw 37368 distinct states, run finished after 3004 ms. (steps per millisecond=42 ) properties seen :0
[2024-05-21 22:37:28] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 22:37:28] [INFO ] Invariant cache hit.
[2024-05-21 22:37:28] [INFO ] State equation strengthened by 42 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 70
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/290 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/294 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 145/439 variables, 26/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 21/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 22:37:29] [INFO ] Deduced a trap composed of 5 places in 654 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :70 after 136
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 162/601 variables, 81/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/601 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/601 variables, 21/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/601 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/602 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/602 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/602 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 241 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1626 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 193/193 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/290 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/294 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 145/439 variables, 26/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 21/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/439 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 162/601 variables, 81/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/601 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/601 variables, 21/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/601 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/602 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/602 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/602 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 602/602 variables, and 243 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1708 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 193/193 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 3402ms problems are : Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :136 after 292
Parikh walk visited 0 properties in 335 ms.
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 585 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Running 3724 sub problems to find dead transitions.
[2024-05-21 22:37:32] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-05-21 22:37:32] [INFO ] Invariant cache hit.
[2024-05-21 22:37:32] [INFO ] State equation strengthened by 42 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :292 after 572
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :572 after 1048

BK_STOP 1716331081421

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-PT-V80P50N20"
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-5568"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V80P50N20, 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 r048-tajo-171620399200309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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