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-167813697300735.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-040, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697300735
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 9.3K Feb 26 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 00:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 01:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 01:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:11 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 9.8M 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-040-ReachabilityFireability-00
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-01
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-02
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-03
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-04
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-05
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-06
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-07
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-08
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-09
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-10
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-11
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-12
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-13
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-14
FORMULA_NAME CANInsertWithFailure-PT-040-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678802230220

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-040
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 13:57:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 13:57:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 13:57:12] [INFO ] Load time of PNML (sax parser for PT used): 327 ms
[2023-03-14 13:57:12] [INFO ] Transformed 3684 places.
[2023-03-14 13:57:12] [INFO ] Transformed 9840 transitions.
[2023-03-14 13:57:12] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 444 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 10 resets, run finished after 573 ms. (steps per millisecond=17 ) properties (out of 16) seen :6
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) 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 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 9840 rows 3684 cols
[2023-03-14 13:57:13] [INFO ] Computed 43 place invariants in 489 ms
[2023-03-14 13:57:15] [INFO ] [Real]Absence check using 41 positive place invariants in 42 ms returned sat
[2023-03-14 13:57:15] [INFO ] [Real]Absence check using 41 positive and 2 generalized place invariants in 41 ms returned sat
[2023-03-14 13:57:15] [INFO ] After 1348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-14 13:57:16] [INFO ] [Nat]Absence check using 41 positive place invariants in 51 ms returned sat
[2023-03-14 13:57:16] [INFO ] [Nat]Absence check using 41 positive and 2 generalized place invariants in 52 ms returned sat
[2023-03-14 13:57:29] [INFO ] After 12136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-14 13:57:29] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-14 13:57:40] [INFO ] After 11021ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-14 13:57:40] [INFO ] After 11022ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-14 13:57:40] [INFO ] After 25060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 1099 ms.
Support contains 145 out of 3684 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3684/3684 places, 9840/9840 transitions.
Graph (complete) has 13401 edges and 3684 vertex of which 3683 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 179 transitions
Trivial Post-agglo rules discarded 179 transitions
Performed 179 trivial Post agglomeration. Transition count delta: 179
Iterating post reduction 0 with 179 rules applied. Total rules applied 180 place count 3683 transition count 9661
Reduce places removed 179 places and 0 transitions.
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Iterating post reduction 1 with 220 rules applied. Total rules applied 400 place count 3504 transition count 9620
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 441 place count 3463 transition count 9620
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 441 place count 3463 transition count 9604
Deduced a syphon composed of 16 places in 5 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 473 place count 3447 transition count 9604
Performed 1487 Post agglomeration using F-continuation condition.Transition count delta: 1487
Deduced a syphon composed of 1487 places in 7 ms
Reduce places removed 1487 places and 0 transitions.
Iterating global reduction 3 with 2974 rules applied. Total rules applied 3447 place count 1960 transition count 8117
Drop transitions removed 1427 transitions
Redundant transition composition rules discarded 1427 transitions
Iterating global reduction 3 with 1427 rules applied. Total rules applied 4874 place count 1960 transition count 6690
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4875 place count 1960 transition count 6689
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4876 place count 1959 transition count 6689
Partial Free-agglomeration rule applied 1574 times.
Drop transitions removed 1574 transitions
Iterating global reduction 4 with 1574 rules applied. Total rules applied 6450 place count 1959 transition count 6689
Partial Free-agglomeration rule applied 630 times.
Drop transitions removed 630 transitions
Iterating global reduction 4 with 630 rules applied. Total rules applied 7080 place count 1959 transition count 6689
Applied a total of 7080 rules in 2798 ms. Remains 1959 /3684 variables (removed 1725) and now considering 6689/9840 (removed 3151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2801 ms. Remains : 1959/3684 places, 6689/9840 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 10) seen :4
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-06 FALSE 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 6689 rows 1959 cols
[2023-03-14 13:57:45] [INFO ] Computed 42 place invariants in 243 ms
[2023-03-14 13:57:45] [INFO ] [Real]Absence check using 40 positive place invariants in 24 ms returned sat
[2023-03-14 13:57:45] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 45 ms returned sat
[2023-03-14 13:57:45] [INFO ] After 515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 13:57:46] [INFO ] [Nat]Absence check using 40 positive place invariants in 38 ms returned sat
[2023-03-14 13:57:46] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 35 ms returned sat
[2023-03-14 13:57:50] [INFO ] After 3895ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-14 13:57:50] [INFO ] State equation strengthened by 6184 read => feed constraints.
[2023-03-14 13:57:54] [INFO ] After 4355ms SMT Verify possible using 6184 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-14 13:57:57] [INFO ] After 7202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2098 ms.
[2023-03-14 13:57:59] [INFO ] After 14001ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA CANInsertWithFailure-PT-040-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 90 ms.
Support contains 100 out of 1959 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1959/1959 places, 6689/6689 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1959 transition count 6687
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1957 transition count 6687
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 50 place count 1934 transition count 6664
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 61 place count 1934 transition count 6664
Applied a total of 61 rules in 643 ms. Remains 1934 /1959 variables (removed 25) and now considering 6664/6689 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 643 ms. Remains : 1934/1959 places, 6664/6689 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 75321 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75321 steps, saw 29228 distinct states, run finished after 3003 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 6664 rows 1934 cols
[2023-03-14 13:58:04] [INFO ] Computed 42 place invariants in 178 ms
[2023-03-14 13:58:04] [INFO ] [Real]Absence check using 40 positive place invariants in 22 ms returned sat
[2023-03-14 13:58:04] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 25 ms returned sat
[2023-03-14 13:58:04] [INFO ] After 437ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 13:58:04] [INFO ] [Nat]Absence check using 40 positive place invariants in 24 ms returned sat
[2023-03-14 13:58:04] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 25 ms returned sat
[2023-03-14 13:58:07] [INFO ] After 2929ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-14 13:58:07] [INFO ] State equation strengthened by 6228 read => feed constraints.
[2023-03-14 13:58:12] [INFO ] After 4297ms SMT Verify possible using 6228 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-14 13:58:14] [INFO ] After 6728ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1917 ms.
[2023-03-14 13:58:16] [INFO ] After 12075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 90 ms.
Support contains 100 out of 1934 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1934/1934 places, 6664/6664 transitions.
Applied a total of 0 rules in 246 ms. Remains 1934 /1934 variables (removed 0) and now considering 6664/6664 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 1934/1934 places, 6664/6664 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1934/1934 places, 6664/6664 transitions.
Applied a total of 0 rules in 207 ms. Remains 1934 /1934 variables (removed 0) and now considering 6664/6664 (removed 0) transitions.
[2023-03-14 13:58:17] [INFO ] Invariant cache hit.
[2023-03-14 13:58:18] [INFO ] Implicit Places using invariants in 1848 ms returned []
[2023-03-14 13:58:18] [INFO ] Invariant cache hit.
[2023-03-14 13:58:19] [INFO ] State equation strengthened by 6228 read => feed constraints.
[2023-03-14 13:58:32] [INFO ] Implicit Places using invariants and state equation in 13811 ms returned []
Implicit Place search using SMT with State Equation took 15661 ms to find 0 implicit places.
[2023-03-14 13:58:33] [INFO ] Redundant transitions in 632 ms returned []
[2023-03-14 13:58:33] [INFO ] Invariant cache hit.
[2023-03-14 13:58:36] [INFO ] Dead Transitions using invariants and state equation in 3422 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19937 ms. Remains : 1934/1934 places, 6664/6664 transitions.
Graph (trivial) has 5315 edges and 1934 vertex of which 1206 / 1934 are part of one of the 2 SCC in 8 ms
Free SCC test removed 1204 places
Drop transitions removed 3067 transitions
Ensure Unique test removed 1447 transitions
Reduce isomorphic transitions removed 4514 transitions.
Graph (complete) has 2394 edges and 730 vertex of which 705 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 0 output transitions
Discarding 298 places :
Symmetric choice reduction at 0 with 298 rule applications. Total rules 300 place count 407 transition count 1302
Iterating global reduction 0 with 298 rules applied. Total rules applied 598 place count 407 transition count 1302
Ensure Unique test removed 275 transitions
Reduce isomorphic transitions removed 275 transitions.
Iterating post reduction 0 with 275 rules applied. Total rules applied 873 place count 407 transition count 1027
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 1 with 2 rules applied. Total rules applied 875 place count 406 transition count 1026
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 1 with 58 rules applied. Total rules applied 933 place count 406 transition count 968
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 934 place count 405 transition count 965
Iterating global reduction 1 with 1 rules applied. Total rules applied 935 place count 405 transition count 965
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 936 place count 405 transition count 964
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 944 place count 401 transition count 960
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 955 place count 401 transition count 949
Free-agglomeration rule applied 29 times.
Iterating global reduction 2 with 29 rules applied. Total rules applied 984 place count 401 transition count 920
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 2 with 51 rules applied. Total rules applied 1035 place count 372 transition count 898
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1039 place count 368 transition count 894
Iterating global reduction 3 with 4 rules applied. Total rules applied 1043 place count 368 transition count 894
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1046 place count 365 transition count 888
Iterating global reduction 3 with 3 rules applied. Total rules applied 1049 place count 365 transition count 888
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 1052 place count 365 transition count 885
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1053 place count 365 transition count 884
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1054 place count 364 transition count 884
Partial Free-agglomeration rule applied 213 times.
Drop transitions removed 213 transitions
Iterating global reduction 4 with 213 rules applied. Total rules applied 1267 place count 364 transition count 884
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1270 place count 364 transition count 881
Applied a total of 1270 rules in 900 ms. Remains 364 /1934 variables (removed 1570) and now considering 881/6664 (removed 5783) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 881 rows 364 cols
[2023-03-14 13:58:37] [INFO ] Computed 17 place invariants in 17 ms
[2023-03-14 13:58:37] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-14 13:58:37] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 13:58:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-14 13:58:38] [INFO ] After 301ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-14 13:58:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 13:58:38] [INFO ] After 195ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-14 13:58:38] [INFO ] After 454ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 191 ms.
[2023-03-14 13:58:38] [INFO ] After 1066ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-14 13:58:39] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-14 13:58:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1934 places, 6664 transitions and 26178 arcs took 42 ms.
[2023-03-14 13:58:39] [INFO ] Flatten gal took : 418 ms
Total runtime 87961 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CANInsertWithFailure (PT), instance 040
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: 1934 places, 6664 transitions, 26178 arcs.
Final Score: 2288156.611
Took : 58 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678802378725

--------------------
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 34824:
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-040"
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-040, 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-167813697300735"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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