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.r107-tall-167814484700790.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is DLCround-PT-13b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814484700790
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 6.3K Feb 25 18:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 18:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 18:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 18:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 18:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 18:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 18:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.1M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-00
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-01
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-02
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-03
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-04
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-05
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-06
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-07
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-08
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-09
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-13b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678428504959

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-13b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-10 06:08:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 06:08:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 06:08:26] [INFO ] Load time of PNML (sax parser for PT used): 230 ms
[2023-03-10 06:08:26] [INFO ] Transformed 5343 places.
[2023-03-10 06:08:26] [INFO ] Transformed 8727 transitions.
[2023-03-10 06:08:26] [INFO ] Found NUPN structural information;
[2023-03-10 06:08:27] [INFO ] Parsed PT model containing 5343 places and 8727 transitions and 24849 arcs in 607 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-13b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 545 ms. (steps per millisecond=18 ) properties (out of 13) seen :5
FORMULA DLCround-PT-13b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 8727 rows 5343 cols
[2023-03-10 06:08:28] [INFO ] Computed 312 place invariants in 63 ms
[2023-03-10 06:08:29] [INFO ] After 1600ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-10 06:08:31] [INFO ] [Nat]Absence check using 312 positive place invariants in 362 ms returned sat
[2023-03-10 06:08:38] [INFO ] After 6488ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-10 06:08:40] [INFO ] Deduced a trap composed of 171 places in 1465 ms of which 14 ms to minimize.
[2023-03-10 06:08:42] [INFO ] Deduced a trap composed of 271 places in 1296 ms of which 2 ms to minimize.
[2023-03-10 06:08:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3681 ms
[2023-03-10 06:08:46] [INFO ] Deduced a trap composed of 189 places in 3053 ms of which 5 ms to minimize.
[2023-03-10 06:08:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3800 ms
[2023-03-10 06:08:50] [INFO ] Deduced a trap composed of 278 places in 2432 ms of which 3 ms to minimize.
[2023-03-10 06:08:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3067 ms
[2023-03-10 06:08:53] [INFO ] Deduced a trap composed of 154 places in 1666 ms of which 2 ms to minimize.
[2023-03-10 06:08:55] [INFO ] Deduced a trap composed of 169 places in 1534 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-10 06:08:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 06:08:55] [INFO ] After 25298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
FORMULA DLCround-PT-13b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 532 ms.
Support contains 61 out of 5343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5343/5343 places, 8727/8727 transitions.
Graph (trivial) has 4767 edges and 5343 vertex of which 760 / 5343 are part of one of the 61 SCC in 18 ms
Free SCC test removed 699 places
Drop transitions removed 785 transitions
Reduce isomorphic transitions removed 785 transitions.
Drop transitions removed 1874 transitions
Trivial Post-agglo rules discarded 1874 transitions
Performed 1874 trivial Post agglomeration. Transition count delta: 1874
Iterating post reduction 0 with 1874 rules applied. Total rules applied 1875 place count 4644 transition count 6068
Reduce places removed 1874 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 1965 rules applied. Total rules applied 3840 place count 2770 transition count 5977
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 46 rules applied. Total rules applied 3886 place count 2732 transition count 5969
Reduce places removed 4 places and 0 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 3 with 29 rules applied. Total rules applied 3915 place count 2728 transition count 5944
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 3940 place count 2703 transition count 5944
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 3940 place count 2703 transition count 5912
Deduced a syphon composed of 32 places in 45 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 4004 place count 2671 transition count 5912
Discarding 708 places :
Symmetric choice reduction at 5 with 708 rule applications. Total rules 4712 place count 1963 transition count 5204
Iterating global reduction 5 with 708 rules applied. Total rules applied 5420 place count 1963 transition count 5204
Performed 303 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 303 Pre rules applied. Total rules applied 5420 place count 1963 transition count 4901
Deduced a syphon composed of 303 places in 40 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 5 with 606 rules applied. Total rules applied 6026 place count 1660 transition count 4901
Discarding 89 places :
Symmetric choice reduction at 5 with 89 rule applications. Total rules 6115 place count 1571 transition count 3409
Iterating global reduction 5 with 89 rules applied. Total rules applied 6204 place count 1571 transition count 3409
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 6232 place count 1571 transition count 3381
Performed 412 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 412 places in 1 ms
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 6 with 824 rules applied. Total rules applied 7056 place count 1159 transition count 2958
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 7067 place count 1159 transition count 2947
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 7071 place count 1155 transition count 2879
Iterating global reduction 7 with 4 rules applied. Total rules applied 7075 place count 1155 transition count 2879
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -454
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 7 with 114 rules applied. Total rules applied 7189 place count 1098 transition count 3333
Drop transitions removed 53 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 7 with 58 rules applied. Total rules applied 7247 place count 1098 transition count 3275
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 7251 place count 1094 transition count 3156
Iterating global reduction 8 with 4 rules applied. Total rules applied 7255 place count 1094 transition count 3156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 7259 place count 1094 transition count 3152
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 7263 place count 1092 transition count 3178
Drop transitions removed 83 transitions
Redundant transition composition rules discarded 83 transitions
Iterating global reduction 9 with 83 rules applied. Total rules applied 7346 place count 1092 transition count 3095
Discarding 16 places :
Symmetric choice reduction at 9 with 16 rule applications. Total rules 7362 place count 1076 transition count 3079
Iterating global reduction 9 with 16 rules applied. Total rules applied 7378 place count 1076 transition count 3079
Discarding 16 places :
Symmetric choice reduction at 9 with 16 rule applications. Total rules 7394 place count 1060 transition count 2771
Iterating global reduction 9 with 16 rules applied. Total rules applied 7410 place count 1060 transition count 2771
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 7426 place count 1060 transition count 2755
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 10 with 32 rules applied. Total rules applied 7458 place count 1044 transition count 2739
Discarding 14 places :
Symmetric choice reduction at 10 with 14 rule applications. Total rules 7472 place count 1030 transition count 2463
Iterating global reduction 10 with 14 rules applied. Total rules applied 7486 place count 1030 transition count 2463
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 7499 place count 1030 transition count 2450
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 7501 place count 1029 transition count 2459
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 7502 place count 1029 transition count 2458
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 12 with 11 rules applied. Total rules applied 7513 place count 1029 transition count 2447
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 7515 place count 1028 transition count 2456
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 7516 place count 1028 transition count 2455
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 13 with 9 rules applied. Total rules applied 7525 place count 1028 transition count 2446
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 7527 place count 1027 transition count 2456
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 7528 place count 1027 transition count 2455
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 7529 place count 1027 transition count 2454
Free-agglomeration rule applied 531 times with reduction of 252 identical transitions.
Iterating global reduction 14 with 531 rules applied. Total rules applied 8060 place count 1027 transition count 1671
Reduce places removed 531 places and 0 transitions.
Drop transitions removed 652 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 661 transitions.
Graph (complete) has 1347 edges and 496 vertex of which 436 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.1 ms
Discarding 60 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1193 rules applied. Total rules applied 9253 place count 436 transition count 1010
Drop transitions removed 20 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 15 with 45 rules applied. Total rules applied 9298 place count 436 transition count 965
Discarding 105 places :
Symmetric choice reduction at 16 with 105 rule applications. Total rules 9403 place count 331 transition count 792
Iterating global reduction 16 with 105 rules applied. Total rules applied 9508 place count 331 transition count 792
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 9516 place count 327 transition count 840
Drop transitions removed 40 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 16 with 48 rules applied. Total rules applied 9564 place count 327 transition count 792
Drop transitions removed 68 transitions
Redundant transition composition rules discarded 68 transitions
Iterating global reduction 17 with 68 rules applied. Total rules applied 9632 place count 327 transition count 724
Reduce places removed 3 places and 0 transitions.
Graph (complete) has 932 edges and 324 vertex of which 320 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 4 rules applied. Total rules applied 9636 place count 320 transition count 724
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 18 with 5 rules applied. Total rules applied 9641 place count 320 transition count 719
Discarding 24 places :
Symmetric choice reduction at 19 with 24 rule applications. Total rules 9665 place count 296 transition count 673
Iterating global reduction 19 with 24 rules applied. Total rules applied 9689 place count 296 transition count 673
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 9693 place count 294 transition count 699
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 19 with 18 rules applied. Total rules applied 9711 place count 294 transition count 681
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 9712 place count 293 transition count 660
Iterating global reduction 20 with 1 rules applied. Total rules applied 9713 place count 293 transition count 660
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 9715 place count 293 transition count 658
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 9717 place count 293 transition count 658
Applied a total of 9717 rules in 2069 ms. Remains 293 /5343 variables (removed 5050) and now considering 658/8727 (removed 8069) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2070 ms. Remains : 293/5343 places, 658/8727 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :3
FORMULA DLCround-PT-13b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 06:08:57] [INFO ] Flow matrix only has 438 transitions (discarded 220 similar events)
// Phase 1: matrix 438 rows 293 cols
[2023-03-10 06:08:57] [INFO ] Computed 128 place invariants in 13 ms
[2023-03-10 06:08:58] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 06:08:58] [INFO ] [Nat]Absence check using 128 positive place invariants in 21 ms returned sat
[2023-03-10 06:08:58] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 06:08:58] [INFO ] State equation strengthened by 126 read => feed constraints.
[2023-03-10 06:08:58] [INFO ] After 45ms SMT Verify possible using 126 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 06:08:58] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-10 06:08:58] [INFO ] After 318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 16 out of 293 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 293/293 places, 658/658 transitions.
Graph (trivial) has 102 edges and 293 vertex of which 11 / 293 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions removed 15 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 788 edges and 285 vertex of which 261 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 261 transition count 608
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 257 transition count 608
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 20 place count 257 transition count 596
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 44 place count 245 transition count 596
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 245 transition count 595
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 48 place count 242 transition count 580
Iterating global reduction 3 with 3 rules applied. Total rules applied 51 place count 242 transition count 580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 242 transition count 579
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 84 place count 226 transition count 562
Drop transitions removed 38 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 45 transitions.
Graph (complete) has 653 edges and 226 vertex of which 215 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Iterating post reduction 4 with 46 rules applied. Total rules applied 130 place count 215 transition count 504
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 145 place count 215 transition count 489
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 162 place count 198 transition count 465
Iterating global reduction 6 with 17 rules applied. Total rules applied 179 place count 198 transition count 465
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 185 place count 195 transition count 469
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 187 place count 195 transition count 467
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 7 with 20 rules applied. Total rules applied 207 place count 195 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 208 place count 194 transition count 447
Free-agglomeration rule applied 9 times.
Iterating global reduction 8 with 9 rules applied. Total rules applied 217 place count 194 transition count 438
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 8 with 40 rules applied. Total rules applied 257 place count 185 transition count 407
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 259 place count 183 transition count 405
Iterating global reduction 9 with 2 rules applied. Total rules applied 261 place count 183 transition count 405
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 263 place count 182 transition count 404
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 268 place count 182 transition count 399
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 271 place count 182 transition count 396
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 274 place count 182 transition count 396
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 277 place count 182 transition count 393
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 283 place count 179 transition count 390
Applied a total of 283 rules in 74 ms. Remains 179 /293 variables (removed 114) and now considering 390/658 (removed 268) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 179/293 places, 390/658 transitions.
Finished random walk after 558 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=139 )
FORMULA DLCround-PT-13b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 32026 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DLCround (PT), instance 13b
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 5343 places, 8727 transitions, 24849 arcs.
Final Score: 3783257.775
Took : 63 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: DLCround-PT-13b-ReachabilityCardinality-00 (reachable &!potential( (! ( ( (! ( ( 1 ) <= (tk(P1504)) )) & ( ( (tk(P322)) <= (tk(P1075)) ) & (! ( ( ( ( (tk(P1700)) <= ( 1 ) ) & ( (tk(P4460)) <= (tk(P55)) ) ) | (! ( ( 1 ) <= (tk(P520)) )) ) | ( ( ( (tk(P574)) <= ( 1 ) ) | ( (tk(P5168)) <= ( 0 ) ) ) & ( ( (tk(P2981)) <= (tk(P4317)) ) | ( (tk(P548)) <= ( 1 ) ) ) ) )) ) ) & ( ( ( ( ( (! ( (tk(P2230)) <= ( 1 ) )) & ( ( ( (tk(P3222)) <= ( 0 ) ) | ( (tk(P2358)) <= (tk(P5087)) ) ) | ( ( (tk(P563)) <= (tk(P4451)) ) & ( ( 1 ) <= (tk(P3881)) ) ) ) ) | ( (tk(P3395)) <= (tk(P3593)) ) ) | (! ( ( ( (tk(P1020)) <= ( 1 ) ) | ( (tk(P3937)) <= ( 0 ) ) ) | (! ( ( 1 ) <= (tk(P776)) )) )) ) & ( (tk(P455)) <= ( 0 ) ) ) & (! ( ( 1 ) <= (tk(P245)) )) ) ))))
PROPERTY: DLCround-PT-13b-ReachabilityCardinality-01 (reachable & potential(( ( (! ( (! ( ( ( ( (tk(P4076)) <= (tk(P2463)) ) & ( (tk(P4524)) <= (tk(P658)) ) ) | ( ( (tk(P3442)) <= ( 1 ) ) | ( (tk(P3857)) <= (tk(P2720)) ) ) ) & (! ( ( (tk(P529)) <= (tk(P1866)) ) | ( (tk(P454)) <= (tk(P2962)) ) )) )) & ( (tk(P1377)) <= (tk(P3601)) ) )) & (! ( ( ( ( ( ( (tk(P2346)) <= (tk(P1382)) ) | ( (tk(P2956)) <= ( 1 ) ) ) | ( ( 1 ) <= (tk(P2221)) ) ) & ( ( ( 1 ) <= (tk(P1983)) ) | ( (tk(P1024)) <= (tk(P1373)) ) ) ) & (! ( (tk(P1317)) <= (tk(P5103)) )) ) & ( ( (! ( ( 1 ) <= (tk(P3276)) )) & (! ( ( (tk(P2960)) <= (tk(P3482)) ) & ( (tk(P4383)) <= (tk(P4057)) ) )) ) | ( ( (tk(P1388)) <= (tk(P984)) ) | ( ( 1 ) <= (tk(P1947)) ) ) ) )) ) & ( ( ( 1 ) <= (tk(P907)) ) & (! ( (tk(P2424)) <= ( 0 ) )) ) )))
PROPERTY: DLCround-PT-13b-ReachabilityCardinality-02 (reachable & potential(( ( 1 ) <= (tk(P4695)) )))
PROPERTY: DLCround-PT-13b-ReachabilityCardinality-03 (reachable & potential((! ( ( (! ( ( ( ( 1 ) <= (tk(P3865)) ) & ( (tk(P4706)) <= (tk(P2842)) ) ) & ( ( (! ( ( ( 1 ) <= (tk(P2136)) ) & ( (tk(P2593)) <= ( 1 ) ) )) & (! ( ( (tk(P706)) <= (tk(P3664)) ) | ( (tk(P3071)) <= ( 0 ) ) )) ) | ( ( ( ( (tk(P3538)) <= (tk(P154)) ) | ( ( 1 ) <= (tk(P546)) ) ) & ( ( 1 ) <= (tk(P3819)) ) ) & ( (tk(P4180)) <= ( 0 ) ) ) ) )) & ( ( ( ( (tk(P5013)) <= (tk(P3886)) ) | ( ( (! ( ( 1 ) <= (tk(P2294)) )) & (! ( (tk(P881)) <= (tk(P4831)) )) ) & ( (! ( (tk(P5067)) <= (tk(P2762)) )) & ( (tk(P2640)) <= (tk(P4421)) ) ) ) ) & ( (tk(P4616)) <= (tk(P13)) ) ) | ( ( (tk(P509)) <= ( 1 ) ) & ( ( ( (! ( ( 1 ) <= (tk(P3236)) )) & ( ( ( 1 ) <= (tk(P2852)) ) | ( ( 1 ) <= (tk(P3474)) ) ) ) | (! ( (tk(P2192)) <= (tk(P4702)) )) ) | (! ( ( (tk(P5092)) <= (tk(P1996)) ) | (! ( (tk(P2934)) <= ( 1 ) )) )) ) ) ) ) | ( (tk(P4885)) <= (tk(P3664)) ) ))))
PROPERTY: DLCround-PT-13b-ReachabilityCardinality-04 (reachable & potential((! ( ( (tk(P2911)) <= ( 0 ) ) & (! ( ( (tk(P2560)) <= (tk(P4072)) ) & ( ( (! ( (tk(P1593)) <= (tk(P3950)) )) & ( ( ( 1 ) <= (tk(P4585)) ) & (! ( ( (tk(P2250)) <= (tk(P1546)) ) | ( ( 1 ) <= (tk(P2882)) ) )) ) ) & (! ( ( (tk(P1281)) <= (tk(P2021)) ) & (! ( (tk(P3976)) <= (tk(P1997)) )) )) ) )) ))))
PROPERTY: DLCround-PT-13b-ReachabilityCardinality-05 (reachable & potential(( ( ( 1 ) <= (tk(P589)) ) | ( ( 1 ) <= (tk(P3821)) ) )))
PROPERTY: DLCround-PT-13b-ReachabilityCardinality-06 (reachable &!potential( ( ( (tk(P3620)) <= ( 1 ) ) | ( ( ( ( (! ( ( ( (tk(P4481)) <= ( 1 ) ) | ( (tk(P1925)) <= ( 1 ) ) ) | ( (tk(P828)) <= ( 0 ) ) )) | ( ( 1 ) <= (tk(P4175)) ) ) | ( (tk(P4414)) <= (tk(P2993)) ) ) | ( ( (! ( (tk(P4728)) <= ( 0 ) )) | ( ( 1 ) <= (tk(P2)) ) ) | ( ( ( (tk(P416)) <= (tk(P125)) ) | (! ( (! ( (tk(P549)) <= (tk(P1632)) )) | ( (tk(P3527)) <= ( 0 ) ) )) ) & ( (! ( (tk(P2951)) <= (tk(P286)) )) & ( ( (tk(P1322)) <= ( 1 ) ) & ( ( ( (tk(P2852)) <= (tk(P3523)) ) & ( (tk(P2212)) <= ( 1 ) ) ) | (! ( (tk(P4297)) <= (tk(P298)) )) ) ) ) ) ) ) | ( (tk(P4142)) <= (tk(P1586)) ) ) )))
PROPERTY: DLCround-PT-13b-ReachabilityCardinality-07 (reachable &!potential( ( ( ( (tk(P567)) <= (tk(P2745)) ) | ( ( ( ( ( ( ( ( (tk(P3030)) <= (tk(P923)) ) | ( ( 1 ) <= (tk(P4271)) ) ) | ( (tk(P3344)) <= ( 0 ) ) ) & (! ( ( (tk(P4531)) <= ( 0 ) ) | ( (tk(P1818)) <= ( 1 ) ) )) ) | ( ( (! ( (tk(P634)) <= ( 0 ) )) & ( ( 1 ) <= (tk(P5331)) ) ) & ( (tk(P263)) <= ( 0 ) ) ) ) | ( ( (tk(P4166)) <= ( 1 ) ) & ( ( ( ( 1 ) <= (tk(P3225)) ) & ( ( 1 ) <= (tk(P1298)) ) ) & ( (tk(P3348)) <= (tk(P2413)) ) ) ) ) | ( ( ( 1 ) <= (tk(P2216)) ) | ( ( ( ( ( (tk(P2936)) <= (tk(P867)) ) & ( (tk(P3510)) <= ( 1 ) ) ) & ( (tk(P373)) <= (tk(P675)) ) ) | ( ( ( ( 1 ) <= (tk(P3710)) ) | ( ( 1 ) <= (tk(P213)) ) ) | ( ( ( 1 ) <= (tk(P3611)) ) | ( (tk(P2378)) <= (tk(P3199)) ) ) ) ) | ( ( ( ( (tk(P3070)) <= ( 0 ) ) | ( (tk(P1007)) <= (tk(P1486)) ) ) | ( ( ( 1 ) <= (tk(P4559)) ) & ( ( 1 ) <= (tk(P2331)) ) ) ) & ( (tk(P4100)) <= ( 0 ) ) ) ) ) ) | ( (! ( (tk(P227)) <= ( 0 ) )) | ( (tk(P2802)) <= (tk(P2596)) ) ) ) ) & ( ( ( (tk(P768)) <= ( 1 ) ) & (! ( ( 1 ) <= (tk(P2521)) )) ) | ( (! ( (! ( ( (tk(P4602)) <= (tk(P2213)) ) | ( (tk(P2325)) <= ( 1 ) ) )) | ( ( ( ( 1 ) <= (tk(P732)) ) | ( ( 1 ) <= (tk(P4706)) ) ) | ( ( ( 1 ) <= (tk(P3529)) ) | ( ( 1 ) <= (tk(P25)) ) ) ) )) & ( ( 1 ) <= (tk(P4561)) ) ) ) )))
PROPERTY: DLCround-PT-13b-ReachabilityCardinality-08 (reachable &!potential( ( ( (tk(P1286)) <= (tk(P2734)) ) | (! ( ( ( (tk(P2588)) <= ( 0 ) ) & ( ( ( ( 1 ) <= (tk(P2237)) ) | ( ( 1 ) <= (tk(P4002)) ) ) | ( ( (tk(P3316)) <= ( 1 ) ) | ( ( (tk(P4096)) <= ( 0 ) ) & (! ( (tk(P2846)) <= ( 0 ) )) ) ) ) ) & ( ( (! ( ( (tk(P1416)) <= ( 0 ) ) | ( (tk(P3412)) <= ( 1 ) ) )) | ( ( ( (tk(P4974)) <= ( 0 ) ) | (! ( (tk(P3113)) <= ( 1 ) )) ) | ( ( ( ( 1 ) <= (tk(P2938)) ) & ( ( 1 ) <= (tk(P3589)) ) ) & ( ( (tk(P4902)) <= (tk(P1755)) ) | ( (tk(P12)) <= (tk(P2437)) ) ) ) ) ) | ( ( ( (tk(P4344)) <= ( 1 ) ) | (! ( ( ( 1 ) <= (tk(P1887)) ) | ( (tk(P3640)) <= (tk(P1310)) ) )) ) & ( (tk(P2813)) <= ( 0 ) ) ) ) )) )))
PROPERTY: DLCround-PT-13b-ReachabilityCardinality-09 (reachable &!potential( ( ( ( (! ( (tk(P4064)) <= ( 0 ) )) & ( ( (! ( (tk(P1093)) <= (tk(P3345)) )) | ( (tk(P4922)) <= ( 0 ) ) ) & ( (! ( ( ( 1 ) <= (tk(P5026)) ) & ( ( (tk(P4881)) <= ( 0 ) ) & ( (tk(P1354)) <= ( 0 ) ) ) )) | ( ( ( (! ( (tk(P790)) <= (tk(P2458)) )) & ( ( ( 1 ) <= (tk(P5043)) ) | ( (tk(P996)) <= (tk(P2009)) ) ) ) & ( ( ( (tk(P3640)) <= (tk(P196)) ) & ( (tk(P1484)) <= ( 1 ) ) ) & ( (tk(P3323)) <= ( 0 ) ) ) ) & (! ( ( 1 ) <= (tk(P3545)) )) ) ) ) ) | ( ( ( (tk(P5108)) <= ( 0 ) ) | ( ( ( ( (! ( (tk(P4827)) <= ( 1 ) )) & (! ( (tk(P2885)) <= ( 1 ) )) ) & ( ( ( (tk(P2093)) <= (tk(P302)) ) | ( (tk(P2695)) <= ( 1 ) ) ) & ( ( ( 1 ) <= (tk(P446)) ) | ( (tk(P3393)) <= (tk(P2248)) ) ) ) ) & ( ( (tk(P1943)) <= ( 1 ) ) | ( (tk(P356)) <= (tk(P5280)) ) ) ) & ( (tk(P1663)) <= ( 1 ) ) ) ) & (! ( (tk(P4773)) <= ( 1 ) )) ) ) | ( ( (tk(P780)) <= ( 1 ) ) & ( (! ( ( (! ( ( ( (tk(P721)) <= (tk(P4514)) ) & ( (tk(P2676)) <= ( 0 ) ) ) | (! ( ( 1 ) <= (tk(P4762)) )) )) | ( (! ( (tk(P3519)) <= ( 1 ) )) & ( ( ( 1 ) <= (tk(P2644)) ) & ( ( (tk(P3692)) <= (tk(P163)) ) | ( (tk(P3035)) <= ( 1 ) ) ) ) ) ) | ( ( (! ( (tk(P4906)) <= ( 0 ) )) & ( (! ( (tk(P3035)) <= ( 0 ) )) | (! ( (tk(P4667)) <= ( 0 ) )) ) ) | ( ( ( ( ( 1 ) <= (tk(P17)) ) & ( ( 1 ) <= (tk(P3837)) ) ) | ( ( ( 1 ) <= (tk(P3620)) ) & ( (tk(P2941)) <= ( 0 ) ) ) ) & ( (! ( ( 1 ) <= (tk(P2986)) )) & ( ( ( 1 ) <= (tk(P1266)) ) & ( (tk(P3506)) <= ( 1 ) ) ) ) ) ) )) | ( (tk(P2614)) <= ( 1 ) ) ) ) )))
PROPERTY: DLCround-PT-13b-ReachabilityCardinality-10 (reachable &!potential( ( (tk(P3104)) <= (tk(P621)) )))
PROPERTY: DLCround-PT-13b-ReachabilityCardinality-11 (reachable & potential(( ( ( ( ( ( (tk(P3478)) <= ( 1 ) ) | ( (! ( ( ( 1 ) <= (tk(P3555)) ) | ( ( 1 ) <= (tk(P1544)) ) )) | (! ( ( ( ( 1 ) <= (tk(P716)) ) & ( ( 1 ) <= (tk(P4257)) ) ) | (! ( (tk(P3474)) <= ( 1 ) )) )) ) ) & ( ( 1 ) <= (tk(P747)) ) ) | ( (! ( ( ( ( ( ( 1 ) <= (tk(P3435)) ) & ( (tk(P4256)) <= ( 1 ) ) ) | ( ( ( 1 ) <= (tk(P609)) ) | ( (tk(P2470)) <= (tk(P3266)) ) ) ) & ( (! ( ( 1 ) <= (tk(P4194)) )) | ( ( (tk(P1106)) <= (tk(P3361)) ) | ( (tk(P1426)) <= (tk(P3312)) ) ) ) ) & ( (tk(P564)) <= ( 0 ) ) )) | ( ( (tk(P3523)) <= (tk(P4776)) ) & ( ( ( (! ( ( 1 ) <= (tk(P1149)) )) | (! ( (tk(P2676)) <= ( 0 ) )) ) | ( ( ( (tk(P5323)) <= ( 0 ) ) | ( (tk(P3859)) <= ( 1 ) ) ) | (! ( (tk(P3430)) <= (tk(P2934)) )) ) ) | ( ( 1 ) <= (tk(P3456)) ) ) ) ) ) & (! ( (tk(P2718)) <= ( 0 ) )) ) & (! ( (tk(P2043)) <= (tk(P4379)) )) )))
PROPERTY: DLCround-PT-13b-ReachabilityCardinality-12 (reachable &!potential( ( ( (tk(P4562)) <= ( 1 ) ) & ( ( ( ( ( (tk(P1554)) <= (tk(P3972)) ) | (! ( ( (tk(P353)) <= ( 1 ) ) | (! ( ( ( 1 ) <= (tk(P2533)) ) & ( (tk(P1562)) <= (tk(P4488)) ) )) )) ) | ( (tk(P5097)) <= (tk(P2857)) ) ) & ( ( (! ( (tk(P933)) <= ( 0 ) )) & (! ( (tk(P2462)) <= ( 0 ) )) ) | ( ( (tk(P959)) <= (tk(P464)) ) | ( ( ( ( ( ( 1 ) <= (tk(P2787)) ) & ( ( 1 ) <= (tk(P54)) ) ) | (! ( (tk(P3205)) <= ( 0 ) )) ) & ( ( ( (tk(P478)) <= ( 1 ) ) & ( (tk(P3043)) <= (tk(P848)) ) ) & (! ( (tk(P1563)) <= ( 1 ) )) ) ) | ( (! ( (tk(P1529)) <= ( 0 ) )) & (! ( ( 1 ) <= (tk(P317)) )) ) ) ) ) ) & ( (tk(P5161)) <= (tk(P2293)) ) ) )))
PROPERTY: DLCround-PT-13b-ReachabilityCardinality-13 (reachable & potential((! ( (tk(P2970)) <= (tk(P2260)) ))))
PROPERTY: DLCround-PT-13b-ReachabilityCardinality-14 (reachable &!potential( ( (tk(P1424)) <= ( 0 ) )))
PROPERTY: DLCround-PT-13b-ReachabilityCardinality-15 (reachable &!potential( ( (! ( (! ( ( 1 ) <= (tk(P15)) )) & ( ( ( (tk(P2093)) <= ( 1 ) ) & (! ( (! ( (tk(P1551)) <= ( 1 ) )) | (! ( ( 1 ) <= (tk(P2171)) )) )) ) & ( (! ( (tk(P984)) <= ( 1 ) )) & ( ( 1 ) <= (tk(P3740)) ) ) ) )) & ( ( (tk(P3547)) <= (tk(P4961)) ) & ( ( (! ( ( ( ( (tk(P2326)) <= (tk(P2696)) ) | ( (tk(P2615)) <= ( 0 ) ) ) & ( (tk(P3170)) <= ( 0 ) ) ) | ( ( (! ( (tk(P4960)) <= ( 0 ) )) & ( (tk(P1762)) <= (tk(P5084)) ) ) & (! ( ( 1 ) <= (tk(P3913)) )) ) )) | ( ( 1 ) <= (tk(P264)) ) ) | ( ( (tk(P2908)) <= (tk(P893)) ) | (! ( (! ( ( 1 ) <= (tk(P2015)) )) & ( (! ( ( 1 ) <= (tk(P712)) )) & ( (tk(P4240)) <= (tk(P4258)) ) ) )) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15206296 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16105884 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DLCround-PT-13b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is DLCround-PT-13b, 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 r107-tall-167814484700790"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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