Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 7.2K Feb 26 08:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 08:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 08:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 08:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 08:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 08:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 08:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 08:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 18M Mar 5 18:23 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 RERS2020-PT-pb103-ReachabilityCardinality-00
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-01
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-02
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-03
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-04
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-05
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-06
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-07
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-08
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-09
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-10
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-11
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-12
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-13
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-14
FORMULA_NAME RERS2020-PT-pb103-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679118044134

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=RERS2020-PT-pb103
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-18 05:40:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 05:40:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 05:40:46] [INFO ] Load time of PNML (sax parser for PT used): 699 ms
[2023-03-18 05:40:46] [INFO ] Transformed 520 places.
[2023-03-18 05:40:46] [INFO ] Transformed 31658 transitions.
[2023-03-18 05:40:46] [INFO ] Found NUPN structural information;
[2023-03-18 05:40:46] [INFO ] Parsed PT model containing 520 places and 31658 transitions and 125892 arcs in 902 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 3229 transitions
Reduce redundant transitions removed 3229 transitions.
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 563 ms. (steps per millisecond=17 ) properties (out of 11) seen :5
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :1
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :1
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :1
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 05:40:48] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 520 cols
[2023-03-18 05:40:48] [INFO ] Computed 15 place invariants in 115 ms
[2023-03-18 05:40:48] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-18 05:40:48] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-18 05:40:48] [INFO ] After 346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 05:40:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 05:40:48] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-18 05:40:53] [INFO ] After 4046ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-18 05:40:53] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2023-03-18 05:40:57] [INFO ] After 3753ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-18 05:40:59] [INFO ] Deduced a trap composed of 50 places in 2299 ms of which 7 ms to minimize.
[2023-03-18 05:41:02] [INFO ] Deduced a trap composed of 102 places in 2035 ms of which 1 ms to minimize.
[2023-03-18 05:41:04] [INFO ] Deduced a trap composed of 22 places in 1931 ms of which 1 ms to minimize.
[2023-03-18 05:41:06] [INFO ] Deduced a trap composed of 61 places in 1841 ms of which 1 ms to minimize.
[2023-03-18 05:41:08] [INFO ] Deduced a trap composed of 96 places in 1634 ms of which 1 ms to minimize.
[2023-03-18 05:41:11] [INFO ] Deduced a trap composed of 155 places in 2332 ms of which 0 ms to minimize.
[2023-03-18 05:41:13] [INFO ] Deduced a trap composed of 49 places in 2277 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-18 05:41:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 05:41:13] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
FORMULA RERS2020-PT-pb103-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 81 ms.
Support contains 9 out of 520 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 28429/28429 transitions.
Ensure Unique test removed 7 places
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1069 rules applied. Total rules applied 1069 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1071 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 27 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1073 place count 511 transition count 27377
Free-agglomeration rule applied 11 times.
Iterating global reduction 1 with 11 rules applied. Total rules applied 1084 place count 511 transition count 27366
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 1176 place count 500 transition count 27285
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1177 place count 500 transition count 27465
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1178 place count 499 transition count 27465
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1179 place count 498 transition count 27464
Applied a total of 1179 rules in 847 ms. Remains 498 /520 variables (removed 22) and now considering 27464/28429 (removed 965) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 852 ms. Remains : 498/520 places, 27464/28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 37831 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37831 steps, saw 26792 distinct states, run finished after 3003 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 05:41:18] [INFO ] Flow matrix only has 18735 transitions (discarded 8729 similar events)
// Phase 1: matrix 18735 rows 498 cols
[2023-03-18 05:41:18] [INFO ] Computed 8 place invariants in 86 ms
[2023-03-18 05:41:18] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 05:41:18] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 05:41:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-18 05:41:22] [INFO ] After 3766ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 05:41:22] [INFO ] State equation strengthened by 1375 read => feed constraints.
[2023-03-18 05:41:25] [INFO ] After 2935ms SMT Verify possible using 1375 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 05:41:28] [INFO ] Deduced a trap composed of 20 places in 2193 ms of which 0 ms to minimize.
[2023-03-18 05:41:31] [INFO ] Deduced a trap composed of 93 places in 1941 ms of which 1 ms to minimize.
[2023-03-18 05:41:33] [INFO ] Deduced a trap composed of 49 places in 1987 ms of which 1 ms to minimize.
[2023-03-18 05:41:35] [INFO ] Deduced a trap composed of 101 places in 2080 ms of which 0 ms to minimize.
[2023-03-18 05:41:38] [INFO ] Deduced a trap composed of 11 places in 2188 ms of which 1 ms to minimize.
[2023-03-18 05:41:40] [INFO ] Deduced a trap composed of 32 places in 2324 ms of which 1 ms to minimize.
[2023-03-18 05:41:44] [INFO ] Deduced a trap composed of 72 places in 2485 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-18 05:41:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 05:41:44] [INFO ] After 25585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 12 ms.
Support contains 9 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 27464/27464 transitions.
Applied a total of 0 rules in 101 ms. Remains 498 /498 variables (removed 0) and now considering 27464/27464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 498/498 places, 27464/27464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 27464/27464 transitions.
Applied a total of 0 rules in 99 ms. Remains 498 /498 variables (removed 0) and now considering 27464/27464 (removed 0) transitions.
[2023-03-18 05:41:44] [INFO ] Flow matrix only has 18735 transitions (discarded 8729 similar events)
[2023-03-18 05:41:44] [INFO ] Invariant cache hit.
[2023-03-18 05:41:45] [INFO ] Implicit Places using invariants in 980 ms returned []
Implicit Place search using SMT only with invariants took 981 ms to find 0 implicit places.
[2023-03-18 05:41:45] [INFO ] Flow matrix only has 18735 transitions (discarded 8729 similar events)
[2023-03-18 05:41:45] [INFO ] Invariant cache hit.
[2023-03-18 05:41:54] [INFO ] Dead Transitions using invariants and state equation in 9312 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10400 ms. Remains : 498/498 places, 27464/27464 transitions.
Graph (trivial) has 9926 edges and 498 vertex of which 375 / 498 are part of one of the 62 SCC in 5 ms
Free SCC test removed 313 places
Drop transitions removed 10430 transitions
Ensure Unique test removed 14338 transitions
Reduce isomorphic transitions removed 24768 transitions.
Graph (complete) has 2645 edges and 185 vertex of which 178 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 178 transition count 2683
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 176 transition count 2683
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 174 transition count 2681
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 54 place count 174 transition count 2648
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 173 transition count 2658
Drop transitions removed 1415 transitions
Redundant transition composition rules discarded 1415 transitions
Iterating global reduction 3 with 1415 rules applied. Total rules applied 1471 place count 173 transition count 1243
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1471 edges and 170 vertex of which 152 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 3 with 13 rules applied. Total rules applied 1484 place count 152 transition count 1232
Drop transitions removed 109 transitions
Reduce isomorphic transitions removed 109 transitions.
Iterating post reduction 4 with 109 rules applied. Total rules applied 1593 place count 152 transition count 1123
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1595 place count 150 transition count 1109
Iterating global reduction 5 with 2 rules applied. Total rules applied 1597 place count 150 transition count 1109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1598 place count 150 transition count 1108
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1601 place count 150 transition count 1105
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1609 place count 150 transition count 1097
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1624 place count 142 transition count 1090
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 7 with 45 rules applied. Total rules applied 1669 place count 142 transition count 1045
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1675 place count 142 transition count 1039
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1687 place count 136 transition count 1033
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 1703 place count 136 transition count 1017
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1705 place count 136 transition count 1015
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1707 place count 134 transition count 1015
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1709 place count 134 transition count 1013
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1710 place count 134 transition count 1012
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1711 place count 133 transition count 1012
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1713 place count 133 transition count 1051
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 1721 place count 131 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1722 place count 130 transition count 1039
Iterating global reduction 11 with 1 rules applied. Total rules applied 1723 place count 130 transition count 1039
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 1732 place count 130 transition count 1030
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 12 with 12 rules applied. Total rules applied 1744 place count 130 transition count 1018
Applied a total of 1744 rules in 331 ms. Remains 130 /498 variables (removed 368) and now considering 1018/27464 (removed 26446) transitions.
Running SMT prover for 2 properties.
[2023-03-18 05:41:54] [INFO ] Flow matrix only has 980 transitions (discarded 38 similar events)
// Phase 1: matrix 980 rows 130 cols
[2023-03-18 05:41:54] [INFO ] Computed 0 place invariants in 20 ms
[2023-03-18 05:41:55] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 05:41:55] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 05:41:55] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-18 05:41:55] [INFO ] After 65ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 05:41:55] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-18 05:41:55] [INFO ] After 456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-18 05:41:55] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-18 05:41:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 498 places, 27464 transitions and 109318 arcs took 97 ms.
[2023-03-18 05:41:56] [INFO ] Flatten gal took : 1094 ms
Total runtime 71067 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running RERS2020 (PT), instance pb103
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: 498 places, 27464 transitions, 109318 arcs.
Final Score: 634356.257
Took : 684 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: RERS2020-PT-pb103-ReachabilityCardinality-00 (reachable & potential(( ( ( (tk(P495)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P495)) ) ) & ( ( (tk(P71)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P71)) ) ) )))
PROPERTY: RERS2020-PT-pb103-ReachabilityCardinality-09 (reachable &!potential( ( ( ( (tk(P350)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P350)) ) ) | ( ( ( (tk(P490)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P490)) ) ) | ( ( ( ( (tk(P46)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P46)) ) ) & ( ( (tk(P228)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P228)) ) ) ) & ( ( ( (tk(P241)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P241)) ) ) & ( ( ( (tk(P425)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P425)) ) ) | ( ( (tk(P242)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P242)) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9610788 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16058068 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="RERS2020-PT-pb103"
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 RERS2020-PT-pb103, 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 r331-tall-167889204200238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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