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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.8K Feb 26 00:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 00:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 00:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 19K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 01:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 00:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 00:59 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 16M 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-050-ReachabilityFireability-00
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-01
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-02
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-03
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-04
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-05
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-06
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-07
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-08
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-09
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-10
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-11
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-12
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-13
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-14
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678803034183

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-050
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 14:10:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 14:10:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 14:10:36] [INFO ] Load time of PNML (sax parser for PT used): 419 ms
[2023-03-14 14:10:36] [INFO ] Transformed 5604 places.
[2023-03-14 14:10:36] [INFO ] Transformed 15300 transitions.
[2023-03-14 14:10:36] [INFO ] Parsed PT model containing 5604 places and 15300 transitions and 41000 arcs in 581 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 610 ms. (steps per millisecond=16 ) properties (out of 16) seen :4
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) 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 12) 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 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 15300 rows 5604 cols
[2023-03-14 14:10:38] [INFO ] Computed 53 place invariants in 1111 ms
[2023-03-14 14:10:41] [INFO ] [Real]Absence check using 51 positive place invariants in 83 ms returned sat
[2023-03-14 14:10:41] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 97 ms returned sat
[2023-03-14 14:10:41] [INFO ] After 2265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-14 14:10:43] [INFO ] [Nat]Absence check using 51 positive place invariants in 103 ms returned sat
[2023-03-14 14:10:43] [INFO ] [Nat]Absence check using 51 positive and 2 generalized place invariants in 96 ms returned sat
[2023-03-14 14:11:06] [INFO ] After 21506ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-14 14:11:06] [INFO ] State equation strengthened by 4950 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 14:11:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 14:11:06] [INFO ] After 25196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 521 ms.
Support contains 195 out of 5604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5604/5604 places, 15300/15300 transitions.
Graph (complete) has 20751 edges and 5604 vertex of which 5603 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.53 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 267 transitions
Trivial Post-agglo rules discarded 267 transitions
Performed 267 trivial Post agglomeration. Transition count delta: 267
Iterating post reduction 0 with 267 rules applied. Total rules applied 268 place count 5603 transition count 15033
Reduce places removed 267 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 272 rules applied. Total rules applied 540 place count 5336 transition count 15028
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 545 place count 5331 transition count 15028
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 545 place count 5331 transition count 15007
Deduced a syphon composed of 21 places in 16 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 587 place count 5310 transition count 15007
Performed 2348 Post agglomeration using F-continuation condition.Transition count delta: 2348
Deduced a syphon composed of 2348 places in 12 ms
Reduce places removed 2348 places and 0 transitions.
Iterating global reduction 3 with 4696 rules applied. Total rules applied 5283 place count 2962 transition count 12659
Drop transitions removed 2275 transitions
Redundant transition composition rules discarded 2275 transitions
Iterating global reduction 3 with 2275 rules applied. Total rules applied 7558 place count 2962 transition count 10384
Free-agglomeration rule (complex) applied 49 times.
Iterating global reduction 3 with 49 rules applied. Total rules applied 7607 place count 2962 transition count 10335
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 3 with 49 rules applied. Total rules applied 7656 place count 2913 transition count 10335
Partial Free-agglomeration rule applied 2468 times.
Drop transitions removed 2468 transitions
Iterating global reduction 4 with 2468 rules applied. Total rules applied 10124 place count 2913 transition count 10335
Partial Free-agglomeration rule applied 1077 times.
Drop transitions removed 1077 transitions
Iterating global reduction 4 with 1077 rules applied. Total rules applied 11201 place count 2913 transition count 10335
Applied a total of 11201 rules in 5075 ms. Remains 2913 /5604 variables (removed 2691) and now considering 10335/15300 (removed 4965) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5078 ms. Remains : 2913/5604 places, 10335/15300 transitions.
Incomplete random walk after 10000 steps, including 38 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 12) seen :8
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 10335 rows 2913 cols
[2023-03-14 14:11:13] [INFO ] Computed 52 place invariants in 388 ms
[2023-03-14 14:11:13] [INFO ] [Real]Absence check using 50 positive place invariants in 56 ms returned sat
[2023-03-14 14:11:13] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 47 ms returned sat
[2023-03-14 14:11:13] [INFO ] After 795ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 14:11:14] [INFO ] [Nat]Absence check using 50 positive place invariants in 25 ms returned sat
[2023-03-14 14:11:14] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2023-03-14 14:11:21] [INFO ] After 7297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 14:11:22] [INFO ] State equation strengthened by 9577 read => feed constraints.
[2023-03-14 14:11:32] [INFO ] After 10118ms SMT Verify possible using 9577 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-14 14:11:37] [INFO ] After 15034ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1892 ms.
[2023-03-14 14:11:38] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 11 ms.
Support contains 97 out of 2913 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2913/2913 places, 10335/10335 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2913 transition count 10333
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2911 transition count 10333
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 4 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 0 with 118 rules applied. Total rules applied 122 place count 2852 transition count 10274
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 123 place count 2852 transition count 10273
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 2852 transition count 10272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 125 place count 2851 transition count 10272
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 127 place count 2851 transition count 10270
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 129 place count 2849 transition count 10270
Partial Free-agglomeration rule applied 122 times.
Drop transitions removed 122 transitions
Iterating global reduction 2 with 122 rules applied. Total rules applied 251 place count 2849 transition count 10270
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 253 place count 2849 transition count 10270
Applied a total of 253 rules in 3113 ms. Remains 2849 /2913 variables (removed 64) and now considering 10270/10335 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3113 ms. Remains : 2849/2913 places, 10270/10335 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 4) seen :1
FORMULA CANInsertWithFailure-PT-050-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 10270 rows 2849 cols
[2023-03-14 14:11:43] [INFO ] Computed 52 place invariants in 574 ms
[2023-03-14 14:11:43] [INFO ] [Real]Absence check using 50 positive place invariants in 35 ms returned sat
[2023-03-14 14:11:43] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 43 ms returned sat
[2023-03-14 14:11:43] [INFO ] After 723ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 14:11:44] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2023-03-14 14:11:44] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 43 ms returned sat
[2023-03-14 14:11:49] [INFO ] After 5360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 14:11:50] [INFO ] State equation strengthened by 9839 read => feed constraints.
[2023-03-14 14:12:00] [INFO ] After 10504ms SMT Verify possible using 9839 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 14:12:05] [INFO ] After 15417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3121 ms.
[2023-03-14 14:12:08] [INFO ] After 24747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 145 ms.
Support contains 96 out of 2849 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2849/2849 places, 10270/10270 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2849 transition count 10270
Applied a total of 1 rules in 897 ms. Remains 2849 /2849 variables (removed 0) and now considering 10270/10270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 897 ms. Remains : 2849/2849 places, 10270/10270 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 324 ms. (steps per millisecond=30 ) 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 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 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 59735 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59735 steps, saw 34299 distinct states, run finished after 3006 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 10270 rows 2849 cols
[2023-03-14 14:12:13] [INFO ] Computed 52 place invariants in 341 ms
[2023-03-14 14:12:14] [INFO ] [Real]Absence check using 50 positive place invariants in 31 ms returned sat
[2023-03-14 14:12:14] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 40 ms returned sat
[2023-03-14 14:12:14] [INFO ] After 607ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 14:12:14] [INFO ] [Nat]Absence check using 50 positive place invariants in 29 ms returned sat
[2023-03-14 14:12:14] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 38 ms returned sat
[2023-03-14 14:12:20] [INFO ] After 6006ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 14:12:20] [INFO ] State equation strengthened by 9840 read => feed constraints.
[2023-03-14 14:12:31] [INFO ] After 10408ms SMT Verify possible using 9840 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 14:12:35] [INFO ] After 14677ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2730 ms.
[2023-03-14 14:12:38] [INFO ] After 24099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 123 ms.
Support contains 96 out of 2849 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2849/2849 places, 10270/10270 transitions.
Applied a total of 0 rules in 395 ms. Remains 2849 /2849 variables (removed 0) and now considering 10270/10270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 395 ms. Remains : 2849/2849 places, 10270/10270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2849/2849 places, 10270/10270 transitions.
Applied a total of 0 rules in 436 ms. Remains 2849 /2849 variables (removed 0) and now considering 10270/10270 (removed 0) transitions.
[2023-03-14 14:12:39] [INFO ] Invariant cache hit.
[2023-03-14 14:12:42] [INFO ] Implicit Places using invariants in 3209 ms returned []
Implicit Place search using SMT only with invariants took 3210 ms to find 0 implicit places.
[2023-03-14 14:12:42] [INFO ] Invariant cache hit.
[2023-03-14 14:12:47] [INFO ] Dead Transitions using invariants and state equation in 4660 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8316 ms. Remains : 2849/2849 places, 10270/10270 transitions.
Graph (trivial) has 8437 edges and 2849 vertex of which 1871 / 2849 are part of one of the 2 SCC in 7 ms
Free SCC test removed 1869 places
Drop transitions removed 4831 transitions
Ensure Unique test removed 2276 transitions
Reduce isomorphic transitions removed 7107 transitions.
Graph (complete) has 3465 edges and 980 vertex of which 951 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 ms
Discarding 29 places :
Also discarding 0 output transitions
Discarding 461 places :
Symmetric choice reduction at 0 with 461 rule applications. Total rules 463 place count 490 transition count 1779
Iterating global reduction 0 with 461 rules applied. Total rules applied 924 place count 490 transition count 1779
Ensure Unique test removed 461 transitions
Reduce isomorphic transitions removed 461 transitions.
Iterating post reduction 0 with 461 rules applied. Total rules applied 1385 place count 490 transition count 1318
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1387 place count 489 transition count 1317
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 1 with 64 rules applied. Total rules applied 1451 place count 489 transition count 1253
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1455 place count 485 transition count 1241
Iterating global reduction 1 with 4 rules applied. Total rules applied 1459 place count 485 transition count 1241
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1463 place count 485 transition count 1237
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 1471 place count 481 transition count 1233
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 1481 place count 481 transition count 1223
Free-agglomeration rule applied 34 times.
Iterating global reduction 2 with 34 rules applied. Total rules applied 1515 place count 481 transition count 1189
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 59 rules applied. Total rules applied 1574 place count 447 transition count 1164
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1580 place count 441 transition count 1158
Iterating global reduction 3 with 6 rules applied. Total rules applied 1586 place count 441 transition count 1158
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1592 place count 435 transition count 1146
Iterating global reduction 3 with 6 rules applied. Total rules applied 1598 place count 435 transition count 1146
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 1605 place count 435 transition count 1139
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1607 place count 435 transition count 1137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1609 place count 433 transition count 1137
Partial Free-agglomeration rule applied 341 times.
Drop transitions removed 341 transitions
Iterating global reduction 4 with 341 rules applied. Total rules applied 1950 place count 433 transition count 1137
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 1955 place count 433 transition count 1132
Applied a total of 1955 rules in 1690 ms. Remains 433 /2849 variables (removed 2416) and now considering 1132/10270 (removed 9138) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1132 rows 433 cols
[2023-03-14 14:12:48] [INFO ] Computed 23 place invariants in 11 ms
[2023-03-14 14:12:48] [INFO ] [Real]Absence check using 23 positive place invariants in 5 ms returned sat
[2023-03-14 14:12:48] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 14:12:49] [INFO ] [Nat]Absence check using 23 positive place invariants in 7 ms returned sat
[2023-03-14 14:12:49] [INFO ] After 534ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 14:12:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 14:12:49] [INFO ] After 367ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 14:12:50] [INFO ] After 780ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 270 ms.
[2023-03-14 14:12:50] [INFO ] After 1720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-14 14:12:50] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-14 14:12:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2849 places, 10270 transitions and 40715 arcs took 59 ms.
[2023-03-14 14:12:51] [INFO ] Flatten gal took : 605 ms
Total runtime 135725 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CANInsertWithFailure (PT), instance 050
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: 2849 places, 10270 transitions, 40715 arcs.
Final Score: 7098273.23
Took : 113 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678803286504

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
++ sed s/.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 53892:
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-050"
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-050, 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-167813697300743"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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