About the Execution of ITS-Tools for EnergyBus-PT-none
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
388.075 | 25831.00 | 45189.00 | 229.50 | 1 1 1 1 0 1 1 1 1 1 1 1 0 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r158-smll-171636266400221.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is EnergyBus-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266400221
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 12 18:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 136K Apr 12 18:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.2M May 18 16:42 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 EnergyBus-PT-none-UpperBounds-00
FORMULA_NAME EnergyBus-PT-none-UpperBounds-01
FORMULA_NAME EnergyBus-PT-none-UpperBounds-02
FORMULA_NAME EnergyBus-PT-none-UpperBounds-03
FORMULA_NAME EnergyBus-PT-none-UpperBounds-04
FORMULA_NAME EnergyBus-PT-none-UpperBounds-05
FORMULA_NAME EnergyBus-PT-none-UpperBounds-06
FORMULA_NAME EnergyBus-PT-none-UpperBounds-07
FORMULA_NAME EnergyBus-PT-none-UpperBounds-08
FORMULA_NAME EnergyBus-PT-none-UpperBounds-09
FORMULA_NAME EnergyBus-PT-none-UpperBounds-10
FORMULA_NAME EnergyBus-PT-none-UpperBounds-11
FORMULA_NAME EnergyBus-PT-none-UpperBounds-12
FORMULA_NAME EnergyBus-PT-none-UpperBounds-13
FORMULA_NAME EnergyBus-PT-none-UpperBounds-14
FORMULA_NAME EnergyBus-PT-none-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716579266243
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EnergyBus-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-24 19:34:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 19:34:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 19:34:29] [INFO ] Load time of PNML (sax parser for PT used): 630 ms
[2024-05-24 19:34:29] [INFO ] Transformed 157 places.
[2024-05-24 19:34:29] [INFO ] Transformed 4430 transitions.
[2024-05-24 19:34:29] [INFO ] Found NUPN structural information;
[2024-05-24 19:34:29] [INFO ] Parsed PT model containing 157 places and 4430 transitions and 63389 arcs in 888 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Deduced a syphon composed of 4 places in 26 ms
Reduce places removed 4 places and 825 transitions.
Ensure Unique test removed 1692 transitions
Reduce redundant transitions removed 1692 transitions.
FORMULA EnergyBus-PT-none-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-24 19:34:29] [INFO ] Flow matrix only has 647 transitions (discarded 1266 similar events)
// Phase 1: matrix 647 rows 153 cols
[2024-05-24 19:34:29] [INFO ] Computed 23 invariants in 38 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 281 ms. (35 steps per ms)
FORMULA EnergyBus-PT-none-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-24 19:34:30] [INFO ] Flow matrix only has 647 transitions (discarded 1266 similar events)
[2024-05-24 19:34:30] [INFO ] Invariant cache hit.
[2024-05-24 19:34:30] [INFO ] [Real]Absence check using 21 positive place invariants in 23 ms returned sat
[2024-05-24 19:34:30] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-24 19:34:31] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2024-05-24 19:34:31] [INFO ] State equation strengthened by 463 read => feed constraints.
[2024-05-24 19:34:31] [INFO ] [Real]Added 463 Read/Feed constraints in 161 ms returned sat
[2024-05-24 19:34:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:34:31] [INFO ] [Nat]Absence check using 21 positive place invariants in 18 ms returned sat
[2024-05-24 19:34:31] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-24 19:34:32] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2024-05-24 19:34:32] [INFO ] [Nat]Added 463 Read/Feed constraints in 118 ms returned sat
[2024-05-24 19:34:32] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 9 ms to minimize.
[2024-05-24 19:34:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2024-05-24 19:34:32] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 248 ms.
[2024-05-24 19:34:34] [INFO ] Deduced a trap composed of 7 places in 437 ms of which 3 ms to minimize.
[2024-05-24 19:34:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 560 ms
[2024-05-24 19:34:34] [INFO ] Added : 105 causal constraints over 22 iterations in 2130 ms. Result :sat
Minimization took 584 ms.
[2024-05-24 19:34:35] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2024-05-24 19:34:35] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-24 19:34:35] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2024-05-24 19:34:35] [INFO ] [Real]Added 463 Read/Feed constraints in 108 ms returned sat
[2024-05-24 19:34:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:34:35] [INFO ] [Nat]Absence check using 21 positive place invariants in 17 ms returned sat
[2024-05-24 19:34:35] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 19:34:35] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2024-05-24 19:34:36] [INFO ] [Nat]Added 463 Read/Feed constraints in 130 ms returned sat
[2024-05-24 19:34:36] [INFO ] Deduced a trap composed of 8 places in 525 ms of which 2 ms to minimize.
[2024-05-24 19:34:37] [INFO ] Deduced a trap composed of 10 places in 450 ms of which 2 ms to minimize.
[2024-05-24 19:34:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1125 ms
[2024-05-24 19:34:37] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 187 ms.
[2024-05-24 19:34:39] [INFO ] Deduced a trap composed of 9 places in 281 ms of which 1 ms to minimize.
[2024-05-24 19:34:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
[2024-05-24 19:34:39] [INFO ] Added : 134 causal constraints over 27 iterations in 1955 ms. Result :sat
Minimization took 575 ms.
[2024-05-24 19:34:39] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2024-05-24 19:34:39] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-24 19:34:40] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2024-05-24 19:34:40] [INFO ] [Real]Added 463 Read/Feed constraints in 128 ms returned sat
[2024-05-24 19:34:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:34:40] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2024-05-24 19:34:40] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 19:34:40] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2024-05-24 19:34:40] [INFO ] [Nat]Added 463 Read/Feed constraints in 135 ms returned sat
[2024-05-24 19:34:41] [INFO ] Deduced a trap composed of 7 places in 753 ms of which 2 ms to minimize.
[2024-05-24 19:34:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 836 ms
[2024-05-24 19:34:41] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 181 ms.
[2024-05-24 19:34:44] [INFO ] Added : 137 causal constraints over 28 iterations in 2447 ms. Result :sat
Minimization took 563 ms.
[2024-05-24 19:34:44] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2024-05-24 19:34:44] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 19:34:44] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-24 19:34:44] [INFO ] [Real]Added 463 Read/Feed constraints in 75 ms returned sat
[2024-05-24 19:34:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:34:45] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2024-05-24 19:34:45] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 19:34:45] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2024-05-24 19:34:45] [INFO ] [Nat]Added 463 Read/Feed constraints in 127 ms returned sat
[2024-05-24 19:34:45] [INFO ] Computed and/alt/rep : 161/446/160 causal constraints (skipped 486 transitions) in 182 ms.
[2024-05-24 19:34:48] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-24 19:34:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2024-05-24 19:34:48] [INFO ] Added : 130 causal constraints over 26 iterations in 2728 ms. Result :sat
Minimization took 574 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 1913/1913 transitions.
Graph (trivial) has 132 edges and 153 vertex of which 17 / 153 are part of one of the 6 SCC in 6 ms
Free SCC test removed 11 places
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Ensure Unique test removed 1038 transitions
Reduce isomorphic transitions removed 1067 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.21 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 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 15 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 15 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 33 place count 125 transition count 825
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 53 place count 105 transition count 576
Iterating global reduction 2 with 20 rules applied. Total rules applied 73 place count 105 transition count 576
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 103 place count 105 transition count 546
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 121 place count 96 transition count 537
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 148 place count 96 transition count 510
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 149 place count 95 transition count 508
Iterating global reduction 4 with 1 rules applied. Total rules applied 150 place count 95 transition count 508
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 166 place count 87 transition count 533
Drop transitions (Empty/Sink Transition effects.) 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 174 place count 87 transition count 525
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 5 with 41 rules applied. Total rules applied 215 place count 87 transition count 484
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 215 place count 87 transition count 479
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 229 place count 78 transition count 479
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 241 place count 72 transition count 473
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 19 edges and 72 vertex of which 2 / 72 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 243 place count 71 transition count 472
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 6 with 197 rules applied. Total rules applied 440 place count 71 transition count 275
Ensure Unique test removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 441 place count 70 transition count 275
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 456 place count 70 transition count 260
Free-agglomeration rule applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 466 place count 70 transition count 250
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 476 place count 60 transition count 250
Applied a total of 476 rules in 445 ms. Remains 60 /153 variables (removed 93) and now considering 250/1913 (removed 1663) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 466 ms. Remains : 60/153 places, 250/1913 transitions.
[2024-05-24 19:34:49] [INFO ] Flow matrix only has 142 transitions (discarded 108 similar events)
// Phase 1: matrix 142 rows 60 cols
[2024-05-24 19:34:49] [INFO ] Computed 17 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1668 ms. (599 steps per ms)
FORMULA EnergyBus-PT-none-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EnergyBus-PT-none-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 643 ms. (1552 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-24 19:34:51] [INFO ] Flatten gal took : 85 ms
[2024-05-24 19:34:51] [INFO ] Flatten gal took : 36 ms
[2024-05-24 19:34:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7431214213971368301.gal : 23 ms
[2024-05-24 19:34:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15049994530247352445.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7431214213971368301.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15049994530247352445.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
ITS tools runner thread asked to quit. Dying gracefully.
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 23287 ms.
BK_STOP 1716579292074
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EnergyBus-PT-none"
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-5568"
echo " Executing tool itstools"
echo " Input is EnergyBus-PT-none, 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 r158-smll-171636266400221"
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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;