Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922815101006.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is EnergyBus-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922815101006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 3.0K Apr 13 13:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 13 13:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 13 13:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 13 13:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 15:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 15:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 13 13:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 13 13:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 13 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 13 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 13 13:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 13 13:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 3.2M Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-00
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-01
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-02
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-03
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-04
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-05
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-06
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-07
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-08
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-09
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-10
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-11
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-12
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-13
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-14
FORMULA_NAME EnergyBus-PT-none-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1590158210525

[2020-05-22 14:36:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-22 14:36:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 14:36:53] [INFO ] Load time of PNML (sax parser for PT used): 337 ms
[2020-05-22 14:36:53] [INFO ] Transformed 157 places.
[2020-05-22 14:36:53] [INFO ] Transformed 4430 transitions.
[2020-05-22 14:36:53] [INFO ] Found NUPN structural information;
[2020-05-22 14:36:53] [INFO ] Parsed PT model containing 157 places and 4430 transitions in 460 ms.
Deduced a syphon composed of 4 places in 28 ms
Reduce places removed 4 places and 825 transitions.
Ensure Unique test removed 1692 transitions
Reduce redundant transitions removed 1692 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 132 ms.
Working with output stream class java.io.PrintStream
FORMULA EnergyBus-PT-none-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 155 ms. (steps per millisecond=64 ) properties seen :[0, 0, 0, 0, 1, 0]
FORMULA EnergyBus-PT-none-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 1, 0, 0, 0]
FORMULA EnergyBus-PT-none-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0]
[2020-05-22 14:36:53] [INFO ] Flow matrix only has 647 transitions (discarded 1266 similar events)
// Phase 1: matrix 647 rows 153 cols
[2020-05-22 14:36:53] [INFO ] Computed 23 place invariants in 22 ms
[2020-05-22 14:36:54] [INFO ] [Real]Absence check using 21 positive place invariants in 23 ms returned sat
[2020-05-22 14:36:54] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:36:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:36:54] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2020-05-22 14:36:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:36:54] [INFO ] [Nat]Absence check using 21 positive place invariants in 41 ms returned unsat
[2020-05-22 14:36:54] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2020-05-22 14:36:54] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-22 14:36:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:36:54] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2020-05-22 14:36:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:36:55] [INFO ] [Nat]Absence check using 21 positive place invariants in 60 ms returned sat
[2020-05-22 14:36:55] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:36:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:36:55] [INFO ] [Nat]Absence check using state equation in 523 ms returned sat
[2020-05-22 14:36:55] [INFO ] State equation strengthened by 468 read => feed constraints.
[2020-05-22 14:36:55] [INFO ] [Nat]Added 468 Read/Feed constraints in 154 ms returned sat
[2020-05-22 14:36:56] [INFO ] Deduced a trap composed of 9 places in 541 ms
[2020-05-22 14:36:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 679 ms
[2020-05-22 14:36:56] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 314 ms.
[2020-05-22 14:37:00] [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 (=> (> t174 0) (or (and (or (and (> t0 0) (< o0 o174)) (and (> t88 0) (< o88 o174))) (or (and (> t0 0) (< o0 o174)) (and (> t139 0) (< o139 o174)) (and (> t140 0) (< o140 o174))) (or (and (> t61 0) (< o61 o174)) (and (> t69 0) (< o69 o174))) (or (and (> t62 0) (< o62 o174)) (and (> t64 0) (< o64 o174)) (and (> t66 0) (< o66 o174))) (and (> t107 0) (< o107 o174)) (and (> t153 0) (< o153 o174)) (or (and (> t146 0) (< o146 o174)) (and (> t610 0) (< o610 o174))) (or (and (> t6 0) (< o6 o174)) (and (> t8 0) (< o8 o174)) (and (> t617 0) (< o617 o174)))) (and (or (and (> t0 0) (< o0 o174)) (and (> t88 0) (< o88 o174))) (or (and (> t0 0) (< o0 o174)) (and (> t139 0) (< o139 o174)) (and (> t140 0) (< o140 o174))) (or (and (> t61 0) (< o61 o174)) (and (> t69 0) (< o69 o174))) (or (and (> t62 0) (< o62 o174)) (and (> t64 0) (< o64 o174)) (and (> t66 0) (< o66 o174))) (and (> t107 0) (< o107 o174)) (or (and (> t141 0) (< o141 o174)) (and (> t144 0) (< o144 o174))) (or (and (> t146 0) (< o146 o174)) (and (> t610 0) (< o610 o174))) (or (and (> t6 0) (< o6 o174)) (and (> t8 0) (< o8 o174)) (and (> t617 0) (< o617 o174)))) (and (or (and (> t0 0) (< o0 o174)) (and (> t88 0) (< o88 o174))) (or (and (> t0 0) (< o0 o174)) (and (> t139 0) (< o139 o174)) (and (> t140 0) (< o140 o174))) (or (and (> t61 0) (< o61 o174)) (and (> t69 0) (< o69 o174))) (or (and (> t62 0) (< o62 o174)) (and (> t64 0) (< o64 o174)) (and (> t66 0) (< o66 o174))) (and (> t107 0) (< o107 o174)) (or (and (> t0 0) (< o0 o174)) (and (> t35 0) (< o35 o174)) (and (> t142 0) (< o142 o174)) (and (> t143 0) (< o143 o174))) (or (and (> t146 0) (< o146 o174)) (and (> t610 0) (< o610 o174))) (or (and (> t6 0) (< o6 o174)) (and (> t8 0) (< o8 o174)) (and (> t617 0) (< o617 o174)))) (and (or (and (> t0 0) (< o0 o174)) (and (> t88 0) (< o88 o174))) (or (and (> t0 0) (< o0 o174)) (and (> t139 0) (< o139 o174)) (and (> t140 0) (< o140 o174))) (or (and (> t61 0) (< o61 o174)) (and (> t69 0) (< o69 o174))) (or (and (> t62 0) (< o62 o174)) (and (> t64 0) (< o64 o174)) (and (> t66 0) (< o66 o174))) (and (> t107 0) (< o107 o174)) (and (> t153 0) (< o153 o174)) (or (and (> t0 0) (< o0 o174)) (and (> t145 0) (< o145 o174)) (and (> t611 0) (< o611 o174))) (or (and (> t6 0) (< o6 o174)) (and (> t8 0) (< o8 o174)) (and (> t617 0) (< o617 o174)))) (and (or (and (> t0 0) (< o0 o174)) (and (> t88 0) (< o88 o174))) (or (and (> t0 0) (< o0 o174)) (and (> t139 0) (< o139 o174)) (and (> t140 0) (< o140 o174))) (or (and (> t61 0) (< o61 o174)) (and (> t69 0) (< o69 o174))) (or (and (> t62 0) (< o62 o174)) (and (> t64 0) (< o64 o174)) (and (> t66 0) (< o66 o174))) (and (> t107 0) (< o107 o174)) (or (and (> t141 0) (< o141 o174)) (and (> t144 0) (< o144 o174))) (or (and (> t0 0) (< o0 o174)) (and (> t145 0) (< o145 o174)) (and (> t611 0) (< o611 o174))) (or (and (> t6 0) (< o6 o174)) (and (> t8 0) (< o8 o174)) (and (> t617 0) (< o617 o174)))) (and (or (and (> t0 0) (< o0 o174)) (and (> t88 0) (< o88 o174))) (or (and (> t0 0) (< o0 o174)) (and (> t139 0) (< o139 o174)) (and (> t140 0) (< o140 o174))) (or (and (> t61 0) (< o61 o174)) (and (> t69 0) (< o69 o174))) (or (and (> t62 0) (< o62 o174)) (and (> t64 0) (< o64 o174)) (and (> t66 0) (< o66 o174))) (and (> t107 0) (< o107 o174)) (or (and (> t0 0) (< o0 o174)) (and (> t35 0) (< o35 o174)) (and (> t142 0) (< o142 o174)) (and (> t143 0) (< o143 o174))) (or (and (> t0 0) (< o0 o174)) (and (> t145 0) (< o145 o174)) (and (> t611 0) (< o611 o174))) (or (and (> t6 0) (< o6 o174)) (and (> t8 0) (< o8 o174)) (and (> t617 0) (< o617 o174))))))") while checking expression at index 1
[2020-05-22 14:37:00] [INFO ] [Real]Absence check using 21 positive place invariants in 18 ms returned sat
[2020-05-22 14:37:00] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 5 ms returned sat
[2020-05-22 14:37:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:37:00] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2020-05-22 14:37:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:37:00] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2020-05-22 14:37:00] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:37:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:37:00] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2020-05-22 14:37:00] [INFO ] [Nat]Added 468 Read/Feed constraints in 99 ms returned sat
[2020-05-22 14:37:00] [INFO ] Deduced a trap composed of 9 places in 208 ms
[2020-05-22 14:37:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2020-05-22 14:37:01] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 135 ms.
[2020-05-22 14:37:05] [INFO ] Added : 165 causal constraints over 33 iterations in 4371 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-22 14:37:05] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned sat
[2020-05-22 14:37:05] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:37:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:37:05] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2020-05-22 14:37:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:37:05] [INFO ] [Nat]Absence check using 21 positive place invariants in 48 ms returned sat
[2020-05-22 14:37:05] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-22 14:37:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:37:06] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2020-05-22 14:37:06] [INFO ] [Nat]Added 468 Read/Feed constraints in 83 ms returned sat
[2020-05-22 14:37:06] [INFO ] Deduced a trap composed of 9 places in 252 ms
[2020-05-22 14:37:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 331 ms
[2020-05-22 14:37:06] [INFO ] Computed and/alt/rep : 1912/37782/646 causal constraints in 128 ms.
[2020-05-22 14:37:10] [INFO ] Added : 190 causal constraints over 38 iterations in 4233 ms. Result :unknown
FORMULA EnergyBus-PT-none-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 462300 steps, including 1000 resets, run finished after 4592 ms. (steps per millisecond=100 ) properties seen :[0, 1, 0] could not realise parikh vector
FORMULA EnergyBus-PT-none-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 1913/1913 transitions.
Graph (trivial) has 135 edges and 153 vertex of which 17 / 153 are part of one of the 6 SCC in 14 ms
Free SCC test removed 11 places
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Graph (complete) has 751 edges and 142 vertex of which 138 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.50 ms
Drop transitions removed 31 transitions
Ensure Unique test removed 1038 transitions
Reduce isomorphic transitions removed 1069 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 1073 rules applied. Total rules applied 1075 place count 138 transition count 837
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 1082 place count 134 transition count 834
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 1082 place count 134 transition count 825
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 1100 place count 125 transition count 825
Symmetric choice reduction at 2 with 21 rule applications. Total rules 1121 place count 125 transition count 825
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 273 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 1163 place count 104 transition count 552
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 1193 place count 104 transition count 522
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1207 place count 97 transition count 515
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 1233 place count 97 transition count 489
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 1249 place count 89 transition count 519
Drop transitions removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1257 place count 89 transition count 511
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1265 place count 89 transition count 503
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1273 place count 81 transition count 503
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1277 place count 81 transition count 567
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1283 place count 77 transition count 565
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 1285 place count 77 transition count 565
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1286 place count 77 transition count 565
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 7 with 35 rules applied. Total rules applied 1321 place count 77 transition count 530
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1325 place count 75 transition count 528
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1327 place count 75 transition count 526
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1329 place count 73 transition count 526
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1331 place count 73 transition count 960
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1337 place count 69 transition count 958
Drop transitions removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 9 with 74 rules applied. Total rules applied 1411 place count 69 transition count 884
Applied a total of 1411 rules in 647 ms. Remains 69 /153 variables (removed 84) and now considering 884/1913 (removed 1029) transitions.
Finished structural reductions, in 1 iterations. Remains : 69/153 places, 884/1913 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 9270 ms. (steps per millisecond=107 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1827 ms. (steps per millisecond=547 ) properties seen :[1, 0]
FORMULA EnergyBus-PT-none-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1671 ms. (steps per millisecond=598 ) properties seen :[0]
[2020-05-22 14:37:28] [INFO ] Flow matrix only has 531 transitions (discarded 353 similar events)
// Phase 1: matrix 531 rows 69 cols
[2020-05-22 14:37:28] [INFO ] Computed 20 place invariants in 2 ms
[2020-05-22 14:37:28] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2020-05-22 14:37:28] [INFO ] [Real]Absence check using 19 positive and 1 generalized place invariants in 0 ms returned sat
[2020-05-22 14:37:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:37:28] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2020-05-22 14:37:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:37:28] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2020-05-22 14:37:28] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-22 14:37:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:37:29] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-05-22 14:37:29] [INFO ] State equation strengthened by 478 read => feed constraints.
[2020-05-22 14:37:29] [INFO ] [Nat]Added 478 Read/Feed constraints in 80 ms returned sat
[2020-05-22 14:37:29] [INFO ] Computed and/alt/rep : 882/52428/529 causal constraints in 88 ms.
[2020-05-22 14:37:47] [INFO ] Added : 190 causal constraints over 38 iterations in 18513 ms. Result :unknown
Incomplete Parikh walk after 57900 steps, including 973 resets, run finished after 852 ms. (steps per millisecond=67 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 69/69 places, 884/884 transitions.
Applied a total of 0 rules in 81 ms. Remains 69 /69 variables (removed 0) and now considering 884/884 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 69/69 places, 884/884 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 8405 ms. (steps per millisecond=118 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1506 ms. (steps per millisecond=664 ) properties seen :[0]
Interrupted probabilistic random walk after 8414253 steps, run timeout after 30001 ms. (steps per millisecond=280 ) properties seen :[0]
Probabilistic random walk after 8414253 steps, saw 958397 distinct states, run finished after 30001 ms. (steps per millisecond=280 ) properties seen :[0]
[2020-05-22 14:38:28] [INFO ] Flow matrix only has 531 transitions (discarded 353 similar events)
// Phase 1: matrix 531 rows 69 cols
[2020-05-22 14:38:28] [INFO ] Computed 20 place invariants in 2 ms
[2020-05-22 14:38:28] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2020-05-22 14:38:28] [INFO ] [Real]Absence check using 19 positive and 1 generalized place invariants in 4 ms returned sat
[2020-05-22 14:38:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 14:38:28] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2020-05-22 14:38:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 14:38:28] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2020-05-22 14:38:28] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 0 ms returned sat
[2020-05-22 14:38:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 14:38:28] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2020-05-22 14:38:28] [INFO ] State equation strengthened by 478 read => feed constraints.
[2020-05-22 14:38:28] [INFO ] [Nat]Added 478 Read/Feed constraints in 55 ms returned sat
[2020-05-22 14:38:29] [INFO ] Computed and/alt/rep : 882/52428/529 causal constraints in 74 ms.
[2020-05-22 14:38:46] [INFO ] Added : 190 causal constraints over 38 iterations in 17626 ms. Result :unknown
Incomplete Parikh walk after 57900 steps, including 973 resets, run finished after 867 ms. (steps per millisecond=66 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 69/69 places, 884/884 transitions.
Applied a total of 0 rules in 75 ms. Remains 69 /69 variables (removed 0) and now considering 884/884 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 69/69 places, 884/884 transitions.
Starting structural reductions, iteration 0 : 69/69 places, 884/884 transitions.
Applied a total of 0 rules in 78 ms. Remains 69 /69 variables (removed 0) and now considering 884/884 (removed 0) transitions.
[2020-05-22 14:38:47] [INFO ] Flow matrix only has 531 transitions (discarded 353 similar events)
// Phase 1: matrix 531 rows 69 cols
[2020-05-22 14:38:47] [INFO ] Computed 20 place invariants in 2 ms
[2020-05-22 14:38:47] [INFO ] Implicit Places using invariants in 291 ms returned [5, 6, 7, 25, 29, 55]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 294 ms to find 6 implicit places.
[2020-05-22 14:38:48] [INFO ] Redundant transitions in 265 ms returned []
[2020-05-22 14:38:48] [INFO ] Flow matrix only has 531 transitions (discarded 353 similar events)
// Phase 1: matrix 531 rows 63 cols
[2020-05-22 14:38:48] [INFO ] Computed 14 place invariants in 1 ms
[2020-05-22 14:38:48] [INFO ] Dead Transitions using invariants and state equation in 466 ms returned []
Starting structural reductions, iteration 1 : 63/69 places, 884/884 transitions.
Graph (trivial) has 41 edges and 63 vertex of which 4 / 63 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions removed 9 transitions
Ensure Unique test removed 399 transitions
Reduce isomorphic transitions removed 408 transitions.
Iterating post reduction 0 with 408 rules applied. Total rules applied 409 place count 60 transition count 476
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 409 place count 60 transition count 474
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 413 place count 58 transition count 474
Symmetric choice reduction at 1 with 1 rule applications. Total rules 414 place count 58 transition count 474
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 416 place count 57 transition count 473
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 198 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 614 place count 57 transition count 275
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 624 place count 52 transition count 270
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 629 place count 52 transition count 265
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 630 place count 52 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 631 place count 51 transition count 264
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 632 place count 51 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 633 place count 50 transition count 263
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 641 place count 50 transition count 263
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 665 place count 50 transition count 239
Applied a total of 665 rules in 44 ms. Remains 50 /63 variables (removed 13) and now considering 239/884 (removed 645) transitions.
[2020-05-22 14:38:48] [INFO ] Flow matrix only has 166 transitions (discarded 73 similar events)
// Phase 1: matrix 166 rows 50 cols
[2020-05-22 14:38:48] [INFO ] Computed 14 place invariants in 1 ms
[2020-05-22 14:38:48] [INFO ] Implicit Places using invariants in 50 ms returned [3, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 48/69 places, 239/884 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 48 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 47 transition count 238
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 46 transition count 237
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 46 transition count 235
Applied a total of 6 rules in 15 ms. Remains 46 /48 variables (removed 2) and now considering 235/239 (removed 4) transitions.
[2020-05-22 14:38:48] [INFO ] Flow matrix only has 162 transitions (discarded 73 similar events)
// Phase 1: matrix 162 rows 46 cols
[2020-05-22 14:38:48] [INFO ] Computed 12 place invariants in 1 ms
[2020-05-22 14:38:48] [INFO ] Implicit Places using invariants in 45 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions, iteration 3 : 45/69 places, 235/884 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 42 transition count 232
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 28 place count 42 transition count 210
Applied a total of 28 rules in 12 ms. Remains 42 /45 variables (removed 3) and now considering 210/235 (removed 25) transitions.
[2020-05-22 14:38:48] [INFO ] Flow matrix only has 143 transitions (discarded 67 similar events)
// Phase 1: matrix 143 rows 42 cols
[2020-05-22 14:38:48] [INFO ] Computed 11 place invariants in 1 ms
[2020-05-22 14:38:48] [INFO ] Implicit Places using invariants in 37 ms returned []
[2020-05-22 14:38:48] [INFO ] Flow matrix only has 143 transitions (discarded 67 similar events)
// Phase 1: matrix 143 rows 42 cols
[2020-05-22 14:38:48] [INFO ] Computed 11 place invariants in 0 ms
[2020-05-22 14:38:48] [INFO ] State equation strengthened by 103 read => feed constraints.
[2020-05-22 14:38:49] [INFO ] Implicit Places using invariants and state equation in 113 ms returned [7, 32]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 151 ms to find 2 implicit places.
Starting structural reductions, iteration 4 : 40/69 places, 210/884 transitions.
Applied a total of 0 rules in 4 ms. Remains 40 /40 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2020-05-22 14:38:49] [INFO ] Redundant transitions in 30 ms returned [180, 182, 183, 185]
Found 4 redundant transitions using SMT.
Drop transitions removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions :[185, 183, 182, 180]
[2020-05-22 14:38:49] [INFO ] Flow matrix only has 141 transitions (discarded 65 similar events)
// Phase 1: matrix 141 rows 40 cols
[2020-05-22 14:38:49] [INFO ] Computed 9 place invariants in 0 ms
[2020-05-22 14:38:49] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
Starting structural reductions, iteration 5 : 40/69 places, 206/884 transitions.
Applied a total of 0 rules in 8 ms. Remains 40 /40 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2020-05-22 14:38:49] [INFO ] Redundant transitions in 19 ms returned []
[2020-05-22 14:38:49] [INFO ] Flow matrix only has 141 transitions (discarded 65 similar events)
// Phase 1: matrix 141 rows 40 cols
[2020-05-22 14:38:49] [INFO ] Computed 9 place invariants in 1 ms
[2020-05-22 14:38:49] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
Finished structural reductions, in 6 iterations. Remains : 40/69 places, 206/884 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1144 ms. (steps per millisecond=874 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 378 ms. (steps per millisecond=2645 ) properties seen :[0]
Finished probabilistic random walk after 324822 steps, run visited all 1 properties in 467 ms. (steps per millisecond=695 )
Probabilistic random walk after 324822 steps, saw 44831 distinct states, run finished after 467 ms. (steps per millisecond=695 ) properties seen :[1]
FORMULA EnergyBus-PT-none-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.

BK_STOP 1590158331719

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="EnergyBus-PT-none"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 EnergyBus-PT-none, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tajo-158922815101006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EnergyBus-PT-none.tgz
mv EnergyBus-PT-none execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;