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/mcc2022-input.r168-tall-165277016400221.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 r168-tall-165277016400221
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 5.2K Apr 29 11:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 29 11:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 11:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 29 11:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 18K May 10 09:34 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 1652804786719
Running Version 202205111006
[2022-05-17 16:26: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]
[2022-05-17 16:26:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 16:26: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.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-17 16:26:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 16:26:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 550 ms
[2022-05-17 16:26:28] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 1000 PT places and 1000.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2022-05-17 16:26:28] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 4 ms.
[2022-05-17 16:26:28] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2022-05-17 16:26:28] [INFO ] Computed 2 place invariants in 5 ms
FORMULA Philosophers-COL-000200-UpperBounds-15 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-12 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-01 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 5 rows 5 cols
[2022-05-17 16:26:28] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-17 16:26:28] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-17 16:26:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:28] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-17 16:26:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:26:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:26:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:28] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-17 16:26:28] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 16:26:28] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 16:26:28] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 16:26:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:28] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 16:26:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:26:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:26:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:28] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 16:26:28] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 16:26:28] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 16:26:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:26:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:28] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 16:26:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:26:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:26:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:28] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 16:26:28] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 16:26:28] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 16:26:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:26:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:28] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 16:26:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:26:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:26:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:28] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 16:26:28] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 16:26:28] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2022-05-17 16:26:29] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 16:26:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:29] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 16:26:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:26:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 16:26:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:29] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 16:26:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 16:26:29] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2022-05-17 16:26:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:26:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:29] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 16:26:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:26:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:26:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:29] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 16:26:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 16:26:29] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 16:26:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:26:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:29] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 16:26:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:26:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-17 16:26:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 16:26:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 16:26:29] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 16:26:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:26:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:29] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 16:26:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:26:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:26:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:29] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-17 16:26:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 16:26:29] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
[2022-05-17 16:26:29] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 16:26:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:29] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 16:26:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:26:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:26:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:29] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-17 16:26:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 16:26:29] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2022-05-17 16:26:29] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 16:26:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:29] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 16:26:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:26:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 16:26:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:29] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 16:26:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 16:26:29] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 16:26:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:26:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:29] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 16:26:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:26:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 16:26:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:29] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 16:26:29] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 16:26:29] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [200, 100, 100, 100, 200, 200, 200, 200, 200, 200, 200]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 200) 200) 200)]] contains successor/predecessor on variables of sort Philo
[2022-05-17 16:26:29] [INFO ] Unfolded HLPN to a Petri net with 1000 places and 1000 transitions 3200 arcs in 38 ms.
[2022-05-17 16:26:29] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 704 ms. (steps per millisecond=14 ) properties (out of 11) seen :997
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 11) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 11) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 11) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 11) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 11) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 11) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 11) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 11) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 11) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 11) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :36
// Phase 1: matrix 1000 rows 1000 cols
[2022-05-17 16:26:31] [INFO ] Computed 400 place invariants in 46 ms
[2022-05-17 16:26:31] [INFO ] [Real]Absence check using 400 positive place invariants in 125 ms returned sat
[2022-05-17 16:26:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:32] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2022-05-17 16:26:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:26:32] [INFO ] [Nat]Absence check using 400 positive place invariants in 72 ms returned sat
[2022-05-17 16:26:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:32] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2022-05-17 16:26:32] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 53 ms.
[2022-05-17 16:26:33] [INFO ] Added : 12 causal constraints over 3 iterations in 323 ms. Result :sat
Minimization took 107 ms.
[2022-05-17 16:26:33] [INFO ] [Real]Absence check using 400 positive place invariants in 63 ms returned sat
[2022-05-17 16:26:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:33] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2022-05-17 16:26:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:26:33] [INFO ] [Nat]Absence check using 400 positive place invariants in 70 ms returned sat
[2022-05-17 16:26:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:34] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2022-05-17 16:26:34] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 45 ms.
[2022-05-17 16:26:34] [INFO ] Added : 36 causal constraints over 8 iterations in 562 ms. Result :sat
Minimization took 147 ms.
[2022-05-17 16:26:35] [INFO ] [Real]Absence check using 400 positive place invariants in 60 ms returned sat
[2022-05-17 16:26:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:35] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2022-05-17 16:26:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:26:35] [INFO ] [Nat]Absence check using 400 positive place invariants in 64 ms returned sat
[2022-05-17 16:26:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:35] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2022-05-17 16:26:36] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 43 ms.
[2022-05-17 16:26:36] [INFO ] Added : 36 causal constraints over 8 iterations in 504 ms. Result :sat
Minimization took 142 ms.
[2022-05-17 16:26:36] [INFO ] [Real]Absence check using 400 positive place invariants in 64 ms returned sat
[2022-05-17 16:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:37] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2022-05-17 16:26:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:26:37] [INFO ] [Nat]Absence check using 400 positive place invariants in 64 ms returned sat
[2022-05-17 16:26:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:37] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2022-05-17 16:26:37] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 57 ms.
[2022-05-17 16:26:38] [INFO ] Added : 36 causal constraints over 8 iterations in 522 ms. Result :sat
Minimization took 146 ms.
[2022-05-17 16:26:38] [INFO ] [Real]Absence check using 400 positive place invariants in 75 ms returned sat
[2022-05-17 16:26:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:38] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2022-05-17 16:26:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:26:39] [INFO ] [Nat]Absence check using 400 positive place invariants in 76 ms returned sat
[2022-05-17 16:26:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:39] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2022-05-17 16:26:39] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 45 ms.
[2022-05-17 16:26:39] [INFO ] Added : 18 causal constraints over 4 iterations in 309 ms. Result :sat
Minimization took 106 ms.
[2022-05-17 16:26:39] [INFO ] [Real]Absence check using 400 positive place invariants in 73 ms returned sat
[2022-05-17 16:26:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:40] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2022-05-17 16:26:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:26:40] [INFO ] [Nat]Absence check using 400 positive place invariants in 74 ms returned sat
[2022-05-17 16:26:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:40] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2022-05-17 16:26:40] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 42 ms.
[2022-05-17 16:26:41] [INFO ] Added : 12 causal constraints over 3 iterations in 271 ms. Result :sat
Minimization took 107 ms.
[2022-05-17 16:26:41] [INFO ] [Real]Absence check using 400 positive place invariants in 72 ms returned sat
[2022-05-17 16:26:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:41] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2022-05-17 16:26:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:26:41] [INFO ] [Nat]Absence check using 400 positive place invariants in 78 ms returned sat
[2022-05-17 16:26:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:42] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2022-05-17 16:26:42] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 40 ms.
[2022-05-17 16:26:42] [INFO ] Added : 12 causal constraints over 3 iterations in 262 ms. Result :sat
Minimization took 111 ms.
[2022-05-17 16:26:42] [INFO ] [Real]Absence check using 400 positive place invariants in 76 ms returned sat
[2022-05-17 16:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:43] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2022-05-17 16:26:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:26:43] [INFO ] [Nat]Absence check using 400 positive place invariants in 76 ms returned sat
[2022-05-17 16:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:43] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2022-05-17 16:26:43] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 42 ms.
[2022-05-17 16:26:43] [INFO ] Added : 12 causal constraints over 3 iterations in 263 ms. Result :sat
Minimization took 111 ms.
[2022-05-17 16:26:44] [INFO ] [Real]Absence check using 400 positive place invariants in 77 ms returned sat
[2022-05-17 16:26:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:44] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2022-05-17 16:26:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:26:44] [INFO ] [Nat]Absence check using 400 positive place invariants in 78 ms returned sat
[2022-05-17 16:26:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:45] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2022-05-17 16:26:45] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 43 ms.
[2022-05-17 16:26:45] [INFO ] Added : 18 causal constraints over 4 iterations in 322 ms. Result :sat
Minimization took 101 ms.
[2022-05-17 16:26:45] [INFO ] [Real]Absence check using 400 positive place invariants in 76 ms returned sat
[2022-05-17 16:26:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:45] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2022-05-17 16:26:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:26:46] [INFO ] [Nat]Absence check using 400 positive place invariants in 77 ms returned sat
[2022-05-17 16:26:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:46] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2022-05-17 16:26:46] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 49 ms.
[2022-05-17 16:26:46] [INFO ] Added : 18 causal constraints over 4 iterations in 316 ms. Result :sat
Minimization took 105 ms.
[2022-05-17 16:26:47] [INFO ] [Real]Absence check using 400 positive place invariants in 75 ms returned sat
[2022-05-17 16:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:47] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2022-05-17 16:26:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:26:47] [INFO ] [Nat]Absence check using 400 positive place invariants in 77 ms returned sat
[2022-05-17 16:26:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:26:47] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2022-05-17 16:26:48] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 44 ms.
[2022-05-17 16:26:48] [INFO ] Added : 18 causal constraints over 4 iterations in 327 ms. Result :sat
Minimization took 107 ms.
Current structural bounds on expressions (after SMT) : [200, 100, 100, 100, 200, 200, 200, 200, 200, 200, 200] Max seen :[107, 35, 35, 35, 116, 107, 107, 107, 116, 116, 116]
FORMULA Philosophers-COL-000200-UpperBounds-14 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000200-UpperBounds-11 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000200-UpperBounds-10 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000200-UpperBounds-05 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000200-UpperBounds-09 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-00 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 200 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 208 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
[2022-05-17 16:26:58] [INFO ] Computed 400 place invariants in 2 ms
Finished random walk after 944866 steps, including 2 resets, run visited all 3 properties in 30001 ms. (steps per millisecond=31 )
Finished Best-First random walk after 618626 steps, including 1 resets, run visited all 3 properties in 5001 ms. (steps per millisecond=123 )
Finished Best-First random walk after 631958 steps, including 1 resets, run visited all 3 properties in 5001 ms. (steps per millisecond=126 )
Finished Best-First random walk after 581717 steps, including 1 resets, run visited all 3 properties in 5001 ms. (steps per millisecond=116 )
// Phase 1: matrix 400 rows 600 cols
[2022-05-17 16:27:43] [INFO ] Computed 400 place invariants in 7 ms
[2022-05-17 16:27:43] [INFO ] [Real]Absence check using 400 positive place invariants in 73 ms returned sat
[2022-05-17 16:27:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:27:44] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2022-05-17 16:27:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:27:44] [INFO ] [Nat]Absence check using 400 positive place invariants in 73 ms returned sat
[2022-05-17 16:27:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:27:44] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2022-05-17 16:27:44] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 16 ms.
[2022-05-17 16:27:44] [INFO ] Added : 0 causal constraints over 0 iterations in 54 ms. Result :sat
Minimization took 63 ms.
[2022-05-17 16:27:44] [INFO ] [Real]Absence check using 400 positive place invariants in 72 ms returned sat
[2022-05-17 16:27:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:27:44] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2022-05-17 16:27:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:27:45] [INFO ] [Nat]Absence check using 400 positive place invariants in 76 ms returned sat
[2022-05-17 16:27:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:27:45] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2022-05-17 16:27:45] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 17 ms.
[2022-05-17 16:27:45] [INFO ] Added : 0 causal constraints over 0 iterations in 52 ms. Result :sat
Minimization took 61 ms.
[2022-05-17 16:27:45] [INFO ] [Real]Absence check using 400 positive place invariants in 73 ms returned sat
[2022-05-17 16:27:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:27:45] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2022-05-17 16:27:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:27:45] [INFO ] [Nat]Absence check using 400 positive place invariants in 74 ms returned sat
[2022-05-17 16:27:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:27:46] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2022-05-17 16:27:46] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 20 ms.
[2022-05-17 16:27:46] [INFO ] Added : 0 causal constraints over 0 iterations in 60 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [100, 100, 100] Max seen :[99, 99, 99]
FORMULA Philosophers-COL-000200-UpperBounds-04 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000200-UpperBounds-03 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000200-UpperBounds-02 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 78603 ms.
BK_STOP 1652804866521
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m
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 r168-tall-165277016400221"
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 ;