Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r204-oct2-165281599000253.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 SafeBus-COL-80, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599000253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 6.2K Apr 29 11:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 29 11:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 11:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 11:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 45K 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 SafeBus-COL-80-UpperBounds-00
FORMULA_NAME SafeBus-COL-80-UpperBounds-01
FORMULA_NAME SafeBus-COL-80-UpperBounds-02
FORMULA_NAME SafeBus-COL-80-UpperBounds-03
FORMULA_NAME SafeBus-COL-80-UpperBounds-04
FORMULA_NAME SafeBus-COL-80-UpperBounds-05
FORMULA_NAME SafeBus-COL-80-UpperBounds-06
FORMULA_NAME SafeBus-COL-80-UpperBounds-07
FORMULA_NAME SafeBus-COL-80-UpperBounds-08
FORMULA_NAME SafeBus-COL-80-UpperBounds-09
FORMULA_NAME SafeBus-COL-80-UpperBounds-10
FORMULA_NAME SafeBus-COL-80-UpperBounds-11
FORMULA_NAME SafeBus-COL-80-UpperBounds-12
FORMULA_NAME SafeBus-COL-80-UpperBounds-13
FORMULA_NAME SafeBus-COL-80-UpperBounds-14
FORMULA_NAME SafeBus-COL-80-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652954707991

