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.r169-tall-167838855400111.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 ltsminxred
Input is Echo-PT-d04r03, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855400111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 976K
-rw-r--r-- 1 mcc users 6.6K Feb 25 14:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 14:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 14:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 14:06 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.9K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 14:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 14:08 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 530K 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-d04r03-ReachabilityFireability-00
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-01
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-02
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-03
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-04
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-05
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-06
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-07
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-08
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-09
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-10
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-11
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-12
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-13
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-14
FORMULA_NAME Echo-PT-d04r03-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678487331070

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d04r03
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 22:28:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 22:28:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 22:28:52] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2023-03-10 22:28:52] [INFO ] Transformed 1019 places.
[2023-03-10 22:28:52] [INFO ] Transformed 850 transitions.
[2023-03-10 22:28:52] [INFO ] Found NUPN structural information;
[2023-03-10 22:28:52] [INFO ] Parsed PT model containing 1019 places and 850 transitions and 6340 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 61 resets, run finished after 582 ms. (steps per millisecond=17 ) properties (out of 16) seen :9
FORMULA Echo-PT-d04r03-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 7) seen :1
FORMULA Echo-PT-d04r03-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 850 rows 1019 cols
[2023-03-10 22:28:54] [INFO ] Computed 513 place invariants in 58 ms
[2023-03-10 22:28:54] [INFO ] After 499ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-10 22:28:55] [INFO ] [Nat]Absence check using 115 positive place invariants in 29 ms returned sat
[2023-03-10 22:28:55] [INFO ] [Nat]Absence check using 115 positive and 398 generalized place invariants in 82 ms returned sat
[2023-03-10 22:29:06] [INFO ] After 11162ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2023-03-10 22:29:08] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 5 ms to minimize.
[2023-03-10 22:29:08] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 1 ms to minimize.
[2023-03-10 22:29:08] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 1 ms to minimize.
[2023-03-10 22:29:09] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 2 ms to minimize.
[2023-03-10 22:29:09] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 1 ms to minimize.
[2023-03-10 22:29:09] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 1 ms to minimize.
[2023-03-10 22:29:10] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2023-03-10 22:29:10] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 1 ms to minimize.
[2023-03-10 22:29:10] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 1 ms to minimize.
[2023-03-10 22:29:10] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 1 ms to minimize.
[2023-03-10 22:29:11] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 0 ms to minimize.
[2023-03-10 22:29:11] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 0 ms to minimize.
[2023-03-10 22:29:11] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 1 ms to minimize.
[2023-03-10 22:29:12] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 0 ms to minimize.
[2023-03-10 22:29:12] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4464 ms
[2023-03-10 22:29:13] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 0 ms to minimize.
[2023-03-10 22:29:13] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 1 ms to minimize.
[2023-03-10 22:29:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 624 ms
[2023-03-10 22:29:13] [INFO ] After 18230ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :3
Attempting to minimize the solution found.
Minimization took 1085 ms.
[2023-03-10 22:29:14] [INFO ] After 19818ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :3
FORMULA Echo-PT-d04r03-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Echo-PT-d04r03-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Echo-PT-d04r03-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 97 out of 1019 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1019/1019 places, 850/850 transitions.
Graph (complete) has 4450 edges and 1019 vertex of which 923 are kept as prefixes of interest. Removing 96 places using SCC suffix rule.6 ms
Discarding 96 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 923 transition count 843
Applied a total of 7 rules in 102 ms. Remains 923 /1019 variables (removed 96) and now considering 843/850 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 923/1019 places, 843/850 transitions.
Incomplete random walk after 10000 steps, including 63 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :1
FORMULA Echo-PT-d04r03-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 843 rows 923 cols
[2023-03-10 22:29:16] [INFO ] Computed 418 place invariants in 837 ms
[2023-03-10 22:29:16] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 22:29:17] [INFO ] [Nat]Absence check using 0 positive and 418 generalized place invariants in 959 ms returned sat
[2023-03-10 22:29:41] [INFO ] After 25007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 59 out of 923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 923/923 places, 843/843 transitions.
Graph (complete) has 3516 edges and 923 vertex of which 921 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 921 transition count 841
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 920 transition count 840
Applied a total of 4 rules in 108 ms. Remains 920 /923 variables (removed 3) and now considering 840/843 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 920/923 places, 840/843 transitions.
Incomplete random walk after 10000 steps, including 63 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 395063 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 395063 steps, saw 72111 distinct states, run finished after 3003 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 840 rows 920 cols
[2023-03-10 22:29:45] [INFO ] Computed 416 place invariants in 691 ms
[2023-03-10 22:29:45] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 22:30:04] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 22:30:04] [INFO ] [Nat]Absence check using 0 positive and 416 generalized place invariants in 18360 ms returned sat
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
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 22:30:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 22:30:10] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 59 out of 920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 840/840 transitions.
Applied a total of 0 rules in 34 ms. Remains 920 /920 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 920/920 places, 840/840 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 840/840 transitions.
Applied a total of 0 rules in 31 ms. Remains 920 /920 variables (removed 0) and now considering 840/840 (removed 0) transitions.
[2023-03-10 22:30:10] [INFO ] Invariant cache hit.
[2023-03-10 22:32:50] [INFO ] Performed 70/920 implicitness test of which 1 returned IMPLICIT in 159 seconds.
[2023-03-10 22:32:50] [INFO ] Implicit Places using invariants in 160019 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 160022 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 919/920 places, 840/840 transitions.
Applied a total of 0 rules in 36 ms. Remains 919 /919 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 160092 ms. Remains : 919/920 places, 840/840 transitions.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :1
FORMULA Echo-PT-d04r03-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 840 rows 919 cols
[2023-03-10 22:32:51] [INFO ] Computed 415 place invariants in 735 ms
[2023-03-10 22:32:52] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:33:01] [INFO ] [Nat]Absence check using 0 positive and 415 generalized place invariants in 9397 ms returned sat
[2023-03-10 22:33:14] [INFO ] After 12571ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 22:33:16] [INFO ] After 14523ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 725 ms.
[2023-03-10 22:33:17] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 19 ms.
Support contains 33 out of 919 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 919/919 places, 840/840 transitions.
Applied a total of 0 rules in 27 ms. Remains 919 /919 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 919/919 places, 840/840 transitions.
Incomplete random walk after 10000 steps, including 63 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 511943 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 511943 steps, saw 90387 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 22:33:20] [INFO ] Invariant cache hit.
[2023-03-10 22:33:20] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 22:33:21] [INFO ] [Nat]Absence check using 0 positive and 415 generalized place invariants in 892 ms returned sat
[2023-03-10 22:33:30] [INFO ] After 10040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 33 out of 919 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 919/919 places, 840/840 transitions.
Applied a total of 0 rules in 30 ms. Remains 919 /919 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 919/919 places, 840/840 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 919/919 places, 840/840 transitions.
Applied a total of 0 rules in 25 ms. Remains 919 /919 variables (removed 0) and now considering 840/840 (removed 0) transitions.
[2023-03-10 22:33:30] [INFO ] Invariant cache hit.
[2023-03-10 22:34:30] [INFO ] Performed 195/919 implicitness test of which 1 returned IMPLICIT in 60 seconds.
[2023-03-10 22:34:42] [INFO ] Implicit Places using invariants in 71603 ms returned [195, 352]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 71605 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 917/919 places, 840/840 transitions.
Applied a total of 0 rules in 32 ms. Remains 917 /917 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 71663 ms. Remains : 917/919 places, 840/840 transitions.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Finished Best-First random walk after 3158 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=185 )
FORMULA Echo-PT-d04r03-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 349733 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/556/inv_0_ --invariant=/tmp/556/inv_1_ --invariant=/tmp/556/inv_2_ --invariant=/tmp/556/inv_3_ --invariant=/tmp/556/inv_4_ --invariant=/tmp/556/inv_5_ --invariant=/tmp/556/inv_6_ --invariant=/tmp/556/inv_7_ --invariant=/tmp/556/inv_8_ --invariant=/tmp/556/inv_9_ --invariant=/tmp/556/inv_10_ --invariant=/tmp/556/inv_11_ --invariant=/tmp/556/inv_12_ --invariant=/tmp/556/inv_13_ --invariant=/tmp/556/inv_14_ --invariant=/tmp/556/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4654012 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101420 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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Echo-PT-d04r03"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Echo-PT-d04r03, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838855400111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Echo-PT-d04r03.tgz
mv Echo-PT-d04r03 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;