fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r171-tall-167838858100135
Last Updated
May 14, 2023

About the Execution of Smart+red for EnergyBus-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
845.252 101552.00 125656.00 392.80 ?F?TTFTTTTFFFFT? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r171-tall-167838858100135.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is EnergyBus-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838858100135
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 6.7K Feb 26 15:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 15:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 15:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 15:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 15:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.2M Mar 5 18:22 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-ReachabilityFireability-00
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-01
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-02
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-03
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-04
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-05
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-06
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-07
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-08
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-09
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-10
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-11
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-12
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-13
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-14
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679430449922

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EnergyBus-PT-none
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 20:27:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 20:27:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 20:27:31] [INFO ] Load time of PNML (sax parser for PT used): 314 ms
[2023-03-21 20:27:31] [INFO ] Transformed 157 places.
[2023-03-21 20:27:31] [INFO ] Transformed 4430 transitions.
[2023-03-21 20:27:31] [INFO ] Found NUPN structural information;
[2023-03-21 20:27:31] [INFO ] Parsed PT model containing 157 places and 4430 transitions and 63389 arcs in 572 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 25 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-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EnergyBus-PT-none-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 660 ms. (steps per millisecond=15 ) properties (out of 10) seen :3
FORMULA EnergyBus-PT-none-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EnergyBus-PT-none-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-21 20:27:33] [INFO ] Flow matrix only has 647 transitions (discarded 1266 similar events)
// Phase 1: matrix 647 rows 153 cols
[2023-03-21 20:27:33] [INFO ] Computed 23 place invariants in 19 ms
[2023-03-21 20:27:33] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-21 20:27:33] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 20:27:33] [INFO ] After 587ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 20:27:34] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-21 20:27:34] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 20:27:34] [INFO ] After 592ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2023-03-21 20:27:34] [INFO ] State equation strengthened by 463 read => feed constraints.
[2023-03-21 20:27:35] [INFO ] After 514ms SMT Verify possible using 463 Read/Feed constraints in natural domain returned unsat :3 sat :4
[2023-03-21 20:27:35] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 8 ms to minimize.
[2023-03-21 20:27:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-03-21 20:27:35] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2023-03-21 20:27:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-21 20:27:36] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2023-03-21 20:27:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-21 20:27:36] [INFO ] After 1352ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 485 ms.
[2023-03-21 20:27:36] [INFO ] After 2566ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
FORMULA EnergyBus-PT-none-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EnergyBus-PT-none-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EnergyBus-PT-none-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 172 ms.
Support contains 30 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 1913/1913 transitions.
Graph (trivial) has 86 edges and 153 vertex of which 13 / 153 are part of one of the 4 SCC in 3 ms
Free SCC test removed 9 places
Drop transitions removed 25 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 31 transitions.
Graph (complete) has 793 edges and 144 vertex of which 140 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.17 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 140 transition count 1874
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 137 transition count 1872
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 12 place count 137 transition count 1865
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 26 place count 130 transition count 1865
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 41 place count 115 transition count 1837
Iterating global reduction 2 with 15 rules applied. Total rules applied 56 place count 115 transition count 1837
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 2 with 14 rules applied. Total rules applied 70 place count 108 transition count 1830
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 108 transition count 1828
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 107 transition count 1826
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 107 transition count 1826
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 84 place count 102 transition count 1835
Drop transitions removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 92 place count 102 transition count 1827
Drop transitions removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 4 with 85 rules applied. Total rules applied 177 place count 102 transition count 1742
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 181 place count 100 transition count 1740
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 183 place count 98 transition count 1740
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 183 place count 98 transition count 1736
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 191 place count 94 transition count 1736
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 197 place count 91 transition count 1733
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 201 place count 91 transition count 1729
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 206 place count 87 transition count 1728
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 207 place count 87 transition count 1727
Applied a total of 207 rules in 1285 ms. Remains 87 /153 variables (removed 66) and now considering 1727/1913 (removed 186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1286 ms. Remains : 87/153 places, 1727/1913 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 4) seen :1
FORMULA EnergyBus-PT-none-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-21 20:27:38] [INFO ] Flow matrix only has 520 transitions (discarded 1207 similar events)
// Phase 1: matrix 520 rows 87 cols
[2023-03-21 20:27:38] [INFO ] Computed 20 place invariants in 10 ms
[2023-03-21 20:27:38] [INFO ] [Real]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-03-21 20:27:38] [INFO ] [Real]Absence check using 19 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 20:27:38] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 20:27:38] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-21 20:27:38] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 8 ms returned sat
[2023-03-21 20:27:39] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 20:27:39] [INFO ] State equation strengthened by 458 read => feed constraints.
[2023-03-21 20:27:39] [INFO ] After 280ms SMT Verify possible using 458 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 20:27:39] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
[2023-03-21 20:27:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-21 20:27:39] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2023-03-21 20:27:40] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2023-03-21 20:27:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 375 ms
[2023-03-21 20:27:40] [INFO ] After 966ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 204 ms.
[2023-03-21 20:27:40] [INFO ] After 1609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 41 ms.
Support contains 21 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 1727/1727 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 85 transition count 1471
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 85 transition count 1471
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 0 with 2 rules applied. Total rules applied 6 place count 84 transition count 1470
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 84 transition count 1465
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 16 place count 79 transition count 1465
Applied a total of 16 rules in 397 ms. Remains 79 /87 variables (removed 8) and now considering 1465/1727 (removed 262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 398 ms. Remains : 79/87 places, 1465/1727 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 270252 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 270252 steps, saw 164696 distinct states, run finished after 3002 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-21 20:27:44] [INFO ] Flow matrix only has 385 transitions (discarded 1080 similar events)
// Phase 1: matrix 385 rows 79 cols
[2023-03-21 20:27:44] [INFO ] Computed 20 place invariants in 7 ms
[2023-03-21 20:27:44] [INFO ] [Real]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-03-21 20:27:44] [INFO ] [Real]Absence check using 19 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 20:27:44] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 20:27:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-03-21 20:27:44] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 20:27:44] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 20:27:44] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-21 20:27:45] [INFO ] After 229ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 20:27:45] [INFO ] After 472ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 185 ms.
[2023-03-21 20:27:45] [INFO ] After 986ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 39 ms.
Support contains 21 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 1465/1465 transitions.
Applied a total of 0 rules in 157 ms. Remains 79 /79 variables (removed 0) and now considering 1465/1465 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 79/79 places, 1465/1465 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 1465/1465 transitions.
Applied a total of 0 rules in 163 ms. Remains 79 /79 variables (removed 0) and now considering 1465/1465 (removed 0) transitions.
[2023-03-21 20:27:45] [INFO ] Flow matrix only has 385 transitions (discarded 1080 similar events)
[2023-03-21 20:27:45] [INFO ] Invariant cache hit.
[2023-03-21 20:27:45] [INFO ] Implicit Places using invariants in 94 ms returned [5, 64]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 98 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 77/79 places, 1465/1465 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 77 transition count 1464
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 1464
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 0 with 2 rules applied. Total rules applied 4 place count 75 transition count 1463
Drop transitions removed 97 transitions
Redundant transition composition rules discarded 97 transitions
Iterating global reduction 0 with 97 rules applied. Total rules applied 101 place count 75 transition count 1366
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 75 transition count 1365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 103 place count 74 transition count 1365
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 74 transition count 1365
Applied a total of 105 rules in 595 ms. Remains 74 /77 variables (removed 3) and now considering 1365/1465 (removed 100) transitions.
[2023-03-21 20:27:46] [INFO ] Flow matrix only has 357 transitions (discarded 1008 similar events)
// Phase 1: matrix 357 rows 74 cols
[2023-03-21 20:27:46] [INFO ] Computed 18 place invariants in 5 ms
[2023-03-21 20:27:46] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-21 20:27:46] [INFO ] Flow matrix only has 357 transitions (discarded 1008 similar events)
[2023-03-21 20:27:46] [INFO ] Invariant cache hit.
[2023-03-21 20:27:46] [INFO ] State equation strengthened by 296 read => feed constraints.
[2023-03-21 20:27:46] [INFO ] Implicit Places using invariants and state equation in 387 ms returned [13, 56]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 491 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 72/79 places, 1365/1465 transitions.
Applied a total of 0 rules in 137 ms. Remains 72 /72 variables (removed 0) and now considering 1365/1365 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1484 ms. Remains : 72/79 places, 1365/1465 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 326762 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 326762 steps, saw 180228 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-21 20:27:50] [INFO ] Flow matrix only has 357 transitions (discarded 1008 similar events)
// Phase 1: matrix 357 rows 72 cols
[2023-03-21 20:27:50] [INFO ] Computed 16 place invariants in 5 ms
[2023-03-21 20:27:50] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-21 20:27:50] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-21 20:27:50] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 20:27:50] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-21 20:27:50] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 20:27:50] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 20:27:50] [INFO ] State equation strengthened by 296 read => feed constraints.
[2023-03-21 20:27:51] [INFO ] After 184ms SMT Verify possible using 296 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 20:27:51] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2023-03-21 20:27:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-21 20:27:51] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2023-03-21 20:27:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-21 20:27:51] [INFO ] After 508ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 160 ms.
[2023-03-21 20:27:51] [INFO ] After 962ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 29 ms.
Support contains 21 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 1365/1365 transitions.
Applied a total of 0 rules in 136 ms. Remains 72 /72 variables (removed 0) and now considering 1365/1365 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 72/72 places, 1365/1365 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 1365/1365 transitions.
Applied a total of 0 rules in 151 ms. Remains 72 /72 variables (removed 0) and now considering 1365/1365 (removed 0) transitions.
[2023-03-21 20:27:51] [INFO ] Flow matrix only has 357 transitions (discarded 1008 similar events)
[2023-03-21 20:27:51] [INFO ] Invariant cache hit.
[2023-03-21 20:27:52] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-21 20:27:52] [INFO ] Flow matrix only has 357 transitions (discarded 1008 similar events)
[2023-03-21 20:27:52] [INFO ] Invariant cache hit.
[2023-03-21 20:27:52] [INFO ] State equation strengthened by 296 read => feed constraints.
[2023-03-21 20:27:52] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2023-03-21 20:27:52] [INFO ] Redundant transitions in 301 ms returned []
[2023-03-21 20:27:52] [INFO ] Flow matrix only has 357 transitions (discarded 1008 similar events)
[2023-03-21 20:27:52] [INFO ] Invariant cache hit.
[2023-03-21 20:27:53] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1291 ms. Remains : 72/72 places, 1365/1365 transitions.
Graph (trivial) has 16 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
Drop transitions removed 2 transitions
Ensure Unique test removed 1008 transitions
Reduce isomorphic transitions removed 1010 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 71 transition count 352
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 7 place count 68 transition count 352
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 68 transition count 351
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 67 transition count 350
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 67 transition count 350
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 67 transition count 350
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 67 transition count 349
Applied a total of 17 rules in 50 ms. Remains 67 /72 variables (removed 5) and now considering 349/1365 (removed 1016) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 349 rows 67 cols
[2023-03-21 20:27:53] [INFO ] Computed 16 place invariants in 6 ms
[2023-03-21 20:27:53] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-21 20:27:53] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 20:27:53] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 20:27:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-21 20:27:53] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 20:27:53] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 20:27:53] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-21 20:27:53] [INFO ] After 100ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 20:27:53] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-21 20:27:53] [INFO ] After 520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-21 20:27:53] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2023-03-21 20:27:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 72 places, 1365 transitions and 20797 arcs took 19 ms.
[2023-03-21 20:27:54] [INFO ] Flatten gal took : 222 ms
Total runtime 23052 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running EnergyBus (PT), instance none
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 72 places, 1365 transitions, 20797 arcs.
Final Score: 7756.366
Took : 75 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679430551474

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 22241:
syntax error

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="ReachabilityFireability"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is EnergyBus-PT-none, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r171-tall-167838858100135"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;