Running Version 202205111006
[2022-05-19 10:05:09] [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-19 10:05:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 10:05:09] [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-19 10:05:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 10:05:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 552 ms
[2022-05-19 10:05:09] [INFO ] Detected 1 constant HL places corresponding to 80 PT places.
[2022-05-19 10:05:09] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 13766 PT places and 4.2035361E7 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-19 10:05:09] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2022-05-19 10:05:09] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 14 rows 17 cols
[2022-05-19 10:05:09] [INFO ] Computed 7 place invariants in 9 ms
FORMULA SafeBus-COL-80-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-80-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-80-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-80-UpperBounds-04 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-80-UpperBounds-02 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-80-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 14 rows 17 cols
[2022-05-19 10:05:09] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-19 10:05:09] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-19 10:05:09] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-19 10:05:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:05:09] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 10:05:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-19 10:05:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 10:05:10] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-19 10:05:10] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2022-05-19 10:05:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 10:05:10] [INFO ] Added : 0 causal constraints over 0 iterations in 19 ms. Result :sat
Minimization took 5 ms.
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-19 10:05:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 10:05:10] [INFO ] Added : 8 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-19 10:05:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 10:05:10] [INFO ] Added : 13 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 5 ms.
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-19 10:05:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 10:05:10] [INFO ] Added : 9 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-19 10:05:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 10:05:10] [INFO ] Added : 8 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Real]Added 3 Read/Feed constraints in 5 ms returned sat
[2022-05-19 10:05:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 10:05:10] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 3 ms.
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2022-05-19 10:05:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 10:05:10] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-19 10:05:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 10:05:10] [INFO ] Added : 9 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:05:10] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-19 10:05:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:05:10] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-19 10:05:10] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-19 10:05:10] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 10:05:10] [INFO ] Added : 10 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [80, 80, 1, 3, 1, 80, 1, 5, 1, 1]
Domain [It(80), It(80)] of place AMC breaks symmetries in sort It
[2022-05-19 10:05:13] [INFO ] Unfolded HLPN to a Petri net with 13766 places and 550801 transitions 4295924 arcs in 2842 ms.
[2022-05-19 10:05:13] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Deduced a syphon composed of 80 places in 197 ms
Reduce places removed 160 places and 160 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25133 ms. (steps per millisecond=0 ) properties (out of 10) seen :163
FORMULA SafeBus-COL-80-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-80-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-80-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-80-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-80-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 995 ms. (steps per millisecond=10 ) properties (out of 5) seen :142
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 5) seen :142
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 776 ms. (steps per millisecond=12 ) properties (out of 5) seen :130
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 5) seen :144
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 5) seen :99
[2022-05-19 10:05:43] [INFO ] Flow matrix only has 38722 transitions (discarded 511919 similar events)
// Phase 1: matrix 38722 rows 13606 cols
[2022-05-19 10:05:50] [INFO ] Computed 325 place invariants in 6186 ms
[2022-05-19 10:05:51] [INFO ] [Real]Absence check using 161 positive place invariants in 333 ms returned sat
[2022-05-19 10:05:54] [INFO ] [Real]Absence check using 161 positive and 164 generalized place invariants in 3202 ms returned sat
[2022-05-19 10:05:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:05:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-19 10:05:56] [INFO ] [Real]Absence check using 161 positive place invariants in 315 ms returned sat
[2022-05-19 10:05:56] [INFO ] [Real]Absence check using 161 positive and 164 generalized place invariants in 472 ms returned sat
[2022-05-19 10:05:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:06:00] [INFO ] [Real]Absence check using state equation in 3237 ms returned unknown
[2022-05-19 10:06:01] [INFO ] [Real]Absence check using 161 positive place invariants in 371 ms returned sat
[2022-05-19 10:06:02] [INFO ] [Real]Absence check using 161 positive and 164 generalized place invariants in 467 ms returned unsat
[2022-05-19 10:06:03] [INFO ] [Real]Absence check using 161 positive place invariants in 414 ms returned sat
[2022-05-19 10:06:04] [INFO ] [Real]Absence check using 161 positive and 164 generalized place invariants in 517 ms returned sat
[2022-05-19 10:06:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:06:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-19 10:06:08] [INFO ] [Real]Absence check using 161 positive place invariants in 355 ms returned sat
[2022-05-19 10:06:09] [INFO ] [Real]Absence check using 161 positive and 164 generalized place invariants in 445 ms returned unsat
Current structural bounds on expressions (after SMT) : [80, 80, 1, 80, 1] Max seen :[77, 77, 1, 2, 1]
FORMULA SafeBus-COL-80-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-COL-80-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6560 out of 13606 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 13606/13606 places, 550641/550641 transitions.
Applied a total of 0 rules in 256129 ms. Remains 13606 /13606 variables (removed 0) and now considering 550641/550641 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 13606/13606 places, 550641/550641 transitions.
Normalized transition count is 38722 out of 550641 initially.
// Phase 1: matrix 38722 rows 13606 cols
[2022-05-19 10:10:32] [INFO ] Computed 325 place invariants in 6784 ms
Finished random walk after 14945 steps, including 0 resets, run visited all 3 properties in 30015 ms. (steps per millisecond=0 )
Finished Best-First random walk after 21352 steps, including 0 resets, run visited all 3 properties in 5004 ms. (steps per millisecond=4 )
FORMULA SafeBus-COL-80-UpperBounds-03 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-80-UpperBounds-01 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-05-19 10:11:08] [INFO ] Flow matrix only has 38722 transitions (discarded 511919 similar events)
// Phase 1: matrix 38722 rows 13606 cols
[2022-05-19 10:11:14] [INFO ] Computed 325 place invariants in 6236 ms
[2022-05-19 10:11:15] [INFO ] [Real]Absence check using 161 positive place invariants in 340 ms returned sat
[2022-05-19 10:11:16] [INFO ] [Real]Absence check using 161 positive and 164 generalized place invariants in 456 ms returned sat
[2022-05-19 10:11:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:11:51] [INFO ] [Real]Absence check using state equation in 35391 ms returned sat
[2022-05-19 10:11:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:11:53] [INFO ] [Nat]Absence check using 161 positive place invariants in 307 ms returned sat
[2022-05-19 10:11:54] [INFO ] [Nat]Absence check using 161 positive and 164 generalized place invariants in 452 ms returned sat
[2022-05-19 10:11:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:12:32] [INFO ] [Nat]Absence check using state equation in 38186 ms returned sat
[2022-05-19 10:12:41] [INFO ] State equation strengthened by 6481 read => feed constraints.
[2022-05-19 10:12:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:910)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [80] Max seen :[2]
Support contains 80 out of 13606 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 13606/13606 places, 550641/550641 transitions.
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 13606 transition count 550561
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 0 with 80 rules applied. Total rules applied 160 place count 13526 transition count 550561
Applied a total of 160 rules in 700595 ms. Remains 13526 /13606 variables (removed 80) and now considering 550561/550641 (removed 80) transitions.
Finished structural reductions, in 1 iterations. Remains : 13526/13606 places, 550561/550641 transitions.
Normalized transition count is 38642 out of 550561 initially.
// Phase 1: matrix 38642 rows 13526 cols
[2022-05-19 10:24:29] [INFO ] Computed 325 place invariants in 6711 ms
Finished random walk after 10640 steps, including 0 resets, run visited all 1 properties in 30020 ms. (steps per millisecond=0 )
Finished Best-First random walk after 30643 steps, including 0 resets, run visited all 1 properties in 5021 ms. (steps per millisecond=6 )
[2022-05-19 10:25:04] [INFO ] Flow matrix only has 38642 transitions (discarded 511919 similar events)
// Phase 1: matrix 38642 rows 13526 cols
[2022-05-19 10:25:10] [INFO ] Computed 325 place invariants in 6211 ms
[2022-05-19 10:25:12] [INFO ] [Real]Absence check using 161 positive place invariants in 302 ms returned sat
[2022-05-19 10:25:13] [INFO ] [Real]Absence check using 161 positive and 164 generalized place invariants in 1789 ms returned sat
[2022-05-19 10:25:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:25:46] [INFO ] [Real]Absence check using state equation in 32523 ms returned sat
[2022-05-19 10:25:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:25:48] [INFO ] [Nat]Absence check using 161 positive place invariants in 322 ms returned sat
[2022-05-19 10:25:51] [INFO ] [Nat]Absence check using 161 positive and 164 generalized place invariants in 3441 ms returned sat
[2022-05-19 10:25:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:26:32] [INFO ] [Nat]Absence check using state equation in 40358 ms returned unknown
Current structural bounds on expressions (after SMT) : [80] Max seen :[14]
Support contains 80 out of 13526 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 13526/13526 places, 550561/550561 transitions.
Applied a total of 0 rules in 346839 ms. Remains 13526 /13526 variables (removed 0) and now considering 550561/550561 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 13526/13526 places, 550561/550561 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 13526/13526 places, 550561/550561 transitions.
Applied a total of 0 rules in 346128 ms. Remains 13526 /13526 variables (removed 0) and now considering 550561/550561 (removed 0) transitions.
[2022-05-19 10:38:05] [INFO ] Flow matrix only has 38642 transitions (discarded 511919 similar events)
// Phase 1: matrix 38642 rows 13526 cols
[2022-05-19 10:38:13] [INFO ] Computed 325 place invariants in 8407 ms
[2022-05-19 10:38:14] [INFO ] Implicit Places using invariants in 9499 ms returned []
Implicit Place search using SMT only with invariants took 9513 ms to find 0 implicit places.
[2022-05-19 10:38:14] [INFO ] Flow matrix only has 38642 transitions (discarded 511919 similar events)
// Phase 1: matrix 38642 rows 13526 cols
[2022-05-19 10:38:21] [INFO ] Computed 325 place invariants in 6936 ms
[2022-05-19 10:38:23] [INFO ] Dead Transitions using invariants and state equation in 8173 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 13526/13526 places, 550561/550561 transitions.
Normalized transition count is 38642 out of 550561 initially.
// Phase 1: matrix 38642 rows 13526 cols
[2022-05-19 10:38:30] [INFO ] Computed 325 place invariants in 6990 ms
Finished random walk after 11387 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 33315 steps, including 0 resets, run visited all 1 properties in 5017 ms. (steps per millisecond=6 )
[2022-05-19 10:39:05] [INFO ] Flow matrix only has 38642 transitions (discarded 511919 similar events)
// Phase 1: matrix 38642 rows 13526 cols
[2022-05-19 10:39:12] [INFO ] Computed 325 place invariants in 6991 ms
[2022-05-19 10:39:14] [INFO ] [Real]Absence check using 161 positive place invariants in 309 ms returned sat
[2022-05-19 10:39:16] [INFO ] [Real]Absence check using 161 positive and 164 generalized place invariants in 1828 ms returned sat
[2022-05-19 10:39:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:39:48] [INFO ] [Real]Absence check using state equation in 32858 ms returned sat
[2022-05-19 10:39:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:39:51] [INFO ] [Nat]Absence check using 161 positive place invariants in 294 ms returned sat
[2022-05-19 10:39:54] [INFO ] [Nat]Absence check using 161 positive and 164 generalized place invariants in 3385 ms returned sat
[2022-05-19 10:39:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:40:34] [INFO ] [Nat]Absence check using state equation in 40307 ms returned unknown
Current structural bounds on expressions (after SMT) : [80] Max seen :[14]
Support contains 80 out of 13526 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 13526/13526 places, 550561/550561 transitions.
Applied a total of 0 rules in 350741 ms. Remains 13526 /13526 variables (removed 0) and now considering 550561/550561 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 13526/13526 places, 550561/550561 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 13526/13526 places, 550561/550561 transitions.
Applied a total of 0 rules in 349649 ms. Remains 13526 /13526 variables (removed 0) and now considering 550561/550561 (removed 0) transitions.
[2022-05-19 10:52:15] [INFO ] Flow matrix only has 38642 transitions (discarded 511919 similar events)
// Phase 1: matrix 38642 rows 13526 cols
[2022-05-19 10:52:21] [INFO ] Computed 325 place invariants in 6305 ms
[2022-05-19 10:52:22] [INFO ] Implicit Places using invariants in 7387 ms returned []
Implicit Place search using SMT only with invariants took 7388 ms to find 0 implicit places.
[2022-05-19 10:52:22] [INFO ] Flow matrix only has 38642 transitions (discarded 511919 similar events)
// Phase 1: matrix 38642 rows 13526 cols
[2022-05-19 10:52:29] [INFO ] Computed 325 place invariants in 6746 ms
[2022-05-19 10:52:30] [INFO ] Dead Transitions using invariants and state equation in 7722 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 13526/13526 places, 550561/550561 transitions.
Starting property specific reduction for SafeBus-COL-80-UpperBounds-10
Normalized transition count is 38642 out of 550561 initially.
// Phase 1: matrix 38642 rows 13526 cols
[2022-05-19 10:52:38] [INFO ] Computed 325 place invariants in 7306 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26842 ms. (steps per millisecond=0 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
[2022-05-19 10:53:05] [INFO ] Flow matrix only has 38642 transitions (discarded 511919 similar events)
// Phase 1: matrix 38642 rows 13526 cols
[2022-05-19 10:53:13] [INFO ] Computed 325 place invariants in 7034 ms
[2022-05-19 10:53:15] [INFO ] [Real]Absence check using 161 positive place invariants in 301 ms returned sat
[2022-05-19 10:53:16] [INFO ] [Real]Absence check using 161 positive and 164 generalized place invariants in 1484 ms returned sat
[2022-05-19 10:53:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:53:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [6321] Max seen :[2]
Support contains 80 out of 13526 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 13526/13526 places, 550561/550561 transitions.
Applied a total of 0 rules in 354999 ms. Remains 13526 /13526 variables (removed 0) and now considering 550561/550561 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 13526/13526 places, 550561/550561 transitions.
Normalized transition count is 38642 out of 550561 initially.
// Phase 1: matrix 38642 rows 13526 cols
[2022-05-19 10:59:20] [INFO ] Computed 325 place invariants in 7025 ms
Finished random walk after 13255 steps, including 0 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=0 )
Finished Best-First random walk after 35050 steps, including 0 resets, run visited all 1 properties in 5014 ms. (steps per millisecond=6 )
[2022-05-19 10:59:55] [INFO ] Flow matrix only has 38642 transitions (discarded 511919 similar events)
// Phase 1: matrix 38642 rows 13526 cols
[2022-05-19 11:00:02] [INFO ] Computed 325 place invariants in 6931 ms
[2022-05-19 11:00:04] [INFO ] [Real]Absence check using 161 positive place invariants in 338 ms returned sat
[2022-05-19 11:00:06] [INFO ] [Real]Absence check using 161 positive and 164 generalized place invariants in 2191 ms returned sat
[2022-05-19 11:00:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 11:00:39] [INFO ] [Real]Absence check using state equation in 32774 ms returned sat
[2022-05-19 11:00:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 11:00:41] [INFO ] [Nat]Absence check using 161 positive place invariants in 317 ms returned sat
[2022-05-19 11:00:44] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-19 11:00:45] [INFO ] [Nat]Absence check using 161 positive and 164 generalized place invariants in 3786 ms returned sat
[2022-05-19 11:00:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 11:01:25] [INFO ] [Nat]Absence check using state equation in 40024 ms returned unknown
Current structural bounds on expressions (after SMT) : [6321] Max seen :[13]
Support contains 80 out of 13526 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 13526/13526 places, 550561/550561 transitions.

BK_TIME_CONFINEMENT_REACHED

--------------------
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="SafeBus-COL-80"
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 SafeBus-COL-80, 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 r204-oct2-165281599000253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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