Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r043-tajo-167813697300727.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is CANInsertWithFailure-PT-030, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697300727
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 8.3K Feb 26 00:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 00:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 00:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 26 00:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 00:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 00:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.6M 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 CANInsertWithFailure-PT-030-ReachabilityFireability-00
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-01
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-02
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-03
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-04
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-05
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-06
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-07
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-08
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-09
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-10
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-11
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-12
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-13
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-14
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678801824839

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=CANInsertWithFailure-PT-030
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 13:50:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 13:50:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 13:50:26] [INFO ] Load time of PNML (sax parser for PT used): 222 ms
[2023-03-14 13:50:26] [INFO ] Transformed 2164 places.
[2023-03-14 13:50:26] [INFO ] Transformed 5580 transitions.
[2023-03-14 13:50:26] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 314 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 13 resets, run finished after 519 ms. (steps per millisecond=19 ) properties (out of 16) seen :8
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 5580 rows 2164 cols
[2023-03-14 13:50:27] [INFO ] Computed 33 place invariants in 184 ms
[2023-03-14 13:50:28] [INFO ] [Real]Absence check using 31 positive place invariants in 25 ms returned sat
[2023-03-14 13:50:28] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 32 ms returned sat
[2023-03-14 13:50:32] [INFO ] After 4376ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-14 13:50:32] [INFO ] [Nat]Absence check using 31 positive place invariants in 28 ms returned sat
[2023-03-14 13:50:32] [INFO ] [Nat]Absence check using 31 positive and 2 generalized place invariants in 27 ms returned sat
[2023-03-14 13:50:39] [INFO ] After 5923ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-14 13:50:39] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2023-03-14 13:50:47] [INFO ] After 8558ms SMT Verify possible using 1770 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-14 13:50:54] [INFO ] After 15649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 2646 ms.
[2023-03-14 13:50:57] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 189 ms.
Support contains 151 out of 2164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2164/2164 places, 5580/5580 transitions.
Graph (complete) has 7651 edges and 2164 vertex of which 2163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 136 place count 2163 transition count 5445
Reduce places removed 135 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 1 with 164 rules applied. Total rules applied 300 place count 2028 transition count 5416
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 329 place count 1999 transition count 5416
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 329 place count 1999 transition count 5406
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 349 place count 1989 transition count 5406
Performed 803 Post agglomeration using F-continuation condition.Transition count delta: 803
Deduced a syphon composed of 803 places in 2 ms
Reduce places removed 803 places and 0 transitions.
Iterating global reduction 3 with 1606 rules applied. Total rules applied 1955 place count 1186 transition count 4603
Drop transitions removed 756 transitions
Redundant transition composition rules discarded 756 transitions
Iterating global reduction 3 with 756 rules applied. Total rules applied 2711 place count 1186 transition count 3847
Partial Free-agglomeration rule applied 855 times.
Drop transitions removed 855 transitions
Iterating global reduction 3 with 855 rules applied. Total rules applied 3566 place count 1186 transition count 3847
Partial Free-agglomeration rule applied 269 times.
Drop transitions removed 269 transitions
Iterating global reduction 3 with 269 rules applied. Total rules applied 3835 place count 1186 transition count 3847
Applied a total of 3835 rules in 1275 ms. Remains 1186 /2164 variables (removed 978) and now considering 3847/5580 (removed 1733) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1276 ms. Remains : 1186/2164 places, 3847/5580 transitions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 8) seen :4
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 3847 rows 1186 cols
[2023-03-14 13:50:59] [INFO ] Computed 32 place invariants in 90 ms
[2023-03-14 13:50:59] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2023-03-14 13:50:59] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 15 ms returned sat
[2023-03-14 13:51:01] [INFO ] After 1644ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 13:51:01] [INFO ] [Nat]Absence check using 30 positive place invariants in 22 ms returned sat
[2023-03-14 13:51:01] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2023-03-14 13:51:03] [INFO ] After 2062ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 13:51:03] [INFO ] State equation strengthened by 3371 read => feed constraints.
[2023-03-14 13:51:06] [INFO ] After 2563ms SMT Verify possible using 3371 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-14 13:51:07] [INFO ] After 4351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1613 ms.
[2023-03-14 13:51:09] [INFO ] After 8400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 36 ms.
Support contains 110 out of 1186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1186/1186 places, 3847/3847 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1186 transition count 3846
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1185 transition count 3846
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 11 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 36 place count 1168 transition count 3829
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 1168 transition count 3827
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 2 with 28 rules applied. Total rules applied 66 place count 1168 transition count 3799
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 94 place count 1140 transition count 3799
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 114 place count 1140 transition count 3799
Applied a total of 114 rules in 521 ms. Remains 1140 /1186 variables (removed 46) and now considering 3799/3847 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 523 ms. Remains : 1140/1186 places, 3799/3847 transitions.
Incomplete random walk after 10000 steps, including 63 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :1
FORMULA CANInsertWithFailure-PT-030-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3799 rows 1140 cols
[2023-03-14 13:51:10] [INFO ] Computed 32 place invariants in 54 ms
[2023-03-14 13:51:10] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-14 13:51:10] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-14 13:51:11] [INFO ] After 1329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 13:51:12] [INFO ] [Nat]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-14 13:51:12] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2023-03-14 13:51:13] [INFO ] After 1583ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 13:51:13] [INFO ] State equation strengthened by 3421 read => feed constraints.
[2023-03-14 13:51:16] [INFO ] After 2320ms SMT Verify possible using 3421 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 13:51:17] [INFO ] After 3929ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1207 ms.
[2023-03-14 13:51:19] [INFO ] After 7121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 31 ms.
Support contains 104 out of 1140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1140/1140 places, 3799/3799 transitions.
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 0 with 6 rules applied. Total rules applied 6 place count 1137 transition count 3796
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 1137 transition count 3796
Applied a total of 9 rules in 204 ms. Remains 1137 /1140 variables (removed 3) and now considering 3796/3799 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 1137/1140 places, 3796/3799 transitions.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 118882 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118882 steps, saw 29643 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3796 rows 1137 cols
[2023-03-14 13:51:22] [INFO ] Computed 32 place invariants in 59 ms
[2023-03-14 13:51:22] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-14 13:51:22] [INFO ] [Real]Absence check using 30 positive and 2 generalized place invariants in 16 ms returned sat
[2023-03-14 13:51:24] [INFO ] After 1492ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 13:51:24] [INFO ] [Nat]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-14 13:51:24] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 13 ms returned sat
[2023-03-14 13:51:26] [INFO ] After 1485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 13:51:26] [INFO ] State equation strengthened by 3429 read => feed constraints.
[2023-03-14 13:51:28] [INFO ] After 2269ms SMT Verify possible using 3429 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 13:51:29] [INFO ] After 3757ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1266 ms.
[2023-03-14 13:51:31] [INFO ] After 6889ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 20 ms.
Support contains 104 out of 1137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1137/1137 places, 3796/3796 transitions.
Applied a total of 0 rules in 89 ms. Remains 1137 /1137 variables (removed 0) and now considering 3796/3796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 1137/1137 places, 3796/3796 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1137/1137 places, 3796/3796 transitions.
Applied a total of 0 rules in 80 ms. Remains 1137 /1137 variables (removed 0) and now considering 3796/3796 (removed 0) transitions.
[2023-03-14 13:51:31] [INFO ] Invariant cache hit.
[2023-03-14 13:51:32] [INFO ] Implicit Places using invariants in 909 ms returned []
[2023-03-14 13:51:32] [INFO ] Invariant cache hit.
[2023-03-14 13:51:33] [INFO ] State equation strengthened by 3429 read => feed constraints.
[2023-03-14 13:51:49] [INFO ] Implicit Places using invariants and state equation in 17568 ms returned []
Implicit Place search using SMT with State Equation took 18480 ms to find 0 implicit places.
[2023-03-14 13:51:50] [INFO ] Redundant transitions in 224 ms returned []
[2023-03-14 13:51:50] [INFO ] Invariant cache hit.
[2023-03-14 13:51:51] [INFO ] Dead Transitions using invariants and state equation in 1470 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20269 ms. Remains : 1137/1137 places, 3796/3796 transitions.
Graph (trivial) has 2808 edges and 1137 vertex of which 621 / 1137 are part of one of the 2 SCC in 5 ms
Free SCC test removed 619 places
Drop transitions removed 1513 transitions
Ensure Unique test removed 755 transitions
Reduce isomorphic transitions removed 2268 transitions.
Graph (complete) has 1716 edges and 518 vertex of which 508 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 0 output transitions
Discarding 169 places :
Symmetric choice reduction at 0 with 169 rule applications. Total rules 171 place count 339 transition count 1021
Iterating global reduction 0 with 169 rules applied. Total rules applied 340 place count 339 transition count 1021
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 167 transitions.
Iterating post reduction 0 with 167 rules applied. Total rules applied 507 place count 339 transition count 854
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 511 place count 337 transition count 852
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 1 with 55 rules applied. Total rules applied 566 place count 337 transition count 797
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 572 place count 334 transition count 794
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 574 place count 334 transition count 792
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 579 place count 334 transition count 787
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 589 place count 334 transition count 777
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 599 place count 324 transition count 777
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 600 place count 324 transition count 776
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 601 place count 323 transition count 776
Partial Free-agglomeration rule applied 176 times.
Drop transitions removed 176 transitions
Iterating global reduction 4 with 176 rules applied. Total rules applied 777 place count 323 transition count 776
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 778 place count 323 transition count 775
Applied a total of 778 rules in 463 ms. Remains 323 /1137 variables (removed 814) and now considering 775/3796 (removed 3021) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 775 rows 323 cols
[2023-03-14 13:51:52] [INFO ] Computed 22 place invariants in 16 ms
[2023-03-14 13:51:52] [INFO ] [Real]Absence check using 22 positive place invariants in 7 ms returned sat
[2023-03-14 13:51:52] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 13:51:52] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2023-03-14 13:51:52] [INFO ] After 400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 13:51:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 13:51:52] [INFO ] After 291ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 13:51:53] [INFO ] After 555ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 249 ms.
[2023-03-14 13:51:53] [INFO ] After 1283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-14 13:51:53] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-14 13:51:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1137 places, 3796 transitions and 14776 arcs took 26 ms.
[2023-03-14 13:51:53] [INFO ] Flatten gal took : 225 ms
Total runtime 87384 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CANInsertWithFailure (PT), instance 030
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: 1137 places, 3796 transitions, 14776 arcs.
Final Score: 606838.013
Took : 33 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678801948158

--------------------
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 19747:
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="CANInsertWithFailure-PT-030"
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 CANInsertWithFailure-PT-030, 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 r043-tajo-167813697300727"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-030.tgz
mv CANInsertWithFailure-PT-030 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 ;