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.r171-tall-167838858000054.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 Echo-PT-d02r09, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838858000054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 7.6K Feb 25 14:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 14:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 14:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 25 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 14:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 14:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 303K 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 Echo-PT-d02r09-ReachabilityCardinality-00
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-01
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-02
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-03
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-04
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-05
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-06
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-07
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-08
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-09
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-10
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-11
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-12
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-13
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-14
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679412913917

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=Echo-PT-d02r09
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 15:35:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 15:35:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 15:35:15] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2023-03-21 15:35:15] [INFO ] Transformed 735 places.
[2023-03-21 15:35:15] [INFO ] Transformed 570 transitions.
[2023-03-21 15:35:15] [INFO ] Found NUPN structural information;
[2023-03-21 15:35:15] [INFO ] Parsed PT model containing 735 places and 570 transitions and 3220 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA Echo-PT-d02r09-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 61 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 14) seen :11
FORMULA Echo-PT-d02r09-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 570 rows 735 cols
[2023-03-21 15:35:16] [INFO ] Computed 369 place invariants in 61 ms
[2023-03-21 15:35:16] [INFO ] After 567ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 15:35:17] [INFO ] [Nat]Absence check using 85 positive place invariants in 23 ms returned sat
[2023-03-21 15:35:17] [INFO ] [Nat]Absence check using 85 positive and 284 generalized place invariants in 52 ms returned sat
[2023-03-21 15:35:27] [INFO ] After 10144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 15:35:27] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 6 ms to minimize.
[2023-03-21 15:35:28] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 1 ms to minimize.
[2023-03-21 15:35:28] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2023-03-21 15:35:28] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 2 ms to minimize.
[2023-03-21 15:35:28] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 1 ms to minimize.
[2023-03-21 15:35:28] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 0 ms to minimize.
[2023-03-21 15:35:29] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2023-03-21 15:35:29] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2023-03-21 15:35:29] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2023-03-21 15:35:29] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 1 ms to minimize.
[2023-03-21 15:35:29] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 0 ms to minimize.
[2023-03-21 15:35:30] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 0 ms to minimize.
[2023-03-21 15:35:30] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2023-03-21 15:35:30] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 0 ms to minimize.
[2023-03-21 15:35:30] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2023-03-21 15:35:30] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 1 ms to minimize.
[2023-03-21 15:35:30] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 0 ms to minimize.
[2023-03-21 15:35:31] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 1 ms to minimize.
[2023-03-21 15:35:31] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 1 ms to minimize.
[2023-03-21 15:35:31] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 0 ms to minimize.
[2023-03-21 15:35:31] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 0 ms to minimize.
[2023-03-21 15:35:31] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2023-03-21 15:35:32] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2023-03-21 15:35:32] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 0 ms to minimize.
[2023-03-21 15:35:32] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 0 ms to minimize.
[2023-03-21 15:35:32] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2023-03-21 15:35:32] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2023-03-21 15:35:33] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2023-03-21 15:35:33] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 0 ms to minimize.
[2023-03-21 15:35:33] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 5650 ms
[2023-03-21 15:35:33] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 1 ms to minimize.
[2023-03-21 15:35:34] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 0 ms to minimize.
[2023-03-21 15:35:34] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 0 ms to minimize.
[2023-03-21 15:35:34] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2023-03-21 15:35:34] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2023-03-21 15:35:34] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 1 ms to minimize.
[2023-03-21 15:35:35] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 0 ms to minimize.
[2023-03-21 15:35:35] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 0 ms to minimize.
[2023-03-21 15:35:35] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 0 ms to minimize.
[2023-03-21 15:35:35] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 0 ms to minimize.
[2023-03-21 15:35:36] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2023-03-21 15:35:36] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 0 ms to minimize.
[2023-03-21 15:35:36] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 0 ms to minimize.
[2023-03-21 15:35:36] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 0 ms to minimize.
[2023-03-21 15:35:37] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 0 ms to minimize.
[2023-03-21 15:35:37] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 0 ms to minimize.
[2023-03-21 15:35:37] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2023-03-21 15:35:37] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2023-03-21 15:35:38] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 0 ms to minimize.
[2023-03-21 15:35:38] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2023-03-21 15:35:38] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 1 ms to minimize.
[2023-03-21 15:35:38] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2023-03-21 15:35:39] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 0 ms to minimize.
[2023-03-21 15:35:39] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2023-03-21 15:35:39] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 0 ms to minimize.
[2023-03-21 15:35:39] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 1 ms to minimize.
[2023-03-21 15:35:40] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 0 ms to minimize.
[2023-03-21 15:35:40] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 3 ms to minimize.
[2023-03-21 15:35:40] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2023-03-21 15:35:41] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2023-03-21 15:35:41] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 1 ms to minimize.
[2023-03-21 15:35:41] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 0 ms to minimize.
[2023-03-21 15:35:41] [INFO ] Trap strengthening (SAT) tested/added 32/32 trap constraints in 8227 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
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-21 15:35:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 15:35:41] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 20 ms.
Support contains 93 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 570/570 transitions.
Graph (complete) has 2466 edges and 735 vertex of which 658 are kept as prefixes of interest. Removing 77 places using SCC suffix rule.7 ms
Discarding 77 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 658 transition count 570
Applied a total of 3 rules in 116 ms. Remains 658 /735 variables (removed 77) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 658/735 places, 570/570 transitions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :1
FORMULA Echo-PT-d02r09-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 570 rows 658 cols
[2023-03-21 15:35:42] [INFO ] Computed 292 place invariants in 151 ms
[2023-03-21 15:35:42] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 15:35:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-21 15:35:43] [INFO ] [Nat]Absence check using 11 positive and 281 generalized place invariants in 466 ms returned sat
[2023-03-21 15:36:07] [INFO ] After 24333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 15:36:07] [INFO ] After 24338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-21 15:36:07] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 72 out of 658 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 658/658 places, 570/570 transitions.
Graph (complete) has 1919 edges and 658 vertex of which 657 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 65 ms. Remains 657 /658 variables (removed 1) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 657/658 places, 570/570 transitions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :1
FORMULA Echo-PT-d02r09-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 570 rows 657 cols
[2023-03-21 15:36:08] [INFO ] Computed 291 place invariants in 110 ms
[2023-03-21 15:36:08] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 15:36:08] [INFO ] [Nat]Absence check using 9 positive place invariants in 21 ms returned sat
[2023-03-21 15:36:08] [INFO ] [Nat]Absence check using 9 positive and 282 generalized place invariants in 548 ms returned sat
[2023-03-21 15:36:13] [INFO ] After 5058ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 15:36:14] [INFO ] After 5425ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 232 ms.
[2023-03-21 15:36:14] [INFO ] After 6438ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 31 out of 657 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 657/657 places, 570/570 transitions.
Graph (complete) has 1915 edges and 657 vertex of which 647 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 647 transition count 566
Applied a total of 4 rules in 33 ms. Remains 647 /657 variables (removed 10) and now considering 566/570 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 647/657 places, 566/570 transitions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 724689 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :{}
Probabilistic random walk after 724689 steps, saw 126414 distinct states, run finished after 3005 ms. (steps per millisecond=241 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 566 rows 647 cols
[2023-03-21 15:36:17] [INFO ] Computed 282 place invariants in 105 ms
[2023-03-21 15:36:17] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 15:36:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-21 15:36:18] [INFO ] [Nat]Absence check using 3 positive and 279 generalized place invariants in 494 ms returned sat
[2023-03-21 15:36:30] [INFO ] After 11915ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 15:36:30] [INFO ] After 12281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 542 ms.
[2023-03-21 15:36:31] [INFO ] After 13503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 31 out of 647 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 647/647 places, 566/566 transitions.
Applied a total of 0 rules in 21 ms. Remains 647 /647 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 647/647 places, 566/566 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 647/647 places, 566/566 transitions.
Applied a total of 0 rules in 18 ms. Remains 647 /647 variables (removed 0) and now considering 566/566 (removed 0) transitions.
[2023-03-21 15:36:31] [INFO ] Invariant cache hit.
[2023-03-21 15:36:33] [INFO ] Implicit Places using invariants in 1716 ms returned []
[2023-03-21 15:36:33] [INFO ] Invariant cache hit.
[2023-03-21 15:36:39] [INFO ] Implicit Places using invariants and state equation in 5976 ms returned []
Implicit Place search using SMT with State Equation took 7694 ms to find 0 implicit places.
[2023-03-21 15:36:39] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-21 15:36:39] [INFO ] Invariant cache hit.
[2023-03-21 15:36:40] [INFO ] Dead Transitions using invariants and state equation in 1018 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8776 ms. Remains : 647/647 places, 566/566 transitions.
Applied a total of 0 rules in 19 ms. Remains 647 /647 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-21 15:36:40] [INFO ] Invariant cache hit.
[2023-03-21 15:36:40] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 15:36:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-21 15:36:40] [INFO ] [Nat]Absence check using 3 positive and 279 generalized place invariants in 430 ms returned sat
[2023-03-21 15:36:52] [INFO ] After 11749ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 15:36:53] [INFO ] After 12031ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 209 ms.
[2023-03-21 15:36:53] [INFO ] After 12862ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-21 15:36:53] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-21 15:36:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 647 places, 566 transitions and 2902 arcs took 4 ms.
[2023-03-21 15:36:53] [INFO ] Flatten gal took : 95 ms
Total runtime 98121 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Echo (PT), instance d02r09
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: 647 places, 566 transitions, 2902 arcs.
Final Score: 41331.726
Took : 28 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: Echo-PT-d02r09-ReachabilityCardinality-05 (reachable & potential(( ( ( ( ( ( (tk(P293)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P293)) ) ) & ( ( (tk(P430)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P430)) ) ) ) & ( ( ( (tk(P256)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P256)) ) ) & ( ( (tk(P600)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P600)) ) ) ) ) & ( ( ( ( (tk(P539)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P539)) ) ) & ( ( (tk(P132)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P132)) ) ) ) & ( ( ( (tk(P156)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P156)) ) ) & ( ( (tk(P141)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P141)) ) ) ) ) ) & ( ( ( ( ( (tk(P581)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P581)) ) ) & ( ( ( (tk(P271)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P271)) ) ) | ( ( (tk(P30)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P30)) ) ) ) ) & ( ( ( ( (tk(P200)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P200)) ) ) | ( ( (tk(P75)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P75)) ) ) ) & ( ( ( (tk(P553)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P553)) ) ) | ( ( (tk(P445)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P445)) ) ) ) ) ) & ( ( ( ( ( ( (tk(P155)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P155)) ) ) & ( ( ( (tk(P353)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P353)) ) ) & ( ( (tk(P537)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P537)) ) ) ) ) | ( ( ( (tk(P575)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P575)) ) ) & ( ( ( (tk(P123)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P123)) ) ) & ( ( (tk(P29)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P29)) ) ) ) ) ) & ( ( ( (tk(P368)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P368)) ) ) | ( ( ( (tk(P190)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P190)) ) ) | ( ( ( (tk(P378)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P378)) ) ) & ( ( (tk(P574)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P574)) ) ) ) ) ) ) & ( ( ( ( (tk(P616)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P616)) ) ) | ( ( (tk(P55)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P55)) ) ) ) & ( ( ( (tk(P10)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P10)) ) ) | ( ( ( (tk(P545)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P545)) ) ) | ( ( ( (tk(P285)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P285)) ) ) & ( ( (tk(P157)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P157)) ) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 1670488 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16104568 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="Echo-PT-d02r09"
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 Echo-PT-d02r09, 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 r171-tall-167838858000054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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