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.r330-tall-167889203000270.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 marciexred
Input is RERS2020-PT-pb107, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203000270
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 59M
-rw-r--r-- 1 mcc users 6.9K Feb 26 08:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 08:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 08:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 08:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 08:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 08:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 59M 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-pb107-ReachabilityCardinality-00
FORMULA_NAME RERS2020-PT-pb107-ReachabilityCardinality-01
FORMULA_NAME RERS2020-PT-pb107-ReachabilityCardinality-02
FORMULA_NAME RERS2020-PT-pb107-ReachabilityCardinality-03
FORMULA_NAME RERS2020-PT-pb107-ReachabilityCardinality-04
FORMULA_NAME RERS2020-PT-pb107-ReachabilityCardinality-05
FORMULA_NAME RERS2020-PT-pb107-ReachabilityCardinality-06
FORMULA_NAME RERS2020-PT-pb107-ReachabilityCardinality-07
FORMULA_NAME RERS2020-PT-pb107-ReachabilityCardinality-08
FORMULA_NAME RERS2020-PT-pb107-ReachabilityCardinality-09
FORMULA_NAME RERS2020-PT-pb107-ReachabilityCardinality-10
FORMULA_NAME RERS2020-PT-pb107-ReachabilityCardinality-11
FORMULA_NAME RERS2020-PT-pb107-ReachabilityCardinality-12
FORMULA_NAME RERS2020-PT-pb107-ReachabilityCardinality-13
FORMULA_NAME RERS2020-PT-pb107-ReachabilityCardinality-14
FORMULA_NAME RERS2020-PT-pb107-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679131212199

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS2020-PT-pb107
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 09:20:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 09:20:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 09:20:15] [INFO ] Load time of PNML (sax parser for PT used): 1747 ms
[2023-03-18 09:20:15] [INFO ] Transformed 1382 places.
[2023-03-18 09:20:16] [INFO ] Transformed 104643 transitions.
[2023-03-18 09:20:16] [INFO ] Found NUPN structural information;
[2023-03-18 09:20:16] [INFO ] Parsed PT model containing 1382 places and 104643 transitions and 417030 arcs in 2401 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 11427 transitions
Reduce redundant transitions removed 11427 transitions.
FORMULA RERS2020-PT-pb107-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1093 ms. (steps per millisecond=9 ) properties (out of 15) seen :2
FORMULA RERS2020-PT-pb107-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb107-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 13) seen :1
FORMULA RERS2020-PT-pb107-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-18 09:20:19] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1382 cols
[2023-03-18 09:20:20] [INFO ] Computed 25 place invariants in 406 ms
[2023-03-18 09:20:20] [INFO ] After 815ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-18 09:20:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 24 ms returned sat
[2023-03-18 09:20:21] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-18 09:20:46] [INFO ] After 24163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-18 09:20:47] [INFO ] State equation strengthened by 3692 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 09:20:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 09:20:47] [INFO ] After 26598ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 38 ms.
Support contains 163 out of 1382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1382/1382 places, 93216/93216 transitions.
Graph (complete) has 84016 edges and 1382 vertex of which 1381 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.98 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 places
Drop transitions removed 2810 transitions
Reduce isomorphic transitions removed 2810 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 0 with 2823 rules applied. Total rules applied 2824 place count 1369 transition count 90405
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2825 place count 1368 transition count 90405
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2825 place count 1368 transition count 90403
Deduced a syphon composed of 2 places in 70 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2829 place count 1366 transition count 90403
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2831 place count 1366 transition count 90401
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 135 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 2857 place count 1353 transition count 90385
Drop transitions removed 4 transitions
Ensure Unique test removed 427 transitions
Reduce isomorphic transitions removed 431 transitions.
Iterating post reduction 3 with 431 rules applied. Total rules applied 3288 place count 1353 transition count 89954
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 53 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3296 place count 1349 transition count 89950
Drop transitions removed 4 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 4 with 96 rules applied. Total rules applied 3392 place count 1349 transition count 89854
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 104 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3394 place count 1348 transition count 89855
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3397 place count 1348 transition count 89852
Free-agglomeration rule applied 23 times.
Iterating global reduction 6 with 23 rules applied. Total rules applied 3420 place count 1348 transition count 89829
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 441 transitions
Reduce isomorphic transitions removed 469 transitions.
Iterating post reduction 6 with 492 rules applied. Total rules applied 3912 place count 1325 transition count 89360
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 3922 place count 1325 transition count 89856
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 3943 place count 1315 transition count 89845
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 3946 place count 1315 transition count 89845
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 3948 place count 1315 transition count 89843
Applied a total of 3948 rules in 5473 ms. Remains 1315 /1382 variables (removed 67) and now considering 89843/93216 (removed 3373) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5485 ms. Remains : 1315/1382 places, 89843/93216 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1017 ms. (steps per millisecond=9 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 17728 steps, run timeout after 6001 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 17728 steps, saw 14315 distinct states, run finished after 6004 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 12 properties.
[2023-03-18 09:21:01] [INFO ] Flow matrix only has 62369 transitions (discarded 27474 similar events)
// Phase 1: matrix 62369 rows 1315 cols
[2023-03-18 09:21:01] [INFO ] Computed 12 place invariants in 292 ms
[2023-03-18 09:21:02] [INFO ] After 493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-18 09:21:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 13 ms returned sat
[2023-03-18 09:21:27] [INFO ] After 24504ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-18 09:21:28] [INFO ] State equation strengthened by 3686 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 09:21:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 09:21:28] [INFO ] After 25752ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 163 out of 1315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1315/1315 places, 89843/89843 transitions.
Applied a total of 0 rules in 452 ms. Remains 1315 /1315 variables (removed 0) and now considering 89843/89843 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 452 ms. Remains : 1315/1315 places, 89843/89843 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1315/1315 places, 89843/89843 transitions.
Applied a total of 0 rules in 462 ms. Remains 1315 /1315 variables (removed 0) and now considering 89843/89843 (removed 0) transitions.
[2023-03-18 09:21:29] [INFO ] Flow matrix only has 62369 transitions (discarded 27474 similar events)
[2023-03-18 09:21:29] [INFO ] Invariant cache hit.
[2023-03-18 09:21:32] [INFO ] Implicit Places using invariants in 3305 ms returned []
Implicit Place search using SMT only with invariants took 3307 ms to find 0 implicit places.
[2023-03-18 09:21:32] [INFO ] Flow matrix only has 62369 transitions (discarded 27474 similar events)
[2023-03-18 09:21:32] [INFO ] Invariant cache hit.
[2023-03-18 09:22:02] [INFO ] Performed 88949/89843 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 09:22:02] [INFO ] Dead Transitions using invariants and state equation in 30505 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34283 ms. Remains : 1315/1315 places, 89843/89843 transitions.
Graph (trivial) has 23894 edges and 1315 vertex of which 846 / 1315 are part of one of the 133 SCC in 7 ms
Free SCC test removed 713 places
Drop transitions removed 23102 transitions
Ensure Unique test removed 48918 transitions
Reduce isomorphic transitions removed 72020 transitions.
Graph (complete) has 15318 edges and 602 vertex of which 589 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.8 ms
Discarding 13 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 17 place count 589 transition count 17806
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 17 place count 589 transition count 17805
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 588 transition count 17805
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 585 transition count 17790
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 585 transition count 17790
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 582 transition count 17787
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 92 place count 582 transition count 17726
Drop transitions removed 8031 transitions
Redundant transition composition rules discarded 8031 transitions
Iterating global reduction 2 with 8031 rules applied. Total rules applied 8123 place count 582 transition count 9695
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 11239 edges and 578 vertex of which 567 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.5 ms
Discarding 11 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 2 with 12 rules applied. Total rules applied 8135 place count 567 transition count 9684
Drop transitions removed 46 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 8198 place count 567 transition count 9621
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8198 place count 567 transition count 9620
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8200 place count 566 transition count 9620
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 8202 place count 564 transition count 9612
Iterating global reduction 4 with 2 rules applied. Total rules applied 8204 place count 564 transition count 9612
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 8205 place count 563 transition count 9607
Iterating global reduction 4 with 1 rules applied. Total rules applied 8206 place count 563 transition count 9607
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8208 place count 562 transition count 9606
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 8217 place count 562 transition count 9597
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 8229 place count 562 transition count 9585
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 4 with 96 rules applied. Total rules applied 8325 place count 550 transition count 9501
Drop transitions removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 5 with 130 rules applied. Total rules applied 8455 place count 550 transition count 9371
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 8458 place count 550 transition count 9368
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 8461 place count 547 transition count 9368
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 6 with 26 rules applied. Total rules applied 8487 place count 547 transition count 9342
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 8489 place count 547 transition count 9340
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 8491 place count 545 transition count 9340
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 8495 place count 545 transition count 9336
Free-agglomeration rule (complex) applied 8 times with reduction of 25 identical transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 8503 place count 545 transition count 9508
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 7 with 98 rules applied. Total rules applied 8601 place count 537 transition count 9418
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 8 with 61 rules applied. Total rules applied 8662 place count 537 transition count 9357
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 8663 place count 537 transition count 9367
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 8664 place count 536 transition count 9367
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 8670 place count 536 transition count 9361
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 8671 place count 536 transition count 9372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 8672 place count 535 transition count 9372
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 8680 place count 535 transition count 9364
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 10 with 21 rules applied. Total rules applied 8701 place count 535 transition count 9364
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 8706 place count 535 transition count 9359
Applied a total of 8706 rules in 4682 ms. Remains 535 /1315 variables (removed 780) and now considering 9359/89843 (removed 80484) transitions.
Running SMT prover for 12 properties.
[2023-03-18 09:22:07] [INFO ] Flow matrix only has 9307 transitions (discarded 52 similar events)
// Phase 1: matrix 9307 rows 535 cols
[2023-03-18 09:22:07] [INFO ] Computed 1 place invariants in 76 ms
[2023-03-18 09:22:08] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-18 09:22:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-18 09:22:12] [INFO ] After 3608ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-18 09:22:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-18 09:22:14] [INFO ] After 1983ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-18 09:22:17] [INFO ] After 5378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 2103 ms.
[2023-03-18 09:22:19] [INFO ] After 11349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
[2023-03-18 09:22:19] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-18 09:22:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1315 places, 89843 transitions and 358134 arcs took 200 ms.
[2023-03-18 09:22:23] [INFO ] Flatten gal took : 2849 ms
Total runtime 129681 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: RERS2020_PT_pb107
(NrP: 1315 NrTr: 89843 NrArc: 358134)

parse formulas
formulas created successfully
place and transition orderings generation:0m34.731sec

net check time: 0m 0.088sec

init dd package: 0m 2.838sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 10289068 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15980676 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 1m 0.488sec

3026 3617 4487 5235 4534 8204 8680 9571 11013 11443 12536 12235 12446 11832 12135 12181 11232 11220 10123 13333 14232 14706 13333 15777 16721 16259 15151 16686 16218 16003 18943 18034 16332 17473 18287 19989 19596 18791 20398 19613 19018 19802 20160 21751 20643 20458 18957 20725 19738 19856 20617 20003 20006 21437 20107 20193 20374 20082 19598 19599 20439 21171 21372 21650 21592 21598 22030 22228 22048 22177 22285 22112 22427 22413 22283 22613 22352 22352 22352 22355 22363 25280 22697 22842 22602 22629 22792 22612 22839 22877 22686 23019 22938 22922 22768 22766 22930 22784 22728 22360 23993 24237 24028 24074 24942 25355 25660 25476 25671 25631 26022 26449 26885

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-pb107"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is RERS2020-PT-pb107, 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 r330-tall-167889203000270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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