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-167813697300742.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697300742
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-050-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678802840278

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=ReachabilityCardinality
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:07:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 14:07:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 14:07:22] [INFO ] Load time of PNML (sax parser for PT used): 412 ms
[2023-03-14 14:07:22] [INFO ] Transformed 5604 places.
[2023-03-14 14:07:22] [INFO ] Transformed 15300 transitions.
[2023-03-14 14:07:22] [INFO ] Parsed PT model containing 5604 places and 15300 transitions and 41000 arcs in 540 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 626 ms. (steps per millisecond=15 ) properties (out of 16) seen :3
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) 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 13) 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 13) 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 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) 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 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 15300 rows 5604 cols
[2023-03-14 14:07:24] [INFO ] Computed 53 place invariants in 1097 ms
[2023-03-14 14:07:26] [INFO ] After 1973ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-14 14:07:29] [INFO ] [Nat]Absence check using 51 positive place invariants in 123 ms returned sat
[2023-03-14 14:07:29] [INFO ] [Nat]Absence check using 51 positive and 2 generalized place invariants in 97 ms returned sat
[2023-03-14 14:07:52] [INFO ] After 21430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-14 14:07:52] [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:07:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 14:07:52] [INFO ] After 25204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 287 ms.
Support contains 219 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.20 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 320 transitions
Trivial Post-agglo rules discarded 320 transitions
Performed 320 trivial Post agglomeration. Transition count delta: 320
Iterating post reduction 0 with 320 rules applied. Total rules applied 321 place count 5603 transition count 14980
Reduce places removed 320 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 329 rules applied. Total rules applied 650 place count 5283 transition count 14971
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 659 place count 5274 transition count 14971
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 659 place count 5274 transition count 14966
Deduced a syphon composed of 5 places in 9 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 669 place count 5269 transition count 14966
Performed 2222 Post agglomeration using F-continuation condition.Transition count delta: 2222
Deduced a syphon composed of 2222 places in 21 ms
Reduce places removed 2222 places and 0 transitions.
Iterating global reduction 3 with 4444 rules applied. Total rules applied 5113 place count 3047 transition count 12744
Drop transitions removed 2135 transitions
Redundant transition composition rules discarded 2135 transitions
Iterating global reduction 3 with 2135 rules applied. Total rules applied 7248 place count 3047 transition count 10609
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 7256 place count 3047 transition count 10601
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 7264 place count 3039 transition count 10601
Partial Free-agglomeration rule applied 2665 times.
Drop transitions removed 2665 transitions
Iterating global reduction 4 with 2665 rules applied. Total rules applied 9929 place count 3039 transition count 10601
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 4 with 200 rules applied. Total rules applied 10129 place count 3039 transition count 10601
Applied a total of 10129 rules in 4355 ms. Remains 3039 /5604 variables (removed 2565) and now considering 10601/15300 (removed 4699) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4359 ms. Remains : 3039/5604 places, 10601/15300 transitions.
Incomplete random walk after 10000 steps, including 38 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 13) seen :4
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-050-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 10601 rows 3039 cols
[2023-03-14 14:07:58] [INFO ] Computed 52 place invariants in 382 ms
[2023-03-14 14:07:58] [INFO ] After 705ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 14:07:59] [INFO ] [Nat]Absence check using 50 positive place invariants in 32 ms returned sat
[2023-03-14 14:07:59] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2023-03-14 14:08:05] [INFO ] After 5967ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-14 14:08:05] [INFO ] State equation strengthened by 9483 read => feed constraints.
[2023-03-14 14:08:21] [INFO ] After 16015ms SMT Verify possible using 9483 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-14 14:08:23] [INFO ] After 18014ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-14 14:08:23] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 414 ms.
Support contains 169 out of 3039 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3039/3039 places, 10601/10601 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 3019 transition count 10581
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 41 place count 3019 transition count 10580
Partial Free-agglomeration rule applied 75 times.
Drop transitions removed 75 transitions
Iterating global reduction 0 with 75 rules applied. Total rules applied 116 place count 3019 transition count 10580
Applied a total of 116 rules in 1355 ms. Remains 3019 /3039 variables (removed 20) and now considering 10580/10601 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1357 ms. Remains : 3019/3039 places, 10580/10601 transitions.
Incomplete random walk after 10000 steps, including 37 resets, run finished after 516 ms. (steps per millisecond=19 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) seen :0
Interrupted probabilistic random walk after 65589 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 65589 steps, saw 34782 distinct states, run finished after 3003 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 10580 rows 3019 cols
[2023-03-14 14:08:29] [INFO ] Computed 52 place invariants in 444 ms
[2023-03-14 14:08:30] [INFO ] After 731ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 14:08:31] [INFO ] [Nat]Absence check using 50 positive place invariants in 29 ms returned sat
[2023-03-14 14:08:31] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2023-03-14 14:08:38] [INFO ] After 6734ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-14 14:08:38] [INFO ] State equation strengthened by 9541 read => feed constraints.
[2023-03-14 14:08:52] [INFO ] After 14265ms SMT Verify possible using 9541 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-14 14:08:55] [INFO ] After 17264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-14 14:08:55] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 592 ms.
Support contains 169 out of 3019 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3019/3019 places, 10580/10580 transitions.
Applied a total of 0 rules in 457 ms. Remains 3019 /3019 variables (removed 0) and now considering 10580/10580 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 458 ms. Remains : 3019/3019 places, 10580/10580 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3019/3019 places, 10580/10580 transitions.
Applied a total of 0 rules in 379 ms. Remains 3019 /3019 variables (removed 0) and now considering 10580/10580 (removed 0) transitions.
[2023-03-14 14:08:57] [INFO ] Invariant cache hit.
[2023-03-14 14:09:00] [INFO ] Implicit Places using invariants in 3174 ms returned []
Implicit Place search using SMT only with invariants took 3176 ms to find 0 implicit places.
[2023-03-14 14:09:00] [INFO ] Invariant cache hit.
[2023-03-14 14:09:05] [INFO ] Dead Transitions using invariants and state equation in 4693 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8256 ms. Remains : 3019/3019 places, 10580/10580 transitions.
Graph (trivial) has 9008 edges and 3019 vertex of which 2193 / 3019 are part of one of the 2 SCC in 10 ms
Free SCC test removed 2191 places
Drop transitions removed 5825 transitions
Ensure Unique test removed 2326 transitions
Reduce isomorphic transitions removed 8151 transitions.
Graph (complete) has 2806 edges and 828 vertex of which 696 are kept as prefixes of interest. Removing 132 places using SCC suffix rule.1 ms
Discarding 132 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Drop transitions removed 403 transitions
Reduce isomorphic transitions removed 403 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 405 rules applied. Total rules applied 407 place count 696 transition count 1984
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 411 place count 694 transition count 1982
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 411 place count 694 transition count 1979
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 417 place count 691 transition count 1979
Discarding 337 places :
Symmetric choice reduction at 2 with 337 rule applications. Total rules 754 place count 354 transition count 1261
Iterating global reduction 2 with 337 rules applied. Total rules applied 1091 place count 354 transition count 1261
Ensure Unique test removed 261 transitions
Reduce isomorphic transitions removed 261 transitions.
Iterating post reduction 2 with 261 rules applied. Total rules applied 1352 place count 354 transition count 1000
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1390 place count 316 transition count 924
Iterating global reduction 3 with 38 rules applied. Total rules applied 1428 place count 316 transition count 924
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 1466 place count 316 transition count 886
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1470 place count 314 transition count 892
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1471 place count 314 transition count 891
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 5 with 37 rules applied. Total rules applied 1508 place count 314 transition count 854
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 5 with 8 rules applied. Total rules applied 1516 place count 314 transition count 846
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 10 rules applied. Total rules applied 1526 place count 306 transition count 844
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1528 place count 304 transition count 844
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 8 with 2 rules applied. Total rules applied 1530 place count 303 transition count 843
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1531 place count 303 transition count 842
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1534 place count 303 transition count 839
Free-agglomeration rule applied 68 times.
Iterating global reduction 9 with 68 rules applied. Total rules applied 1602 place count 303 transition count 771
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 9 with 141 rules applied. Total rules applied 1743 place count 235 transition count 698
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 10 with 10 rules applied. Total rules applied 1753 place count 235 transition count 688
Partial Free-agglomeration rule applied 37 times.
Drop transitions removed 37 transitions
Iterating global reduction 10 with 37 rules applied. Total rules applied 1790 place count 235 transition count 688
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1791 place count 234 transition count 687
Iterating global reduction 10 with 1 rules applied. Total rules applied 1792 place count 234 transition count 687
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1793 place count 234 transition count 687
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1794 place count 233 transition count 686
Applied a total of 1794 rules in 410 ms. Remains 233 /3019 variables (removed 2786) and now considering 686/10580 (removed 9894) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 686 rows 233 cols
[2023-03-14 14:09:05] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-14 14:09:05] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 14:09:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-14 14:09:05] [INFO ] After 275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-14 14:09:06] [INFO ] After 552ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 189 ms.
[2023-03-14 14:09:06] [INFO ] After 819ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2023-03-14 14:09:06] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-14 14:09:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3019 places, 10580 transitions and 41282 arcs took 43 ms.
[2023-03-14 14:09:07] [INFO ] Flatten gal took : 491 ms
Total runtime 105300 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 ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 3019 places, 10580 transitions, 41282 arcs.
Final Score: 7653087.008
Took : 99 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: CANInsertWithFailure-PT-050-ReachabilityCardinality-02 (reachable & potential(( ( ( ( 1 ) <= (tk(P3017)) ) & ( ( (tk(P138)) <= (tk(P2516)) ) & ( ( (tk(P412)) <= (tk(P2193)) ) | ( ( (tk(P947)) <= ( 1 ) ) | ( (tk(P1691)) <= (tk(P1331)) ) ) ) ) ) & ( ( ( (tk(P1710)) <= (tk(P2013)) ) | ( ( (tk(P649)) <= ( 0 ) ) | ( ( (! ( ( 1 ) <= (tk(P774)) )) & (! ( ( 1 ) <= (tk(P2333)) )) ) & ( (! ( (tk(P2367)) <= ( 1 ) )) & ( ( (! ( (tk(P546)) <= (tk(P2886)) )) & (! ( (tk(P2931)) <= (tk(P165)) )) ) | ( (! ( ( 1 ) <= (tk(P2872)) )) & (! ( (tk(P2747)) <= ( 1 ) )) ) ) ) ) ) ) & ( ( ( (! ( (tk(P1843)) <= ( 0 ) )) & ( ( 1 ) <= (tk(P2969)) ) ) | ( ( (! ( (tk(P1828)) <= (tk(P1906)) )) | ( (! ( (tk(P13)) <= ( 1 ) )) | (! ( (tk(P789)) <= (tk(P306)) )) ) ) & ( ( ( (tk(P479)) <= (tk(P2627)) ) | ( (tk(P2672)) <= ( 0 ) ) ) | ( ( ( (tk(P201)) <= (tk(P725)) ) & ( (tk(P586)) <= (tk(P2911)) ) ) | ( ( (tk(P1482)) <= ( 1 ) ) & ( ( ( 1 ) <= (tk(P1763)) ) & ( ( (tk(P2787)) <= (tk(P709)) ) | ( (tk(P1153)) <= (tk(P503)) ) ) ) ) ) ) ) ) & ( ( (! ( (tk(P2210)) <= ( 0 ) )) | ( ( 1 ) <= (tk(P2356)) ) ) | ( ( (tk(P624)) <= (tk(P240)) ) | ( (tk(P1318)) <= ( 1 ) ) ) ) ) ) )))
PROPERTY: CANInsertWithFailure-PT-050-ReachabilityCardinality-03 (reachable &!potential( ( ( ( (! ( (tk(P532)) <= (tk(P2541)) )) | ( (tk(P322)) <= (tk(P1465)) ) ) | ( (! ( (tk(P1376)) <= ( 1 ) )) | (! ( ( 1 ) <= (tk(P2519)) )) ) ) | ( ( (! ( (tk(P3013)) <= (tk(P1918)) )) | (! ( (tk(P2806)) <= ( 1 ) )) ) | ( (! ( (tk(P2945)) <= ( 0 ) )) | ( ( ( 1 ) <= (tk(P815)) ) | ( (! ( ( 1 ) <= (tk(P1345)) )) & ( (! ( (tk(P207)) <= (tk(P2172)) )) & ( (! ( ( 1 ) <= (tk(P2216)) )) | ( (tk(P1910)) <= ( 0 ) ) ) ) ) ) ) ) )))
PROPERTY: CANInsertWithFailure-PT-050-ReachabilityCardinality-05 (reachable & potential(( ( ( (! ( (tk(P1775)) <= ( 0 ) )) & ( ( 1 ) <= (tk(P1849)) ) ) | ( ( ( (! ( ( 1 ) <= (tk(P1480)) )) & (! ( (tk(P1309)) <= ( 1 ) )) ) & ( ( (! ( (tk(P820)) <= ( 0 ) )) | ( ( 1 ) <= (tk(P1077)) ) ) & ( ( ( (tk(P945)) <= ( 0 ) ) | ( (tk(P2408)) <= ( 0 ) ) ) | ( (! ( ( 1 ) <= (tk(P1017)) )) | ( (! ( (tk(P1702)) <= (tk(P257)) )) | (! ( (tk(P1566)) <= ( 1 ) )) ) ) ) ) ) | ( ( (! ( (tk(P1738)) <= (tk(P684)) )) & ( ( (tk(P477)) <= (tk(P1960)) ) | ( ( 1 ) <= (tk(P2046)) ) ) ) & ( ( ( (tk(P1001)) <= ( 0 ) ) | ( ( (tk(P132)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P459)) ) ) ) & ( ( (! ( ( 1 ) <= (tk(P132)) )) | ( (! ( (tk(P2430)) <= ( 0 ) )) & (! ( (tk(P1727)) <= ( 0 ) )) ) ) & ( ( ( 1 ) <= (tk(P2804)) ) | ( ( (tk(P1162)) <= ( 1 ) ) & ( ( (! ( ( 1 ) <= (tk(P3007)) )) | (! ( (tk(P2057)) <= ( 0 ) )) ) & ( (! ( (tk(P699)) <= (tk(P405)) )) | ( (! ( (tk(P587)) <= (tk(P977)) )) | (! ( (tk(P1054)) <= ( 0 ) )) ) ) ) ) ) ) ) ) ) ) & ( (! ( (tk(P238)) <= (tk(P2189)) )) | ( ( (! ( (tk(P347)) <= (tk(P1775)) )) | (! ( ( 1 ) <= (tk(P660)) )) ) & ( ( ( ( 1 ) <= (tk(P1012)) ) & ( (tk(P3015)) <= ( 1 ) ) ) | ( (! ( (tk(P1645)) <= (tk(P2694)) )) & ( ( ( ( (tk(P1810)) <= (tk(P1150)) ) & ( ( 1 ) <= (tk(P227)) ) ) | ( ( ( 1 ) <= (tk(P950)) ) & ( (tk(P1138)) <= (tk(P675)) ) ) ) & ( ( ( 1 ) <= (tk(P1876)) ) | ( (tk(P1492)) <= (tk(P2413)) ) ) ) ) ) ) ) )))
PROPERTY: CANInsertWithFailure-PT-050-ReachabilityCardinality-07 (reachable &!potential( ( (tk(P2606)) <= ( 1 ) )))
PROPERTY: CANInsertWithFailure-PT-050-ReachabilityCardinality-08 (reachable & potential(( ( 1 ) <= (tk(P855)) )))
PROPERTY: CANInsertWithFailure-PT-050-ReachabilityCardinality-09 (reachable & potential(( (! ( (tk(P1415)) <= ( 1 ) )) & ( ( (tk(P1721)) <= (tk(P680)) ) & ( ( ( (tk(P2731)) <= ( 0 ) ) | (! ( (tk(P2382)) <= (tk(P2499)) )) ) | ( ( ( (! ( (tk(P110)) <= ( 0 ) )) & ( (! ( ( 1 ) <= (tk(P1722)) )) & (! ( (tk(P107)) <= ( 1 ) )) ) ) & ( (! ( (tk(P1406)) <= (tk(P257)) )) & ( (! ( (tk(P2624)) <= ( 1 ) )) & ( ( (tk(P1051)) <= (tk(P2001)) ) | ( (tk(P369)) <= (tk(P684)) ) ) ) ) ) | ( ( ( ( 1 ) <= (tk(P1463)) ) & ( ( (tk(P687)) <= (tk(P2947)) ) & (! ( (tk(P2117)) <= (tk(P287)) )) ) ) & ( ( (! ( (tk(P1794)) <= (tk(P2436)) )) & ( (tk(P2025)) <= ( 1 ) ) ) & ( (! ( (tk(P1679)) <= ( 0 ) )) & ( (tk(P544)) <= ( 1 ) ) ) ) ) ) ) ) )))
PROPERTY: CANInsertWithFailure-PT-050-ReachabilityCardinality-10 (reachable &!potential( ( (tk(P833)) <= ( 1 ) )))
PROPERTY: CANInsertWithFailure-PT-050-ReachabilityCardinality-12 (reachable &!potential( ( ( ( (! ( (tk(P42)) <= (tk(P381)) )) | (! ( ( 1 ) <= (tk(P118)) )) ) | ( ( ( 1 ) <= (tk(P2933)) ) | ( (tk(P983)) <= ( 0 ) ) ) ) | ( ( (! ( (tk(P469)) <= (tk(P1496)) )) | ( (! ( ( 1 ) <= (tk(P500)) )) & ( ( ( 1 ) <= (tk(P507)) ) & ( ( (tk(P2616)) <= (tk(P209)) ) | ( ( (tk(P660)) <= (tk(P1926)) ) & ( (tk(P2173)) <= (tk(P1656)) ) ) ) ) ) ) | ( ( ( (tk(P1182)) <= (tk(P243)) ) & ( ( ( ( (tk(P1096)) <= (tk(P772)) ) & ( ( 1 ) <= (tk(P769)) ) ) | ( ( ( 1 ) <= (tk(P510)) ) & ( (tk(P2743)) <= (tk(P1702)) ) ) ) & ( ( ( 1 ) <= (tk(P96)) ) | ( (! ( ( 1 ) <= (tk(P991)) )) | ( (! ( ( 1 ) <= (tk(P2662)) )) & ( ( 1 ) <= (tk(P2455)) ) ) ) ) ) ) | ( ( ( ( 1 ) <= (tk(P2248)) ) & ( ( (tk(P1284)) <= ( 0 ) ) & ( ( (tk(P667)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P1989)) ) ) ) ) | ( ( ( 1 ) <= (tk(P1312)) ) & ( ( 1 ) <= (tk(P1676)) ) ) ) ) ) )))
PROPERTY: CANInsertWithFailure-PT-050-ReachabilityCardinality-13 (reachable & potential(( (! ( (tk(P1351)) <= ( 1 ) )) & ( (tk(P2005)) <= ( 0 ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 14261824 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16076344 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-167813697300742"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;