Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.0K Apr 13 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Apr 13 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 02:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 13 02:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.9K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K 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 11K Apr 13 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 13 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 03:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Apr 13 03:18 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-V50P50N20-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716324410731

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-V50P50N20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-21 20:46:52] [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 20:46:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:46:52] [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-21 20:46:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 20:46:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 590 ms
[2024-05-21 20:46:52] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 138 PT places and 218878.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Reduction of identical properties reduced properties to check from 16 to 9
[2024-05-21 20:46:52] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 3 ms.
[2024-05-21 20:46:52] [INFO ] Skeletonized 9 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 10 rows 12 cols
[2024-05-21 20:46:52] [INFO ] Computed 4 invariants in 3 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 1, 0, 1, 0, 0, 0, 50, 1] Max Struct:[50, 1, 50, 1, 50, 50, 1, 50, 1]
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-21 20:46:52] [INFO ] Invariant cache hit.
[2024-05-21 20:46:53] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-21 20:46:53] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-21 20:46:53] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-21 20:46:53] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 9 ms.
[2024-05-21 20:46:53] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 20:46:53] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-21 20:46:53] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-21 20:46:53] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 2 ms.
[2024-05-21 20:46:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 20:46:53] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 20:46:53] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 20:46:53] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 3 ms.
[2024-05-21 20:46:53] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 20:46:53] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-21 20:46:53] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 20:46:53] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2024-05-21 20:46:53] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 20:46:53] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 20:46:53] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 20:46:53] [INFO ] Added : 0 causal constraints over 0 iterations in 4 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:[50, 50, 50, 50, 1]
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-21 20:46:53] [INFO ] Unfolded HLPN to a Petri net with 138 places and 2348 transitions 18090 arcs in 112 ms.
[2024-05-21 20:46:53] [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:[50, 50, 50, 50, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[50, 50, 50, 50, 1]
[2024-05-21 20:46:53] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-05-21 20:46:53] [INFO ] Computed 7 invariants in 35 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[50, 50, 50, 50, 1]
RANDOM walk for 10000 steps (23 resets) in 254 ms. (39 steps per ms)
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P50N20-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20001 steps (16 resets) in 89 ms. (222 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8, 20] Max Struct:[50, 50]
[2024-05-21 20:46:53] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 20:46:53] [INFO ] Invariant cache hit.
[2024-05-21 20:46:53] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 20:46:53] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-05-21 20:46:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 20:46:54] [INFO ] [Real]Added 42 Read/Feed constraints in 22 ms returned sat
[2024-05-21 20:46:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:46:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 20:46:54] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-21 20:46:54] [INFO ] [Nat]Added 42 Read/Feed constraints in 24 ms returned sat
[2024-05-21 20:46:54] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 122 ms.
[2024-05-21 20:46:54] [INFO ] Added : 21 causal constraints over 5 iterations in 403 ms. Result :sat
Minimization took 247 ms.
[2024-05-21 20:46:54] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 20:46:55] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-21 20:46:55] [INFO ] [Real]Added 42 Read/Feed constraints in 15 ms returned sat
[2024-05-21 20:46:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:46:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 20:46:55] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-21 20:46:55] [INFO ] [Nat]Added 42 Read/Feed constraints in 32 ms returned sat
[2024-05-21 20:46:55] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 225 ms.
[2024-05-21 20:46:56] [INFO ] Deduced a trap composed of 24 places in 574 ms of which 48 ms to minimize.
[2024-05-21 20:46:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 620 ms
[2024-05-21 20:46:56] [INFO ] Added : 3 causal constraints over 2 iterations in 933 ms. Result :sat
Minimization took 169 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[8, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8, 20] Max Struct:[50, 50]
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 404 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-05-21 20:46:57] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 20:46:57] [INFO ] Computed 5 invariants in 8 ms
[2024-05-21 20:46:57] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 20:47:25] [INFO ] Deduced a trap composed of 5 places in 411 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20094 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 1/1 constraints]
After SMT, in 59024ms problems are : Problem set: 0 solved, 2345 unsolved
Search for dead transitions found 0 dead transitions in 59096ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59526 ms. Remains : 136/138 places, 2348/2348 transitions.
[2024-05-21 20:47:56] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 20:47:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[8, 20] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2316 resets) in 7496 ms. (133 steps per ms)
BEST_FIRST walk for 2000002 steps (1621 resets) in 4902 ms. (407 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2024-05-21 20:48:08] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 20:48:08] [INFO ] Invariant cache hit.
[2024-05-21 20:48:08] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 20:48:09] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-21 20:48:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:48:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 20:48:09] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-05-21 20:48:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 20:48:09] [INFO ] [Nat]Added 42 Read/Feed constraints in 27 ms returned sat
[2024-05-21 20:48:09] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 54 ms.
[2024-05-21 20:48:10] [INFO ] Deduced a trap composed of 5 places in 485 ms of which 1 ms to minimize.
[2024-05-21 20:48:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 527 ms
[2024-05-21 20:48:10] [INFO ] Added : 21 causal constraints over 5 iterations in 780 ms. Result :sat
Minimization took 280 ms.
[2024-05-21 20:48:10] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 20:48:10] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-21 20:48:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:48:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 20:48:10] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-21 20:48:10] [INFO ] [Nat]Added 42 Read/Feed constraints in 33 ms returned sat
[2024-05-21 20:48:11] [INFO ] Deduced a trap composed of 5 places in 331 ms of which 2 ms to minimize.
[2024-05-21 20:48:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2024-05-21 20:48:11] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 77 ms.
[2024-05-21 20:48:11] [INFO ] Added : 23 causal constraints over 20 iterations in 514 ms. Result :sat
Minimization took 208 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 203 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 136/136 places, 2348/2348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 266 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-21 20:48:13] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 20:48:13] [INFO ] Invariant cache hit.
[2024-05-21 20:48:13] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-21 20:48:13] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 20:48:13] [INFO ] Invariant cache hit.
[2024-05-21 20:48:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 20:48:15] [INFO ] Implicit Places using invariants and state equation in 1493 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1963 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 134/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 390 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2621 ms. Remains : 134/136 places, 2348/2348 transitions.
[2024-05-21 20:48:15] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2024-05-21 20:48:15] [INFO ] Computed 5 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[20, 20] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2316 resets) in 6484 ms. (154 steps per ms)
BEST_FIRST walk for 2000001 steps (1620 resets) in 4708 ms. (424 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2024-05-21 20:48:26] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 20:48:26] [INFO ] Invariant cache hit.
[2024-05-21 20:48:26] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 20:48:27] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-21 20:48:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:48:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 20:48:27] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-21 20:48:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 20:48:27] [INFO ] [Nat]Added 42 Read/Feed constraints in 40 ms returned sat
[2024-05-21 20:48:27] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 1 ms to minimize.
[2024-05-21 20:48:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
[2024-05-21 20:48:27] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 127 ms.
[2024-05-21 20:48:27] [INFO ] Added : 20 causal constraints over 5 iterations in 363 ms. Result :sat
Minimization took 195 ms.
[2024-05-21 20:48:28] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 20:48:28] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2024-05-21 20:48:28] [INFO ] [Real]Added 42 Read/Feed constraints in 21 ms returned sat
[2024-05-21 20:48:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:48:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 20:48:28] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-21 20:48:28] [INFO ] [Nat]Added 42 Read/Feed constraints in 30 ms returned sat
[2024-05-21 20:48:28] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 14 ms to minimize.
[2024-05-21 20:48:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2024-05-21 20:48:28] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 59 ms.
[2024-05-21 20:48:29] [INFO ] Added : 22 causal constraints over 20 iterations in 428 ms. Result :sat
Minimization took 144 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Applied a total of 0 rules in 403 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 404 ms. Remains : 134/134 places, 2348/2348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Applied a total of 0 rules in 403 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-21 20:48:31] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 20:48:31] [INFO ] Invariant cache hit.
[2024-05-21 20:48:31] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-05-21 20:48:31] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 20:48:31] [INFO ] Invariant cache hit.
[2024-05-21 20:48:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 20:48:33] [INFO ] Implicit Places using invariants and state equation in 2045 ms returned []
Implicit Place search using SMT with State Equation took 2491 ms to find 0 implicit places.
[2024-05-21 20:48:33] [INFO ] Redundant transitions in 143 ms returned []
Running 2345 sub problems to find dead transitions.
[2024-05-21 20:48:33] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 20:48:33] [INFO ] Invariant cache hit.
[2024-05-21 20:48:33] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 20:49:04] [INFO ] Deduced a trap composed of 5 places in 1531 ms of which 71 ms to minimize.
[2024-05-21 20:49:21] [INFO ] Deduced a trap composed of 25 places in 1057 ms of which 40 ms to minimize.
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/424 variables, and 7 constraints, problems are : Problem set: 50 solved, 2295 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 50 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 50 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 2/7 constraints. Problems are: Problem set: 50 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/424 variables, and 7 constraints, problems are : Problem set: 50 solved, 2295 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 2/2 constraints]
After SMT, in 79658ms problems are : Problem set: 50 solved, 2295 unsolved
Search for dead transitions found 50 dead transitions in 79730ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 134/134 places, 2298/2348 transitions.
Applied a total of 0 rules in 204 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
[2024-05-21 20:49:53] [INFO ] Redundant transitions in 40 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 83103 ms. Remains : 134/134 places, 2298/2348 transitions.
[2024-05-21 20:49:53] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 134 cols
[2024-05-21 20:49:53] [INFO ] Computed 5 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[20, 20] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2316 resets) in 6608 ms. (151 steps per ms)
BEST_FIRST walk for 2000001 steps (1617 resets) in 4378 ms. (456 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2024-05-21 20:50:04] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 20:50:04] [INFO ] Invariant cache hit.
[2024-05-21 20:50:05] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2024-05-21 20:50:05] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-21 20:50:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:50:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 46 ms returned sat
[2024-05-21 20:50:05] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-21 20:50:05] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 20:50:05] [INFO ] [Nat]Added 41 Read/Feed constraints in 31 ms returned sat
[2024-05-21 20:50:06] [INFO ] Deduced a trap composed of 5 places in 464 ms of which 8 ms to minimize.
[2024-05-21 20:50:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 553 ms
[2024-05-21 20:50:06] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 101 ms.
[2024-05-21 20:50:06] [INFO ] Added : 21 causal constraints over 5 iterations in 291 ms. Result :sat
Minimization took 448 ms.
[2024-05-21 20:50:07] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 20:50:07] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-21 20:50:07] [INFO ] [Real]Added 41 Read/Feed constraints in 19 ms returned sat
[2024-05-21 20:50:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:50:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 31 ms returned sat
[2024-05-21 20:50:07] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-05-21 20:50:07] [INFO ] [Nat]Added 41 Read/Feed constraints in 58 ms returned sat
[2024-05-21 20:50:08] [INFO ] Deduced a trap composed of 5 places in 601 ms of which 12 ms to minimize.
[2024-05-21 20:50:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 725 ms
[2024-05-21 20:50:08] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 134 ms.
[2024-05-21 20:50:08] [INFO ] Added : 22 causal constraints over 20 iterations in 568 ms. Result :sat
Minimization took 419 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 191 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 134/134 places, 2298/2298 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 279 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
[2024-05-21 20:50:10] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 20:50:10] [INFO ] Invariant cache hit.
[2024-05-21 20:50:11] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-05-21 20:50:11] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 20:50:11] [INFO ] Invariant cache hit.
[2024-05-21 20:50:11] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 20:50:13] [INFO ] Implicit Places using invariants and state equation in 1846 ms returned []
Implicit Place search using SMT with State Equation took 2409 ms to find 0 implicit places.
[2024-05-21 20:50:13] [INFO ] Redundant transitions in 128 ms returned []
Running 2295 sub problems to find dead transitions.
[2024-05-21 20:50:13] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 20:50:13] [INFO ] Invariant cache hit.
[2024-05-21 20:50:13] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-05-21 20:50:41] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 30096 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 80544ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 80566ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83438 ms. Remains : 134/134 places, 2298/2298 transitions.
RANDOM walk for 40000 steps (92 resets) in 1789 ms. (22 steps per ms) remains 4/4 properties
[2024-05-21 20:51:34] [INFO ] Flatten gal took : 369 ms
BEST_FIRST walk for 40002 steps (32 resets) in 714 ms. (55 steps per ms) remains 4/4 properties
[2024-05-21 20:51:34] [INFO ] Flatten gal took : 187 ms
BEST_FIRST walk for 40004 steps (32 resets) in 370 ms. (107 steps per ms) remains 4/4 properties
[2024-05-21 20:51:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3536609348899919813.gal : 127 ms
[2024-05-21 20:51:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6579507574917794070.prop : 10 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/ReachabilityCardinality3536609348899919813.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6579507574917794070.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 ...328
BEST_FIRST walk for 40003 steps (28 resets) in 376 ms. (106 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (28 resets) in 457 ms. (87 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality6579507574917794070.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 20
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :20 after 47
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :47 after 98
Interrupted probabilistic random walk after 193129 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 4
Probabilistic random walk after 193129 steps, saw 51643 distinct states, run finished after 3004 ms. (steps per millisecond=64 ) properties seen :0
[2024-05-21 20:51:38] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 20:51:38] [INFO ] Invariant cache hit.
[2024-05-21 20:51:38] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 293/398 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 41/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/400 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 20:51:39] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 23/423 variables, 23/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/423 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 181 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1566 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 293/398 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 41/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/400 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 23/423 variables, 23/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/423 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 185 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1627 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 3231ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1151 ms.
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 164 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-05-21 20:51:42] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 20:51:42] [INFO ] Invariant cache hit.
[2024-05-21 20:51:42] [INFO ] State equation strengthened by 41 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 64

BK_STOP 1716324716434

--------------------
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-COL-V50P50N20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-V50P50N20, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620398800101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V50P50N20.tgz
mv BridgeAndVehicles-COL-V50P50N20 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;