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.r521-tall-167987246400271.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 EisenbergMcGuire-PT-09, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246400271
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 2.3M Mar 31 16:48 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 EisenbergMcGuire-PT-09-ReachabilityFireability-00
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-01
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-02
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-03
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-04
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-05
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-06
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-07
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-08
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-09
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-10
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-11
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-12
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-13
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-14
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1680849407065

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=EisenbergMcGuire-PT-09
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 06:36:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 06:36:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 06:36:54] [INFO ] Load time of PNML (sax parser for PT used): 642 ms
[2023-04-07 06:36:54] [INFO ] Transformed 891 places.
[2023-04-07 06:36:54] [INFO ] Transformed 3888 transitions.
[2023-04-07 06:36:54] [INFO ] Found NUPN structural information;
[2023-04-07 06:36:54] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 1246 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 55 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 786 ms. (steps per millisecond=12 ) properties (out of 16) seen :2
FORMULA EisenbergMcGuire-PT-09-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 14) 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 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-04-07 06:36:56] [INFO ] Flow matrix only has 1809 transitions (discarded 2079 similar events)
// Phase 1: matrix 1809 rows 891 cols
[2023-04-07 06:36:56] [INFO ] Computed 28 invariants in 76 ms
[2023-04-07 06:37:00] [INFO ] After 2626ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-04-07 06:37:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 112 ms returned sat
[2023-04-07 06:37:01] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2023-04-07 06:37:05] [INFO ] After 3488ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :11
[2023-04-07 06:37:05] [INFO ] State equation strengthened by 932 read => feed constraints.
[2023-04-07 06:37:08] [INFO ] After 2596ms SMT Verify possible using 932 Read/Feed constraints in natural domain returned unsat :3 sat :11
[2023-04-07 06:37:09] [INFO ] Deduced a trap composed of 3 places in 784 ms of which 41 ms to minimize.
[2023-04-07 06:37:16] [INFO ] Deduced a trap composed of 3 places in 6727 ms of which 6 ms to minimize.
[2023-04-07 06:37:28] [INFO ] Deduced a trap composed of 3 places in 12252 ms of which 40 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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-04-07 06:37:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-04-07 06:37:28] [INFO ] After 28218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
FORMULA EisenbergMcGuire-PT-09-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-09-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-09-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 426 ms.
Support contains 157 out of 891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 891 transition count 3886
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 889 transition count 3886
Performed 214 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 214 Pre rules applied. Total rules applied 4 place count 889 transition count 3672
Deduced a syphon composed of 214 places in 4 ms
Reduce places removed 214 places and 0 transitions.
Iterating global reduction 2 with 428 rules applied. Total rules applied 432 place count 675 transition count 3672
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 481 place count 626 transition count 3231
Iterating global reduction 2 with 49 rules applied. Total rules applied 530 place count 626 transition count 3231
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 4 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 660 place count 561 transition count 3166
Applied a total of 660 rules in 841 ms. Remains 561 /891 variables (removed 330) and now considering 3166/3888 (removed 722) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 842 ms. Remains : 561/891 places, 3166/3888 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 55050 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{8=1}
Probabilistic random walk after 55050 steps, saw 42606 distinct states, run finished after 3003 ms. (steps per millisecond=18 ) properties seen :1
FORMULA EisenbergMcGuire-PT-09-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 10 properties.
[2023-04-07 06:37:33] [INFO ] Flow matrix only has 1087 transitions (discarded 2079 similar events)
// Phase 1: matrix 1087 rows 561 cols
[2023-04-07 06:37:33] [INFO ] Computed 28 invariants in 5 ms
[2023-04-07 06:37:34] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-04-07 06:37:34] [INFO ] [Nat]Absence check using 19 positive place invariants in 91 ms returned sat
[2023-04-07 06:37:34] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 14 ms returned sat
[2023-04-07 06:37:36] [INFO ] After 1655ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-04-07 06:37:36] [INFO ] State equation strengthened by 540 read => feed constraints.
[2023-04-07 06:37:38] [INFO ] After 1846ms SMT Verify possible using 540 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-04-07 06:37:38] [INFO ] Deduced a trap composed of 3 places in 395 ms of which 2 ms to minimize.
[2023-04-07 06:37:39] [INFO ] Deduced a trap composed of 3 places in 478 ms of which 0 ms to minimize.
[2023-04-07 06:37:39] [INFO ] Deduced a trap composed of 15 places in 335 ms of which 1 ms to minimize.
[2023-04-07 06:37:40] [INFO ] Deduced a trap composed of 16 places in 299 ms of which 0 ms to minimize.
[2023-04-07 06:37:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1891 ms
[2023-04-07 06:37:40] [INFO ] Deduced a trap composed of 48 places in 268 ms of which 11 ms to minimize.
[2023-04-07 06:37:40] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 0 ms to minimize.
[2023-04-07 06:37:41] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 0 ms to minimize.
[2023-04-07 06:37:41] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 1 ms to minimize.
[2023-04-07 06:37:41] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 1 ms to minimize.
[2023-04-07 06:37:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1346 ms
[2023-04-07 06:37:42] [INFO ] Deduced a trap composed of 3 places in 358 ms of which 1 ms to minimize.
[2023-04-07 06:37:42] [INFO ] Deduced a trap composed of 3 places in 263 ms of which 0 ms to minimize.
[2023-04-07 06:37:42] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 1 ms to minimize.
[2023-04-07 06:37:43] [INFO ] Deduced a trap composed of 22 places in 208 ms of which 0 ms to minimize.
[2023-04-07 06:37:45] [INFO ] Deduced a trap composed of 24 places in 2226 ms of which 23 ms to minimize.
[2023-04-07 06:37:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3732 ms
[2023-04-07 06:37:46] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 0 ms to minimize.
[2023-04-07 06:37:46] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 1 ms to minimize.
[2023-04-07 06:37:46] [INFO ] Deduced a trap composed of 73 places in 179 ms of which 1 ms to minimize.
[2023-04-07 06:37:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 757 ms
[2023-04-07 06:37:47] [INFO ] Deduced a trap composed of 62 places in 181 ms of which 0 ms to minimize.
[2023-04-07 06:37:47] [INFO ] Deduced a trap composed of 124 places in 585 ms of which 7 ms to minimize.
[2023-04-07 06:37:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 961 ms
[2023-04-07 06:37:48] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 0 ms to minimize.
[2023-04-07 06:37:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2023-04-07 06:37:49] [INFO ] After 12791ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1372 ms.
[2023-04-07 06:37:50] [INFO ] After 16576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 151 ms.
Support contains 156 out of 561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 3166/3166 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 561 transition count 3165
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 560 transition count 3165
Applied a total of 2 rules in 660 ms. Remains 560 /561 variables (removed 1) and now considering 3165/3166 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 670 ms. Remains : 560/561 places, 3165/3166 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 57040 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57040 steps, saw 44061 distinct states, run finished after 3021 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 10 properties.
[2023-04-07 06:37:55] [INFO ] Flow matrix only has 1086 transitions (discarded 2079 similar events)
// Phase 1: matrix 1086 rows 560 cols
[2023-04-07 06:37:55] [INFO ] Computed 28 invariants in 4 ms
[2023-04-07 06:37:55] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-04-07 06:37:56] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-04-07 06:37:56] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 16 ms returned sat
[2023-04-07 06:37:57] [INFO ] After 1532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-04-07 06:37:57] [INFO ] State equation strengthened by 540 read => feed constraints.
[2023-04-07 06:37:59] [INFO ] After 1737ms SMT Verify possible using 540 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-04-07 06:38:00] [INFO ] Deduced a trap composed of 45 places in 429 ms of which 1 ms to minimize.
[2023-04-07 06:38:00] [INFO ] Deduced a trap composed of 34 places in 350 ms of which 16 ms to minimize.
[2023-04-07 06:38:01] [INFO ] Deduced a trap composed of 3 places in 454 ms of which 1 ms to minimize.
[2023-04-07 06:38:01] [INFO ] Deduced a trap composed of 3 places in 377 ms of which 1 ms to minimize.
[2023-04-07 06:38:06] [INFO ] Deduced a trap composed of 23 places in 4585 ms of which 24 ms to minimize.
[2023-04-07 06:38:06] [INFO ] Deduced a trap composed of 48 places in 213 ms of which 0 ms to minimize.
[2023-04-07 06:38:06] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 1 ms to minimize.
[2023-04-07 06:38:07] [INFO ] Deduced a trap composed of 3 places in 242 ms of which 1 ms to minimize.
[2023-04-07 06:38:07] [INFO ] Deduced a trap composed of 3 places in 314 ms of which 23 ms to minimize.
[2023-04-07 06:38:07] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 7817 ms
[2023-04-07 06:38:07] [INFO ] Deduced a trap composed of 3 places in 216 ms of which 16 ms to minimize.
[2023-04-07 06:38:08] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 4 ms to minimize.
[2023-04-07 06:38:08] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 1 ms to minimize.
[2023-04-07 06:38:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 729 ms
[2023-04-07 06:38:08] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 0 ms to minimize.
[2023-04-07 06:38:08] [INFO ] Deduced a trap composed of 3 places in 197 ms of which 1 ms to minimize.
[2023-04-07 06:38:09] [INFO ] Deduced a trap composed of 34 places in 234 ms of which 0 ms to minimize.
[2023-04-07 06:38:09] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 1 ms to minimize.
[2023-04-07 06:38:12] [INFO ] Deduced a trap composed of 15 places in 2725 ms of which 1 ms to minimize.
[2023-04-07 06:38:12] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 1 ms to minimize.
[2023-04-07 06:38:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4135 ms
[2023-04-07 06:38:13] [INFO ] Deduced a trap composed of 43 places in 266 ms of which 0 ms to minimize.
[2023-04-07 06:38:13] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 0 ms to minimize.
[2023-04-07 06:38:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 603 ms
[2023-04-07 06:38:14] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 0 ms to minimize.
[2023-04-07 06:38:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
[2023-04-07 06:38:14] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 0 ms to minimize.
[2023-04-07 06:38:14] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 1 ms to minimize.
[2023-04-07 06:38:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 545 ms
[2023-04-07 06:38:15] [INFO ] Deduced a trap composed of 29 places in 240 ms of which 1 ms to minimize.
[2023-04-07 06:38:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2023-04-07 06:38:15] [INFO ] After 17726ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1605 ms.
[2023-04-07 06:38:17] [INFO ] After 21442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 183 ms.
Support contains 156 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 3165/3165 transitions.
Applied a total of 0 rules in 331 ms. Remains 560 /560 variables (removed 0) and now considering 3165/3165 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 345 ms. Remains : 560/560 places, 3165/3165 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 3165/3165 transitions.
Applied a total of 0 rules in 272 ms. Remains 560 /560 variables (removed 0) and now considering 3165/3165 (removed 0) transitions.
[2023-04-07 06:38:18] [INFO ] Flow matrix only has 1086 transitions (discarded 2079 similar events)
[2023-04-07 06:38:18] [INFO ] Invariant cache hit.
[2023-04-07 06:38:18] [INFO ] Implicit Places using invariants in 433 ms returned []
[2023-04-07 06:38:18] [INFO ] Flow matrix only has 1086 transitions (discarded 2079 similar events)
[2023-04-07 06:38:18] [INFO ] Invariant cache hit.
[2023-04-07 06:38:19] [INFO ] State equation strengthened by 540 read => feed constraints.
[2023-04-07 06:38:21] [INFO ] Implicit Places using invariants and state equation in 3448 ms returned []
Implicit Place search using SMT with State Equation took 3895 ms to find 0 implicit places.
[2023-04-07 06:38:22] [INFO ] Redundant transitions in 202 ms returned []
[2023-04-07 06:38:22] [INFO ] Flow matrix only has 1086 transitions (discarded 2079 similar events)
[2023-04-07 06:38:22] [INFO ] Invariant cache hit.
[2023-04-07 06:38:33] [INFO ] Dead Transitions using invariants and state equation in 11778 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16190 ms. Remains : 560/560 places, 3165/3165 transitions.
Graph (trivial) has 1160 edges and 560 vertex of which 68 / 560 are part of one of the 9 SCC in 24 ms
Free SCC test removed 59 places
Drop transitions removed 195 transitions
Ensure Unique test removed 2178 transitions
Reduce isomorphic transitions removed 2373 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 501 transition count 750
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 91 place count 459 transition count 744
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 97 place count 453 transition count 744
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 97 place count 453 transition count 734
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 117 place count 443 transition count 734
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 123 place count 437 transition count 728
Iterating global reduction 3 with 6 rules applied. Total rules applied 129 place count 437 transition count 728
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 18 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 277 place count 363 transition count 654
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 286 place count 363 transition count 645
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 294 place count 359 transition count 674
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 296 place count 359 transition count 672
Drop transitions removed 66 transitions
Redundant transition composition rules discarded 66 transitions
Iterating global reduction 5 with 66 rules applied. Total rules applied 362 place count 359 transition count 606
Free-agglomeration rule applied 92 times.
Iterating global reduction 5 with 92 rules applied. Total rules applied 454 place count 359 transition count 514
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 5 with 92 rules applied. Total rules applied 546 place count 267 transition count 514
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 554 place count 267 transition count 506
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 556 place count 266 transition count 509
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 564 place count 266 transition count 509
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 565 place count 266 transition count 508
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 567 place count 266 transition count 508
Applied a total of 567 rules in 362 ms. Remains 266 /560 variables (removed 294) and now considering 508/3165 (removed 2657) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 508 rows 266 cols
[2023-04-07 06:38:34] [INFO ] Computed 28 invariants in 2 ms
[2023-04-07 06:38:35] [INFO ] After 586ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-04-07 06:38:35] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 06:38:35] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 11 ms returned sat
[2023-04-07 06:38:36] [INFO ] After 929ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-04-07 06:38:37] [INFO ] Deduced a trap composed of 3 places in 916 ms of which 44 ms to minimize.
[2023-04-07 06:38:37] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
[2023-04-07 06:38:37] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-04-07 06:38:37] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 5 ms to minimize.
[2023-04-07 06:38:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1197 ms
[2023-04-07 06:38:37] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2023-04-07 06:38:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-07 06:38:38] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 0 ms to minimize.
[2023-04-07 06:38:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-04-07 06:38:38] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 8 ms to minimize.
[2023-04-07 06:38:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-04-07 06:38:38] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2023-04-07 06:38:38] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2023-04-07 06:38:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 185 ms
[2023-04-07 06:38:38] [INFO ] After 3442ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1121 ms.
[2023-04-07 06:38:40] [INFO ] After 4904ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
[2023-04-07 06:38:40] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 28 ms.
[2023-04-07 06:38:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 560 places, 3165 transitions and 16464 arcs took 81 ms.
[2023-04-07 06:38:41] [INFO ] Flatten gal took : 880 ms
Total runtime 108966 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/684/inv_0_ --invariant=/tmp/684/inv_1_ --invariant=/tmp/684/inv_2_ --invariant=/tmp/684/inv_3_ --invariant=/tmp/684/inv_4_ --invariant=/tmp/684/inv_5_ --invariant=/tmp/684/inv_6_ --invariant=/tmp/684/inv_7_ --invariant=/tmp/684/inv_8_ --invariant=/tmp/684/inv_9_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15198660 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100044 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="EisenbergMcGuire-PT-09"
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 EisenbergMcGuire-PT-09, 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 r521-tall-167987246400271"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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