About the Execution of 2024-gold for DoubleExponent-PT-200
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 1665653.00 | 0.00 | 0.00 | [undef] | Cannot compute |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r083-tall-174860079700065.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is DoubleExponent-PT-200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-174860079700065
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.5M May 29 14:32 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 DoubleExponent-PT-200-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748731116087
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-200
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 22:38:37] [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]
[2025-05-31 22:38:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 22:38:37] [INFO ] Load time of PNML (sax parser for PT used): 313 ms
[2025-05-31 22:38:37] [INFO ] Transformed 10604 places.
[2025-05-31 22:38:37] [INFO ] Transformed 9998 transitions.
[2025-05-31 22:38:37] [INFO ] Parsed PT model containing 10604 places and 9998 transitions and 28194 arcs in 466 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 9998 rows 10604 cols
[2025-05-31 22:38:41] [INFO ] Invariants computation overflowed in 395 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 10000 steps (325 resets) in 110 ms. (90 steps per ms)
BEST_FIRST walk for 160003 steps (4507 resets) in 679 ms. (235 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 9998 rows 10604 cols
[2025-05-31 22:38:42] [INFO ] Invariants computation overflowed in 261 ms
[2025-05-31 22:38:45] [INFO ] [Real]Absence check using state equation in 1446 ms returned sat
[2025-05-31 22:38:46] [INFO ] Computed and/alt/rep : 9997/19393/9997 causal constraints (skipped 0 transitions) in 525 ms.
[2025-05-31 22:38:47] [INFO ] Added : 0 causal constraints over 0 iterations in 1211 ms. Result :sat
Minimization took 192 ms.
[2025-05-31 22:38:50] [INFO ] [Real]Absence check using state equation in 1452 ms returned sat
[2025-05-31 22:38:51] [INFO ] Computed and/alt/rep : 9997/19393/9997 causal constraints (skipped 0 transitions) in 455 ms.
[2025-05-31 22:38:51] [INFO ] Added : 0 causal constraints over 0 iterations in 1069 ms. Result :sat
Minimization took 672 ms.
[2025-05-31 22:38:55] [INFO ] [Real]Absence check using state equation in 1639 ms returned sat
[2025-05-31 22:38:57] [INFO ] Computed and/alt/rep : 9997/19393/9997 causal constraints (skipped 0 transitions) in 1160 ms.
[2025-05-31 22:38:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:39:00] [INFO ] [Nat]Absence check using state equation in 1640 ms returned sat
[2025-05-31 22:39:01] [INFO ] Computed and/alt/rep : 9997/19393/9997 causal constraints (skipped 0 transitions) in 502 ms.
[2025-05-31 22:39:02] [INFO ] Added : 0 causal constraints over 0 iterations in 1154 ms. Result :sat
Minimization took 742 ms.
[2025-05-31 22:39:05] [INFO ] [Real]Absence check using state equation in 1417 ms returned sat
[2025-05-31 22:39:06] [INFO ] Computed and/alt/rep : 9997/19393/9997 causal constraints (skipped 0 transitions) in 475 ms.
[2025-05-31 22:39:06] [INFO ] Added : 0 causal constraints over 0 iterations in 1073 ms. Result :sat
Minimization took 717 ms.
[2025-05-31 22:39:10] [INFO ] [Real]Absence check using state equation in 1416 ms returned sat
[2025-05-31 22:39:11] [INFO ] Computed and/alt/rep : 9997/19393/9997 causal constraints (skipped 0 transitions) in 443 ms.
[2025-05-31 22:39:11] [INFO ] Added : 0 causal constraints over 0 iterations in 1044 ms. Result :sat
Minimization took 728 ms.
[2025-05-31 22:39:15] [INFO ] [Real]Absence check using state equation in 1389 ms returned sat
[2025-05-31 22:39:16] [INFO ] Computed and/alt/rep : 9997/19393/9997 causal constraints (skipped 0 transitions) in 440 ms.
[2025-05-31 22:39:16] [INFO ] Added : 0 causal constraints over 0 iterations in 1039 ms. Result :sat
Minimization took 723 ms.
[2025-05-31 22:39:20] [INFO ] [Real]Absence check using state equation in 1412 ms returned sat
[2025-05-31 22:39:21] [INFO ] Computed and/alt/rep : 9997/19393/9997 causal constraints (skipped 0 transitions) in 576 ms.
[2025-05-31 22:39:21] [INFO ] Added : 0 causal constraints over 0 iterations in 1178 ms. Result :sat
Minimization took 695 ms.
[2025-05-31 22:39:25] [INFO ] [Real]Absence check using state equation in 1422 ms returned sat
[2025-05-31 22:39:26] [INFO ] Computed and/alt/rep : 9997/19393/9997 causal constraints (skipped 0 transitions) in 542 ms.
[2025-05-31 22:39:26] [INFO ] Added : 0 causal constraints over 0 iterations in 1165 ms. Result :sat
Minimization took 688 ms.
[2025-05-31 22:39:30] [INFO ] [Real]Absence check using state equation in 1429 ms returned sat
[2025-05-31 22:39:31] [INFO ] Computed and/alt/rep : 9997/19393/9997 causal constraints (skipped 0 transitions) in 438 ms.
[2025-05-31 22:39:31] [INFO ] Added : 0 causal constraints over 0 iterations in 1039 ms. Result :sat
Minimization took 626 ms.
[2025-05-31 22:39:35] [INFO ] [Real]Absence check using state equation in 1399 ms returned sat
[2025-05-31 22:39:36] [INFO ] Computed and/alt/rep : 9997/19393/9997 causal constraints (skipped 0 transitions) in 427 ms.
[2025-05-31 22:39:36] [INFO ] Added : 0 causal constraints over 0 iterations in 1026 ms. Result :sat
Minimization took 716 ms.
[2025-05-31 22:39:40] [INFO ] [Real]Absence check using state equation in 1599 ms returned sat
[2025-05-31 22:39:41] [INFO ] Computed and/alt/rep : 9997/19393/9997 causal constraints (skipped 0 transitions) in 502 ms.
[2025-05-31 22:39:42] [INFO ] Added : 0 causal constraints over 0 iterations in 1136 ms. Result :sat
Minimization took 322 ms.
[2025-05-31 22:39:45] [INFO ] [Real]Absence check using state equation in 1613 ms returned sat
[2025-05-31 22:39:46] [INFO ] Computed and/alt/rep : 9997/19393/9997 causal constraints (skipped 0 transitions) in 517 ms.
[2025-05-31 22:39:47] [INFO ] Added : 0 causal constraints over 0 iterations in 1167 ms. Result :sat
Minimization took 293 ms.
[2025-05-31 22:39:50] [INFO ] [Real]Absence check using state equation in 1591 ms returned sat
[2025-05-31 22:39:51] [INFO ] Computed and/alt/rep : 9997/19393/9997 causal constraints (skipped 0 transitions) in 526 ms.
[2025-05-31 22:39:52] [INFO ] Added : 0 causal constraints over 0 iterations in 1151 ms. Result :sat
Minimization took 318 ms.
[2025-05-31 22:39:55] [INFO ] [Real]Absence check using state equation in 1586 ms returned sat
[2025-05-31 22:39:56] [INFO ] Computed and/alt/rep : 9997/19393/9997 causal constraints (skipped 0 transitions) in 575 ms.
[2025-05-31 22:39:57] [INFO ] Added : 0 causal constraints over 0 iterations in 1203 ms. Result :sat
Minimization took 274 ms.
[2025-05-31 22:40:00] [INFO ] [Real]Absence check using state equation in 1563 ms returned sat
[2025-05-31 22:40:01] [INFO ] Computed and/alt/rep : 9997/19393/9997 causal constraints (skipped 0 transitions) in 497 ms.
[2025-05-31 22:40:02] [INFO ] Added : 0 causal constraints over 0 iterations in 1154 ms. Result :sat
Minimization took 379 ms.
[2025-05-31 22:40:05] [INFO ] [Real]Absence check using state equation in 1492 ms returned sat
[2025-05-31 22:40:06] [INFO ] Computed and/alt/rep : 9997/19393/9997 causal constraints (skipped 0 transitions) in 425 ms.
[2025-05-31 22:40:06] [INFO ] Added : 0 causal constraints over 0 iterations in 1023 ms. Result :sat
Minimization took 618 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 16 out of 10604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 9998/9998 transitions.
Graph (complete) has 18196 edges and 10604 vertex of which 10598 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.23 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2384 transitions
Trivial Post-agglo rules discarded 2384 transitions
Performed 2384 trivial Post agglomeration. Transition count delta: 2384
Iterating post reduction 0 with 2387 rules applied. Total rules applied 2388 place count 10597 transition count 7612
Reduce places removed 2384 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 2391 rules applied. Total rules applied 4779 place count 8213 transition count 7605
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 4786 place count 8206 transition count 7605
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 4786 place count 8206 transition count 7205
Deduced a syphon composed of 400 places in 747 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 5586 place count 7806 transition count 7205
Performed 1795 Post agglomeration using F-continuation condition.Transition count delta: 1795
Deduced a syphon composed of 1795 places in 355 ms
Reduce places removed 1795 places and 0 transitions.
Iterating global reduction 3 with 3590 rules applied. Total rules applied 9176 place count 6011 transition count 5410
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 261 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9378 place count 5910 transition count 5410
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 243 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9580 place count 5809 transition count 5410
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 236 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9782 place count 5708 transition count 5410
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 93 places in 232 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 9968 place count 5615 transition count 5410
Free-agglomeration rule (complex) applied 802 times.
Iterating global reduction 3 with 802 rules applied. Total rules applied 10770 place count 5615 transition count 4608
Reduce places removed 802 places and 0 transitions.
Iterating post reduction 3 with 802 rules applied. Total rules applied 11572 place count 4813 transition count 4608
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 797 times.
Drop transitions (Partial Free agglomeration) removed 797 transitions
Iterating global reduction 4 with 797 rules applied. Total rules applied 12369 place count 4813 transition count 4608
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 12370 place count 4812 transition count 4607
Applied a total of 12370 rules in 8204 ms. Remains 4812 /10604 variables (removed 5792) and now considering 4607/9998 (removed 5391) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8224 ms. Remains : 4812/10604 places, 4607/9998 transitions.
Found an invariant !
This invariant on transitions {279=1, 397=1, 420=1, 1253=1, 1272=1, 1994=1, 2868=1, 4046=1, 4573=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {279=1, 397=1, 420=1, 1253=1, 1272=1, 1994=1, 2868=1, 4046=1, 4573=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1258 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 16) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 4607 rows 4812 cols
[2025-05-31 22:51:04] [INFO ] Invariants computation overflowed in 79 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (128289 resets) in 2434 ms. (410 steps per ms)
BEST_FIRST walk for 16000002 steps (1355453 resets) in 25207 ms. (634 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 4607 rows 4812 cols
[2025-05-31 22:51:32] [INFO ] Invariants computation overflowed in 94 ms
[2025-05-31 22:51:56] [INFO ] [Real]Absence check using state equation in 23501 ms returned sat
[2025-05-31 22:51:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:52:25] [INFO ] [Nat]Absence check using state equation in 28388 ms returned unknown
[2025-05-31 22:52:47] [INFO ] [Real]Absence check using state equation in 21318 ms returned sat
[2025-05-31 22:52:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:53:13] [INFO ] [Nat]Absence check using state equation in 25854 ms returned unknown
[2025-05-31 22:53:45] [INFO ] [Real]Absence check using state equation in 31981 ms returned sat
[2025-05-31 22:53:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:54:18] [INFO ] [Nat]Absence check using state equation in 32418 ms returned sat
[2025-05-31 22:54:18] [INFO ] State equation strengthened by 795 read => feed constraints.
[2025-05-31 22:54:23] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:54:28] [INFO ] [Nat]Added 795 Read/Feed constraints in 9051 ms returned unknown
[2025-05-31 22:54:35] [INFO ] [Real]Absence check using state equation in 7201 ms returned sat
[2025-05-31 22:54:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:54:43] [INFO ] [Nat]Absence check using state equation in 7067 ms returned sat
[2025-05-31 22:54:48] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:54:53] [INFO ] [Nat]Added 795 Read/Feed constraints in 10422 ms returned unknown
[2025-05-31 22:55:38] [INFO ] [Real]Absence check using state equation in 44622 ms returned unknown
[2025-05-31 22:55:57] [INFO ] [Real]Absence check using state equation in 18486 ms returned sat
[2025-05-31 22:56:03] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:56:08] [INFO ] [Real]Added 795 Read/Feed constraints in 10596 ms returned unknown
[2025-05-31 22:56:53] [INFO ] [Real]Absence check using state equation in 44645 ms returned unknown
[2025-05-31 22:57:38] [INFO ] [Real]Absence check using state equation in 44603 ms returned unknown
[2025-05-31 22:57:56] [INFO ] [Real]Absence check using state equation in 17344 ms returned sat
[2025-05-31 22:57:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:58:14] [INFO ] [Nat]Absence check using state equation in 17706 ms returned sat
[2025-05-31 22:58:19] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:58:23] [INFO ] [Nat]Added 795 Read/Feed constraints in 9169 ms returned unknown
[2025-05-31 22:59:08] [INFO ] [Real]Absence check using state equation in 44643 ms returned unknown
[2025-05-31 22:59:17] [INFO ] [Real]Absence check using state equation in 8595 ms returned sat
[2025-05-31 22:59:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:59:27] [INFO ] [Nat]Absence check using state equation in 8849 ms returned sat
[2025-05-31 22:59:31] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:59:36] [INFO ] [Nat]Added 795 Read/Feed constraints in 9301 ms returned unknown
[2025-05-31 22:59:40] [INFO ] [Real]Absence check using state equation in 3599 ms returned sat
[2025-05-31 22:59:45] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 22:59:49] [INFO ] [Real]Added 795 Read/Feed constraints in 9057 ms returned unknown
[2025-05-31 23:00:34] [INFO ] [Real]Absence check using state equation in 44669 ms returned unknown
[2025-05-31 23:00:43] [INFO ] [Real]Absence check using state equation in 8950 ms returned sat
[2025-05-31 23:00:48] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:00:53] [INFO ] [Real]Added 795 Read/Feed constraints in 9127 ms returned unknown
[2025-05-31 23:01:38] [INFO ] [Real]Absence check using state equation in 44626 ms returned unknown
[2025-05-31 23:01:42] [INFO ] [Real]Absence check using state equation in 3363 ms returned sat
[2025-05-31 23:01:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:01:46] [INFO ] [Nat]Absence check using state equation in 3471 ms returned sat
[2025-05-31 23:01:50] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-31 23:01:55] [INFO ] [Nat]Added 795 Read/Feed constraints in 9102 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 16 out of 4812 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4812/4812 places, 4607/4607 transitions.
Applied a total of 0 rules in 513 ms. Remains 4812 /4812 variables (removed 0) and now considering 4607/4607 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 513 ms. Remains : 4812/4812 places, 4607/4607 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4812/4812 places, 4607/4607 transitions.
Applied a total of 0 rules in 515 ms. Remains 4812 /4812 variables (removed 0) and now considering 4607/4607 (removed 0) transitions.
// Phase 1: matrix 4607 rows 4812 cols
[2025-05-31 23:02:26] [INFO ] Invariants computation overflowed in 93 ms
[2025-05-31 23:02:57] [INFO ] Performed 3939/4812 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-31 23:03:03] [INFO ] Implicit Places using invariants in 36480 ms returned []
// Phase 1: matrix 4607 rows 4812 cols
[2025-05-31 23:03:03] [INFO ] Invariants computation overflowed in 79 ms
[2025-05-31 23:03:06] [INFO ] State equation strengthened by 795 read => feed constraints.
[2025-05-31 23:05:43] [INFO ] Performed 2/4812 implicitness test of which 0 returned IMPLICIT in 156 seconds.
[2025-05-31 23:05:43] [INFO ] Timeout of Implicit test with SMT after 156 seconds.
[2025-05-31 23:05:43] [INFO ] Implicit Places using invariants and state equation in 160178 ms returned []
Implicit Place search using SMT with State Equation took 196666 ms to find 0 implicit places.
[2025-05-31 23:05:43] [INFO ] Redundant transitions in 386 ms returned []
Running 4606 sub problems to find dead transitions.
// Phase 1: matrix 4607 rows 4812 cols
[2025-05-31 23:05:44] [INFO ] Invariants computation overflowed in 75 ms
[2025-05-31 23:05:44] [INFO ] State equation strengthened by 795 read => feed constraints.
BK_STOP 1748732781740
--------------------
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="DoubleExponent-PT-200"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is DoubleExponent-PT-200, 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 r083-tall-174860079700065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-200.tgz
mv DoubleExponent-PT-200 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 '
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 ;