fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r285-smll-171654422300261
Last Updated
July 7, 2024

About the Execution of 2023-gold for Philosophers-COL-000200

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
345.487 86130.00 101060.00 748.10 200 200 200 200 200 200 200 200 200 200 100 200 200 200 200 100 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r285-smll-171654422300261.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is Philosophers-COL-000200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422300261
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 6.1K Apr 13 10:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 13 10:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 13 10:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 13 10:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 13 10:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 13 10:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 13 10:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 13 10:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 18K May 18 16:43 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 Philosophers-COL-000200-UpperBounds-00
FORMULA_NAME Philosophers-COL-000200-UpperBounds-01
FORMULA_NAME Philosophers-COL-000200-UpperBounds-02
FORMULA_NAME Philosophers-COL-000200-UpperBounds-03
FORMULA_NAME Philosophers-COL-000200-UpperBounds-04
FORMULA_NAME Philosophers-COL-000200-UpperBounds-05
FORMULA_NAME Philosophers-COL-000200-UpperBounds-06
FORMULA_NAME Philosophers-COL-000200-UpperBounds-07
FORMULA_NAME Philosophers-COL-000200-UpperBounds-08
FORMULA_NAME Philosophers-COL-000200-UpperBounds-09
FORMULA_NAME Philosophers-COL-000200-UpperBounds-10
FORMULA_NAME Philosophers-COL-000200-UpperBounds-11
FORMULA_NAME Philosophers-COL-000200-UpperBounds-12
FORMULA_NAME Philosophers-COL-000200-UpperBounds-13
FORMULA_NAME Philosophers-COL-000200-UpperBounds-14
FORMULA_NAME Philosophers-COL-000200-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716943690780

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000200
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-29 00:48:14] [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-29 00:48:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 00:48:14] [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-29 00:48:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-29 00:48:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 651 ms
[2024-05-29 00:48:14] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 1000 PT places and 1000.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
[2024-05-29 00:48:14] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 5 ms.
[2024-05-29 00:48:14] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2024-05-29 00:48:14] [INFO ] Computed 2 invariants in 4 ms
FORMULA Philosophers-COL-000200-UpperBounds-14 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000200-UpperBounds-13 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000200-UpperBounds-09 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000200-UpperBounds-07 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000200-UpperBounds-06 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000200-UpperBounds-05 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000200-UpperBounds-02 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000200-UpperBounds-01 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-29 00:48:14] [INFO ] Invariant cache hit.
[2024-05-29 00:48:15] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-29 00:48:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-29 00:48:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:48:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:48:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:15] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-29 00:48:15] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 00:48:15] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Minimization took 11 ms.
[2024-05-29 00:48:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:48:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:15] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-29 00:48:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:48:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:48:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:15] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-29 00:48:15] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-29 00:48:15] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2024-05-29 00:48:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:48:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-29 00:48:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:48:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:48:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:15] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-29 00:48:15] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-29 00:48:15] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-29 00:48:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:48:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-29 00:48:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:48:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:48:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:15] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-29 00:48:15] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-29 00:48:15] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2024-05-29 00:48:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:48:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:15] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-29 00:48:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:48:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:48:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:15] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-29 00:48:15] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 00:48:15] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 7 ms.
[2024-05-29 00:48:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:48:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:15] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-29 00:48:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:48:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-29 00:48:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:15] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-29 00:48:15] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-29 00:48:15] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2024-05-29 00:48:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:48:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-29 00:48:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:48:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 00:48:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:15] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-29 00:48:15] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-29 00:48:15] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2024-05-29 00:48:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 00:48:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:15] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-29 00:48:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:48:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 00:48:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:15] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-29 00:48:15] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-29 00:48:15] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [200, 200, 200, 200, 100, 200, 200, 100]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 200) 200) 200)]] contains successor/predecessor on variables of sort Philo
[2024-05-29 00:48:16] [INFO ] Unfolded HLPN to a Petri net with 1000 places and 1000 transitions 3200 arcs in 95 ms.
[2024-05-29 00:48:16] [INFO ] Unfolded 8 HLPN properties in 1 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1023 ms. (steps per millisecond=9 ) properties (out of 8) seen :758
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 8) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 8) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 8) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 8) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 8) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 8) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 8) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 8) seen :14
// Phase 1: matrix 1000 rows 1000 cols
[2024-05-29 00:48:18] [INFO ] Computed 400 invariants in 27 ms
[2024-05-29 00:48:19] [INFO ] [Real]Absence check using 400 positive place invariants in 282 ms returned sat
[2024-05-29 00:48:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:19] [INFO ] [Real]Absence check using state equation in 827 ms returned sat
[2024-05-29 00:48:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:48:20] [INFO ] [Nat]Absence check using 400 positive place invariants in 174 ms returned sat
[2024-05-29 00:48:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:20] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2024-05-29 00:48:21] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 91 ms.
[2024-05-29 00:48:21] [INFO ] Added : 19 causal constraints over 4 iterations in 502 ms. Result :sat
Minimization took 219 ms.
[2024-05-29 00:48:22] [INFO ] [Real]Absence check using 400 positive place invariants in 198 ms returned sat
[2024-05-29 00:48:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:22] [INFO ] [Real]Absence check using state equation in 688 ms returned sat
[2024-05-29 00:48:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:48:23] [INFO ] [Nat]Absence check using 400 positive place invariants in 134 ms returned sat
[2024-05-29 00:48:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:23] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2024-05-29 00:48:24] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 80 ms.
[2024-05-29 00:48:24] [INFO ] Added : 19 causal constraints over 4 iterations in 400 ms. Result :sat
Minimization took 250 ms.
[2024-05-29 00:48:25] [INFO ] [Real]Absence check using 400 positive place invariants in 188 ms returned sat
[2024-05-29 00:48:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:25] [INFO ] [Real]Absence check using state equation in 644 ms returned sat
[2024-05-29 00:48:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:48:26] [INFO ] [Nat]Absence check using 400 positive place invariants in 175 ms returned sat
[2024-05-29 00:48:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:26] [INFO ] [Nat]Absence check using state equation in 590 ms returned sat
[2024-05-29 00:48:26] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 83 ms.
[2024-05-29 00:48:27] [INFO ] Added : 16 causal constraints over 4 iterations in 448 ms. Result :sat
Minimization took 230 ms.
[2024-05-29 00:48:27] [INFO ] [Real]Absence check using 400 positive place invariants in 134 ms returned sat
[2024-05-29 00:48:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:28] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2024-05-29 00:48:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:48:28] [INFO ] [Nat]Absence check using 400 positive place invariants in 148 ms returned sat
[2024-05-29 00:48:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:29] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2024-05-29 00:48:29] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 86 ms.
[2024-05-29 00:48:29] [INFO ] Added : 19 causal constraints over 4 iterations in 471 ms. Result :sat
Minimization took 156 ms.
[2024-05-29 00:48:30] [INFO ] [Real]Absence check using 400 positive place invariants in 125 ms returned sat
[2024-05-29 00:48:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:30] [INFO ] [Real]Absence check using state equation in 546 ms returned sat
[2024-05-29 00:48:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:48:31] [INFO ] [Nat]Absence check using 400 positive place invariants in 138 ms returned sat
[2024-05-29 00:48:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:31] [INFO ] [Nat]Absence check using state equation in 597 ms returned sat
[2024-05-29 00:48:31] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 63 ms.
[2024-05-29 00:48:32] [INFO ] Added : 41 causal constraints over 9 iterations in 870 ms. Result :sat
Minimization took 374 ms.
[2024-05-29 00:48:33] [INFO ] [Real]Absence check using 400 positive place invariants in 134 ms returned sat
[2024-05-29 00:48:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:34] [INFO ] [Real]Absence check using state equation in 715 ms returned sat
[2024-05-29 00:48:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:48:34] [INFO ] [Nat]Absence check using 400 positive place invariants in 151 ms returned sat
[2024-05-29 00:48:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:35] [INFO ] [Nat]Absence check using state equation in 630 ms returned sat
[2024-05-29 00:48:35] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 104 ms.
[2024-05-29 00:48:35] [INFO ] Added : 16 causal constraints over 4 iterations in 605 ms. Result :sat
Minimization took 276 ms.
[2024-05-29 00:48:36] [INFO ] [Real]Absence check using 400 positive place invariants in 144 ms returned sat
[2024-05-29 00:48:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:37] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2024-05-29 00:48:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:48:37] [INFO ] [Nat]Absence check using 400 positive place invariants in 147 ms returned sat
[2024-05-29 00:48:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:38] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2024-05-29 00:48:38] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 87 ms.
[2024-05-29 00:48:38] [INFO ] Added : 19 causal constraints over 4 iterations in 478 ms. Result :sat
Minimization took 164 ms.
[2024-05-29 00:48:39] [INFO ] [Real]Absence check using 400 positive place invariants in 176 ms returned sat
[2024-05-29 00:48:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:39] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
[2024-05-29 00:48:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:48:40] [INFO ] [Nat]Absence check using 400 positive place invariants in 174 ms returned sat
[2024-05-29 00:48:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:48:40] [INFO ] [Nat]Absence check using state equation in 624 ms returned sat
[2024-05-29 00:48:41] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 64 ms.
[2024-05-29 00:48:41] [INFO ] Added : 41 causal constraints over 9 iterations in 696 ms. Result :sat
Minimization took 364 ms.
Current structural bounds on expressions (after SMT) : [200, 200, 200, 200, 100, 200, 200, 100] Max seen :[120, 120, 99, 120, 40, 99, 120, 40]
FORMULA Philosophers-COL-000200-UpperBounds-12 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000200-UpperBounds-08 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000200-UpperBounds-03 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000200-UpperBounds-00 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000200-UpperBounds-11 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000200-UpperBounds-04 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 200 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Free-agglomeration rule (complex) applied 400 times.
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 1000 transition count 600
Reduce places removed 400 places and 0 transitions.
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 0 with 600 rules applied. Total rules applied 1000 place count 600 transition count 400
Applied a total of 1000 rules in 489 ms. Remains 600 /1000 variables (removed 400) and now considering 400/1000 (removed 600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 490 ms. Remains : 600/1000 places, 400/1000 transitions.
// Phase 1: matrix 400 rows 600 cols
[2024-05-29 00:48:52] [INFO ] Computed 400 invariants in 5 ms
Finished random walk after 820636 steps, including 2 resets, run visited all 2 properties in 30001 ms. (steps per millisecond=27 )
Finished Best-First random walk after 329356 steps, including 0 resets, run visited all 2 properties in 5002 ms. (steps per millisecond=65 )
Finished Best-First random walk after 323363 steps, including 0 resets, run visited all 2 properties in 5002 ms. (steps per millisecond=64 )
[2024-05-29 00:49:32] [INFO ] Invariant cache hit.
[2024-05-29 00:49:32] [INFO ] [Real]Absence check using 400 positive place invariants in 118 ms returned sat
[2024-05-29 00:49:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:49:33] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2024-05-29 00:49:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:49:33] [INFO ] [Nat]Absence check using 400 positive place invariants in 129 ms returned sat
[2024-05-29 00:49:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:49:33] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2024-05-29 00:49:33] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 34 ms.
[2024-05-29 00:49:33] [INFO ] Added : 0 causal constraints over 0 iterations in 100 ms. Result :sat
Minimization took 89 ms.
[2024-05-29 00:49:34] [INFO ] [Real]Absence check using 400 positive place invariants in 140 ms returned sat
[2024-05-29 00:49:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:49:34] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2024-05-29 00:49:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:49:34] [INFO ] [Nat]Absence check using 400 positive place invariants in 142 ms returned sat
[2024-05-29 00:49:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:49:34] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2024-05-29 00:49:35] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 35 ms.
[2024-05-29 00:49:35] [INFO ] Added : 0 causal constraints over 0 iterations in 119 ms. Result :sat
Minimization took 135 ms.
Current structural bounds on expressions (after SMT) : [100, 100] Max seen :[97, 97]
FORMULA Philosophers-COL-000200-UpperBounds-15 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000200-UpperBounds-10 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 81805 ms.

BK_STOP 1716943776910

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-COL-000200"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Philosophers-COL-000200, 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 r285-smll-171654422300261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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