About the Execution of ITS-Tools for Philosophers-COL-000200
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r140-tall-162298995800035.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r140-tall-162298995800035
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 8.3K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Mar 27 07:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 27 07:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 08:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 08:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 18K May 5 16:51 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 1622990185115
Running Version 0
[2021-06-06 14:36:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-06-06 14:36:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 14:36:27] [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.
[2021-06-06 14:36:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-06-06 14:36:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 790 ms
[2021-06-06 14:36:28] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 1000 PT places and 1000.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2021-06-06 14:36:28] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions in 4 ms.
[2021-06-06 14:36:28] [INFO ] Skeletonized HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1000_11817016100754279647.dot
// Phase 1: matrix 5 rows 5 cols
[2021-06-06 14:36:28] [INFO ] Computed 2 place invariants in 6 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-10 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-08 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-00 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-06-06 14:36:28] [INFO ] Unfolded HLPN to a Petri net with 1000 places and 1000 transitions in 29 ms.
[2021-06-06 14:36:28] [INFO ] Unfolded HLPN properties in 1 ms.
// Phase 1: matrix 5 rows 5 cols
[2021-06-06 14:36:28] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-06 14:36:29] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2021-06-06 14:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:29] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-06-06 14:36:29] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-06-06 14:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:29] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-06-06 14:36:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2021-06-06 14:36:29] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Minimization took 7 ms.
[2021-06-06 14:36:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-06-06 14:36:29] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-06-06 14:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:29] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2021-06-06 14:36:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 3 ms.
[2021-06-06 14:36:29] [INFO ] Added : 1 causal constraints over 1 iterations in 49 ms. Result :sat
Minimization took 12 ms.
[2021-06-06 14:36:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-06-06 14:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-06-06 14:36:29] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:29] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-06-06 14:36:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 17 ms.
[2021-06-06 14:36:29] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Minimization took 3 ms.
[2021-06-06 14:36:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:29] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-06-06 14:36:29] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:29] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-06-06 14:36:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-06-06 14:36:29] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Minimization took 12 ms.
[2021-06-06 14:36:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:29] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-06-06 14:36:29] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:29] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-06-06 14:36:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-06-06 14:36:29] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2021-06-06 14:36:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:29] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-06-06 14:36:29] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:29] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-06-06 14:36:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 4 ms.
[2021-06-06 14:36:29] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2021-06-06 14:36:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:29] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-06-06 14:36:29] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-06-06 14:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:29] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-06-06 14:36:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 3 ms.
[2021-06-06 14:36:29] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 3 ms.
[2021-06-06 14:36:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:29] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-06-06 14:36:29] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-06-06 14:36:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-06-06 14:36:29] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2021-06-06 14:36:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:29] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-06-06 14:36:29] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-06-06 14:36:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-06-06 14:36:29] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [200, 100, 200, 200, 200, 200, 200, 200, 200]
[2021-06-06 14:36:29] [INFO ] Unfolded HLPN to a Petri net with 1000 places and 1000 transitions in 23 ms.
[2021-06-06 14:36:29] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_1126629554976901512.dot
Incomplete random walk after 10000 steps, including 2 resets, run finished after 950 ms. (steps per millisecond=10 ) properties (out of 9) seen :909
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 9) seen :54
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 9) seen :54
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 9) seen :54
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 9) seen :54
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 9) seen :54
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 9) seen :54
// Phase 1: matrix 1000 rows 1000 cols
[2021-06-06 14:36:32] [INFO ] Computed 400 place invariants in 34 ms
[2021-06-06 14:36:32] [INFO ] [Real]Absence check using 400 positive place invariants in 200 ms returned sat
[2021-06-06 14:36:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:33] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2021-06-06 14:36:33] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:33] [INFO ] [Nat]Absence check using 400 positive place invariants in 122 ms returned sat
[2021-06-06 14:36:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:34] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2021-06-06 14:36:34] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 111 ms.
[2021-06-06 14:36:34] [INFO ] Added : 19 causal constraints over 4 iterations in 533 ms. Result :sat
Minimization took 196 ms.
[2021-06-06 14:36:35] [INFO ] [Real]Absence check using 400 positive place invariants in 127 ms returned sat
[2021-06-06 14:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:35] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2021-06-06 14:36:35] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:36] [INFO ] [Nat]Absence check using 400 positive place invariants in 113 ms returned sat
[2021-06-06 14:36:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:36] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2021-06-06 14:36:36] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 65 ms.
[2021-06-06 14:36:37] [INFO ] Added : 42 causal constraints over 9 iterations in 860 ms. Result :sat
Minimization took 229 ms.
[2021-06-06 14:36:37] [INFO ] [Real]Absence check using 400 positive place invariants in 121 ms returned sat
[2021-06-06 14:36:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:38] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2021-06-06 14:36:38] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:38] [INFO ] [Nat]Absence check using 400 positive place invariants in 116 ms returned sat
[2021-06-06 14:36:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:39] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2021-06-06 14:36:39] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 66 ms.
[2021-06-06 14:36:39] [INFO ] Added : 14 causal constraints over 3 iterations in 417 ms. Result :sat
Minimization took 188 ms.
[2021-06-06 14:36:40] [INFO ] [Real]Absence check using 400 positive place invariants in 121 ms returned sat
[2021-06-06 14:36:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:40] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2021-06-06 14:36:40] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:40] [INFO ] [Nat]Absence check using 400 positive place invariants in 117 ms returned sat
[2021-06-06 14:36:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:41] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2021-06-06 14:36:41] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 70 ms.
[2021-06-06 14:36:41] [INFO ] Added : 19 causal constraints over 4 iterations in 450 ms. Result :sat
Minimization took 168 ms.
[2021-06-06 14:36:42] [INFO ] [Real]Absence check using 400 positive place invariants in 124 ms returned sat
[2021-06-06 14:36:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:42] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2021-06-06 14:36:42] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:43] [INFO ] [Nat]Absence check using 400 positive place invariants in 113 ms returned sat
[2021-06-06 14:36:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:43] [INFO ] [Nat]Absence check using state equation in 437 ms returned sat
[2021-06-06 14:36:43] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 57 ms.
[2021-06-06 14:36:44] [INFO ] Added : 19 causal constraints over 4 iterations in 439 ms. Result :sat
Minimization took 137 ms.
[2021-06-06 14:36:44] [INFO ] [Real]Absence check using 400 positive place invariants in 125 ms returned sat
[2021-06-06 14:36:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:44] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2021-06-06 14:36:44] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:45] [INFO ] [Nat]Absence check using 400 positive place invariants in 125 ms returned sat
[2021-06-06 14:36:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:45] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2021-06-06 14:36:45] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 61 ms.
[2021-06-06 14:36:46] [INFO ] Added : 19 causal constraints over 4 iterations in 466 ms. Result :sat
Minimization took 175 ms.
[2021-06-06 14:36:46] [INFO ] [Real]Absence check using 400 positive place invariants in 114 ms returned sat
[2021-06-06 14:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:47] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2021-06-06 14:36:47] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:47] [INFO ] [Nat]Absence check using 400 positive place invariants in 114 ms returned sat
[2021-06-06 14:36:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:47] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2021-06-06 14:36:47] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 61 ms.
[2021-06-06 14:36:48] [INFO ] Added : 19 causal constraints over 4 iterations in 467 ms. Result :sat
Minimization took 198 ms.
[2021-06-06 14:36:48] [INFO ] [Real]Absence check using 400 positive place invariants in 98 ms returned sat
[2021-06-06 14:36:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:49] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2021-06-06 14:36:49] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:49] [INFO ] [Nat]Absence check using 400 positive place invariants in 128 ms returned sat
[2021-06-06 14:36:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:50] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2021-06-06 14:36:50] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 66 ms.
[2021-06-06 14:36:50] [INFO ] Added : 14 causal constraints over 3 iterations in 403 ms. Result :sat
Minimization took 200 ms.
[2021-06-06 14:36:51] [INFO ] [Real]Absence check using 400 positive place invariants in 125 ms returned sat
[2021-06-06 14:36:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:51] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2021-06-06 14:36:51] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:51] [INFO ] [Nat]Absence check using 400 positive place invariants in 111 ms returned sat
[2021-06-06 14:36:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:52] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2021-06-06 14:36:52] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 62 ms.
[2021-06-06 14:36:52] [INFO ] Added : 19 causal constraints over 4 iterations in 475 ms. Result :sat
Minimization took 197 ms.
Current structural bounds on expressions (after SMT) : [200, 100, 200, 200, 200, 200, 200, 200, 200] Max seen :[111, 41, 101, 111, 111, 111, 111, 101, 111]
Incomplete Parikh walk after 25700 steps, including 111 resets, run finished after 2157 ms. (steps per millisecond=11 ) properties (out of 9) seen :1236 could not realise parikh vector
FORMULA Philosophers-COL-000200-UpperBounds-15 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000200-UpperBounds-11 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000200-UpperBounds-07 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000200-UpperBounds-06 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000200-UpperBounds-05 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000200-UpperBounds-01 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 24200 steps, including 109 resets, run finished after 1396 ms. (steps per millisecond=17 ) properties (out of 3) seen :407 could not realise parikh vector
FORMULA Philosophers-COL-000200-UpperBounds-12 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000200-UpperBounds-04 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 25700 steps, including 112 resets, run finished after 988 ms. (steps per millisecond=26 ) properties (out of 1) seen :19 could not realise parikh vector
Incomplete Parikh walk after 25700 steps, including 112 resets, run finished after 945 ms. (steps per millisecond=27 ) properties (out of 1) seen :21 could not realise parikh vector
Incomplete Parikh walk after 25700 steps, including 112 resets, run finished after 895 ms. (steps per millisecond=28 ) properties (out of 1) seen :19 could not realise parikh vector
Incomplete Parikh walk after 25700 steps, including 112 resets, run finished after 915 ms. (steps per millisecond=28 ) properties (out of 1) seen :22 could not realise parikh vector
Incomplete Parikh walk after 24200 steps, including 109 resets, run finished after 890 ms. (steps per millisecond=27 ) properties (out of 1) seen :6 could not realise parikh vector
Incomplete Parikh walk after 26300 steps, including 116 resets, run finished after 810 ms. (steps per millisecond=32 ) properties (out of 1) seen :97 could not realise parikh vector
Incomplete Parikh walk after 25700 steps, including 112 resets, run finished after 902 ms. (steps per millisecond=28 ) properties (out of 1) seen :18 could not realise parikh vector
Support contains 200 out of 1000 places. Attempting structural reductions.
Starting structural reductions, 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 421 ms. Remains 600 /1000 variables (removed 400) and now considering 400/1000 (removed 600) transitions.
Finished structural reductions, in 1 iterations. Remains : 600/1000 places, 400/1000 transitions.
// Phase 1: matrix 400 rows 600 cols
[2021-06-06 14:37:03] [INFO ] Computed 400 place invariants in 4 ms
Interrupted random walk after 928002 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen :{0=73}
Interrupted Best-First random walk after 419260 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen :{0=98}
// Phase 1: matrix 400 rows 600 cols
[2021-06-06 14:37:38] [INFO ] Computed 400 place invariants in 4 ms
[2021-06-06 14:37:38] [INFO ] [Real]Absence check using 400 positive place invariants in 114 ms returned sat
[2021-06-06 14:37:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:37:38] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2021-06-06 14:37:38] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:37:39] [INFO ] [Nat]Absence check using 400 positive place invariants in 94 ms returned sat
[2021-06-06 14:37:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:37:39] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2021-06-06 14:37:39] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 24 ms.
[2021-06-06 14:37:39] [INFO ] Added : 0 causal constraints over 0 iterations in 86 ms. Result :sat
Minimization took 104 ms.
Current structural bounds on expressions (after SMT) : [100] Max seen :[98]
Incomplete Parikh walk after 10000 steps, including 97 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 1) seen :100 could not realise parikh vector
FORMULA Philosophers-COL-000200-UpperBounds-03 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
BK_STOP 1622990260754
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="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-4028"
echo " Executing tool itstools"
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 r140-tall-162298995800035"
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 '
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 ;