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.r425-tajo-167905978100334.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 ltsminxred
Input is ShieldRVt-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978100334
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.8K Feb 25 22:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 22:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 22:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 614K 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 ShieldRVt-PT-050B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679310506257

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 11:08:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 11:08:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 11:08:28] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2023-03-20 11:08:28] [INFO ] Transformed 2503 places.
[2023-03-20 11:08:28] [INFO ] Transformed 2503 transitions.
[2023-03-20 11:08:28] [INFO ] Found NUPN structural information;
[2023-03-20 11:08:28] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 445 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 576 ms. (steps per millisecond=17 ) properties (out of 14) seen :4
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) 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 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2503 rows 2503 cols
[2023-03-20 11:08:30] [INFO ] Computed 201 place invariants in 37 ms
[2023-03-20 11:08:31] [INFO ] After 1639ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 11:08:32] [INFO ] [Nat]Absence check using 201 positive place invariants in 129 ms returned sat
[2023-03-20 11:08:46] [INFO ] After 13776ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 11:08:49] [INFO ] Deduced a trap composed of 39 places in 790 ms of which 7 ms to minimize.
[2023-03-20 11:08:50] [INFO ] Deduced a trap composed of 45 places in 983 ms of which 1 ms to minimize.
[2023-03-20 11:08:51] [INFO ] Deduced a trap composed of 41 places in 923 ms of which 2 ms to minimize.
[2023-03-20 11:08:51] [INFO ] Deduced a trap composed of 48 places in 733 ms of which 11 ms to minimize.
[2023-03-20 11:08:52] [INFO ] Deduced a trap composed of 35 places in 524 ms of which 2 ms to minimize.
[2023-03-20 11:08:53] [INFO ] Deduced a trap composed of 33 places in 563 ms of which 2 ms to minimize.
[2023-03-20 11:08:53] [INFO ] Deduced a trap composed of 38 places in 518 ms of which 2 ms to minimize.
[2023-03-20 11:08:54] [INFO ] Deduced a trap composed of 30 places in 762 ms of which 2 ms to minimize.
[2023-03-20 11:08:55] [INFO ] Deduced a trap composed of 33 places in 768 ms of which 1 ms to minimize.
[2023-03-20 11:08:56] [INFO ] Deduced a trap composed of 45 places in 552 ms of which 2 ms to minimize.
[2023-03-20 11:08:56] [INFO ] Deduced a trap composed of 44 places in 558 ms of which 2 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-20 11:08:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 11:08:56] [INFO ] After 25243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 1449 ms.
Support contains 134 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Drop transitions removed 682 transitions
Trivial Post-agglo rules discarded 682 transitions
Performed 682 trivial Post agglomeration. Transition count delta: 682
Iterating post reduction 0 with 682 rules applied. Total rules applied 682 place count 2503 transition count 1821
Reduce places removed 682 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 684 rules applied. Total rules applied 1366 place count 1821 transition count 1819
Reduce places removed 1 places and 0 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Iterating post reduction 2 with 29 rules applied. Total rules applied 1395 place count 1820 transition count 1791
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 1423 place count 1792 transition count 1791
Performed 207 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 207 Pre rules applied. Total rules applied 1423 place count 1792 transition count 1584
Deduced a syphon composed of 207 places in 6 ms
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 4 with 414 rules applied. Total rules applied 1837 place count 1585 transition count 1584
Discarding 308 places :
Symmetric choice reduction at 4 with 308 rule applications. Total rules 2145 place count 1277 transition count 1276
Iterating global reduction 4 with 308 rules applied. Total rules applied 2453 place count 1277 transition count 1276
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 118 Pre rules applied. Total rules applied 2453 place count 1277 transition count 1158
Deduced a syphon composed of 118 places in 6 ms
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 4 with 236 rules applied. Total rules applied 2689 place count 1159 transition count 1158
Performed 425 Post agglomeration using F-continuation condition.Transition count delta: 425
Deduced a syphon composed of 425 places in 2 ms
Reduce places removed 425 places and 0 transitions.
Iterating global reduction 4 with 850 rules applied. Total rules applied 3539 place count 734 transition count 733
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -74
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3741 place count 633 transition count 807
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 3781 place count 613 transition count 822
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3782 place count 613 transition count 821
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 3788 place count 613 transition count 815
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 3794 place count 607 transition count 815
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 3798 place count 607 transition count 811
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 3802 place count 607 transition count 811
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3803 place count 606 transition count 810
Applied a total of 3803 rules in 1047 ms. Remains 606 /2503 variables (removed 1897) and now considering 810/2503 (removed 1693) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1048 ms. Remains : 606/2503 places, 810/2503 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 97328 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97328 steps, saw 70692 distinct states, run finished after 3004 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 810 rows 606 cols
[2023-03-20 11:09:03] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-20 11:09:04] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 11:09:04] [INFO ] [Nat]Absence check using 201 positive place invariants in 29 ms returned sat
[2023-03-20 11:09:04] [INFO ] After 595ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 11:09:04] [INFO ] State equation strengthened by 332 read => feed constraints.
[2023-03-20 11:09:06] [INFO ] After 1176ms SMT Verify possible using 332 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-20 11:09:06] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2023-03-20 11:09:06] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2023-03-20 11:09:06] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2023-03-20 11:09:06] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2023-03-20 11:09:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 498 ms
[2023-03-20 11:09:06] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 0 ms to minimize.
[2023-03-20 11:09:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-20 11:09:08] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 1 ms to minimize.
[2023-03-20 11:09:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-20 11:09:08] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2023-03-20 11:09:08] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2023-03-20 11:09:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 370 ms
[2023-03-20 11:09:08] [INFO ] After 4067ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1551 ms.
[2023-03-20 11:09:10] [INFO ] After 6464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 178 ms.
Support contains 134 out of 606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 810/810 transitions.
Applied a total of 0 rules in 18 ms. Remains 606 /606 variables (removed 0) and now considering 810/810 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 606/606 places, 810/810 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 810/810 transitions.
Applied a total of 0 rules in 13 ms. Remains 606 /606 variables (removed 0) and now considering 810/810 (removed 0) transitions.
[2023-03-20 11:09:10] [INFO ] Invariant cache hit.
[2023-03-20 11:09:11] [INFO ] Implicit Places using invariants in 502 ms returned [594]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 505 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 605/606 places, 810/810 transitions.
Applied a total of 0 rules in 30 ms. Remains 605 /605 variables (removed 0) and now considering 810/810 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 550 ms. Remains : 605/606 places, 810/810 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 80472 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80472 steps, saw 58866 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 810 rows 605 cols
[2023-03-20 11:09:15] [INFO ] Computed 200 place invariants in 7 ms
[2023-03-20 11:09:15] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 11:09:15] [INFO ] [Nat]Absence check using 200 positive place invariants in 28 ms returned sat
[2023-03-20 11:09:16] [INFO ] After 604ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 11:09:16] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-20 11:09:17] [INFO ] After 1433ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-20 11:09:18] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2023-03-20 11:09:18] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 13 ms to minimize.
[2023-03-20 11:09:18] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2023-03-20 11:09:18] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2023-03-20 11:09:18] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2023-03-20 11:09:18] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 0 ms to minimize.
[2023-03-20 11:09:18] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 0 ms to minimize.
[2023-03-20 11:09:19] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2023-03-20 11:09:19] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1206 ms
[2023-03-20 11:09:19] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 0 ms to minimize.
[2023-03-20 11:09:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-20 11:09:20] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 0 ms to minimize.
[2023-03-20 11:09:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-03-20 11:09:20] [INFO ] After 4455ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1523 ms.
[2023-03-20 11:09:22] [INFO ] After 6811ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 92 ms.
Support contains 134 out of 605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 810/810 transitions.
Applied a total of 0 rules in 14 ms. Remains 605 /605 variables (removed 0) and now considering 810/810 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 605/605 places, 810/810 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 810/810 transitions.
Applied a total of 0 rules in 14 ms. Remains 605 /605 variables (removed 0) and now considering 810/810 (removed 0) transitions.
[2023-03-20 11:09:22] [INFO ] Invariant cache hit.
[2023-03-20 11:09:22] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-20 11:09:22] [INFO ] Invariant cache hit.
[2023-03-20 11:09:23] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-20 11:09:24] [INFO ] Implicit Places using invariants and state equation in 2070 ms returned []
Implicit Place search using SMT with State Equation took 2430 ms to find 0 implicit places.
[2023-03-20 11:09:24] [INFO ] Redundant transitions in 69 ms returned []
[2023-03-20 11:09:24] [INFO ] Invariant cache hit.
[2023-03-20 11:09:25] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2933 ms. Remains : 605/605 places, 810/810 transitions.
Graph (trivial) has 112 edges and 605 vertex of which 2 / 605 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 0 with 32 rules applied. Total rules applied 33 place count 604 transition count 776
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 602 transition count 775
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 602 transition count 771
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 64 place count 602 transition count 771
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 1 with 13 rules applied. Total rules applied 77 place count 602 transition count 758
Applied a total of 77 rules in 88 ms. Remains 602 /605 variables (removed 3) and now considering 758/810 (removed 52) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 758 rows 602 cols
[2023-03-20 11:09:25] [INFO ] Computed 199 place invariants in 2 ms
[2023-03-20 11:09:25] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 11:09:25] [INFO ] [Nat]Absence check using 199 positive place invariants in 31 ms returned sat
[2023-03-20 11:09:26] [INFO ] After 567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 11:09:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 11:09:26] [INFO ] After 366ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-20 11:09:27] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 1 ms to minimize.
[2023-03-20 11:09:27] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2023-03-20 11:09:27] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2023-03-20 11:09:27] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2023-03-20 11:09:27] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2023-03-20 11:09:27] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2023-03-20 11:09:27] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2023-03-20 11:09:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 900 ms
[2023-03-20 11:09:28] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 0 ms to minimize.
[2023-03-20 11:09:28] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 0 ms to minimize.
[2023-03-20 11:09:28] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2023-03-20 11:09:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 374 ms
[2023-03-20 11:09:28] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2023-03-20 11:09:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-20 11:09:28] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2023-03-20 11:09:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-03-20 11:09:28] [INFO ] After 2431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 458 ms.
[2023-03-20 11:09:29] [INFO ] After 3702ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
[2023-03-20 11:09:29] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2023-03-20 11:09:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 605 places, 810 transitions and 3842 arcs took 10 ms.
[2023-03-20 11:09:29] [INFO ] Flatten gal took : 165 ms
Total runtime 61716 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/645/inv_0_ --invariant=/tmp/645/inv_1_ --invariant=/tmp/645/inv_2_ --invariant=/tmp/645/inv_3_ --invariant=/tmp/645/inv_4_ --invariant=/tmp/645/inv_5_ --invariant=/tmp/645/inv_6_ --invariant=/tmp/645/inv_7_ --invariant=/tmp/645/inv_8_ --invariant=/tmp/645/inv_9_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 15121124 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16099044 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2023

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="ShieldRVt-PT-050B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldRVt-PT-050B, 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 r425-tajo-167905978100334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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