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.r393-oct2-167903717300686.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldPPPt-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717300686
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 20:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 20:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 20:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Feb 25 20:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 20:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 20:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 955K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679470678482

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 07:38:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 07:38:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:38:01] [INFO ] Load time of PNML (sax parser for PT used): 247 ms
[2023-03-22 07:38:01] [INFO ] Transformed 3903 places.
[2023-03-22 07:38:01] [INFO ] Transformed 3553 transitions.
[2023-03-22 07:38:01] [INFO ] Found NUPN structural information;
[2023-03-22 07:38:02] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 580 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 566 ms. (steps per millisecond=17 ) properties (out of 13) seen :8
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 3553 rows 3903 cols
[2023-03-22 07:38:03] [INFO ] Computed 551 place invariants in 53 ms
[2023-03-22 07:38:04] [INFO ] [Real]Absence check using 551 positive place invariants in 554 ms returned sat
[2023-03-22 07:38:05] [INFO ] After 1939ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 07:38:06] [INFO ] [Nat]Absence check using 551 positive place invariants in 449 ms returned sat
[2023-03-22 07:38:14] [INFO ] After 7511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 07:38:20] [INFO ] Deduced a trap composed of 38 places in 1705 ms of which 17 ms to minimize.
[2023-03-22 07:38:22] [INFO ] Deduced a trap composed of 18 places in 2037 ms of which 5 ms to minimize.
[2023-03-22 07:38:25] [INFO ] Deduced a trap composed of 20 places in 2222 ms of which 6 ms to minimize.
[2023-03-22 07:38:26] [INFO ] Deduced a trap composed of 23 places in 1444 ms of which 15 ms to minimize.
[2023-03-22 07:38:28] [INFO ] Deduced a trap composed of 24 places in 1389 ms of which 3 ms to minimize.
[2023-03-22 07:38:29] [INFO ] Deduced a trap composed of 34 places in 1380 ms of which 2 ms to minimize.
[2023-03-22 07:38:31] [INFO ] Deduced a trap composed of 25 places in 1462 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 07:38:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 07:38:31] [INFO ] After 26478ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 724 ms.
Support contains 48 out of 3903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Drop transitions removed 922 transitions
Trivial Post-agglo rules discarded 922 transitions
Performed 922 trivial Post agglomeration. Transition count delta: 922
Iterating post reduction 0 with 922 rules applied. Total rules applied 922 place count 3903 transition count 2631
Reduce places removed 922 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 924 rules applied. Total rules applied 1846 place count 2981 transition count 2629
Reduce places removed 1 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 14 rules applied. Total rules applied 1860 place count 2980 transition count 2616
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 1873 place count 2967 transition count 2616
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 199 Pre rules applied. Total rules applied 1873 place count 2967 transition count 2417
Deduced a syphon composed of 199 places in 6 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 398 rules applied. Total rules applied 2271 place count 2768 transition count 2417
Discarding 339 places :
Symmetric choice reduction at 4 with 339 rule applications. Total rules 2610 place count 2429 transition count 2078
Iterating global reduction 4 with 339 rules applied. Total rules applied 2949 place count 2429 transition count 2078
Performed 146 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 146 Pre rules applied. Total rules applied 2949 place count 2429 transition count 1932
Deduced a syphon composed of 146 places in 13 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 4 with 292 rules applied. Total rules applied 3241 place count 2283 transition count 1932
Performed 826 Post agglomeration using F-continuation condition.Transition count delta: 826
Deduced a syphon composed of 826 places in 4 ms
Reduce places removed 826 places and 0 transitions.
Iterating global reduction 4 with 1652 rules applied. Total rules applied 4893 place count 1457 transition count 1106
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5095 place count 1356 transition count 1106
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 5175 place count 1316 transition count 1106
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 5179 place count 1316 transition count 1102
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 5183 place count 1312 transition count 1102
Partial Free-agglomeration rule applied 142 times.
Drop transitions removed 142 transitions
Iterating global reduction 5 with 142 rules applied. Total rules applied 5325 place count 1312 transition count 1102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 5326 place count 1311 transition count 1101
Applied a total of 5326 rules in 1378 ms. Remains 1311 /3903 variables (removed 2592) and now considering 1101/3553 (removed 2452) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1378 ms. Remains : 1311/3903 places, 1101/3553 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 53272 steps, run timeout after 3011 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 53272 steps, saw 34824 distinct states, run finished after 3012 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1101 rows 1311 cols
[2023-03-22 07:38:37] [INFO ] Computed 551 place invariants in 4 ms
[2023-03-22 07:38:37] [INFO ] [Real]Absence check using 551 positive place invariants in 213 ms returned sat
[2023-03-22 07:38:38] [INFO ] After 597ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 07:38:38] [INFO ] [Nat]Absence check using 551 positive place invariants in 132 ms returned sat
[2023-03-22 07:38:39] [INFO ] After 990ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 07:38:39] [INFO ] State equation strengthened by 215 read => feed constraints.
[2023-03-22 07:38:40] [INFO ] After 1075ms SMT Verify possible using 215 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 07:38:41] [INFO ] Deduced a trap composed of 7 places in 247 ms of which 1 ms to minimize.
[2023-03-22 07:38:41] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 1 ms to minimize.
[2023-03-22 07:38:41] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 1 ms to minimize.
[2023-03-22 07:38:41] [INFO ] Deduced a trap composed of 8 places in 249 ms of which 1 ms to minimize.
[2023-03-22 07:38:42] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 0 ms to minimize.
[2023-03-22 07:38:42] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2023-03-22 07:38:42] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 0 ms to minimize.
[2023-03-22 07:38:42] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 1 ms to minimize.
[2023-03-22 07:38:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2185 ms
[2023-03-22 07:38:43] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 0 ms to minimize.
[2023-03-22 07:38:43] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 0 ms to minimize.
[2023-03-22 07:38:43] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 1 ms to minimize.
[2023-03-22 07:38:44] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 0 ms to minimize.
[2023-03-22 07:38:44] [INFO ] Deduced a trap composed of 8 places in 273 ms of which 1 ms to minimize.
[2023-03-22 07:38:44] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 1 ms to minimize.
[2023-03-22 07:38:45] [INFO ] Deduced a trap composed of 7 places in 695 ms of which 11 ms to minimize.
[2023-03-22 07:38:45] [INFO ] Deduced a trap composed of 7 places in 302 ms of which 1 ms to minimize.
[2023-03-22 07:38:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3049 ms
[2023-03-22 07:38:46] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 1 ms to minimize.
[2023-03-22 07:38:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 481 ms
[2023-03-22 07:38:47] [INFO ] After 7967ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1212 ms.
[2023-03-22 07:38:48] [INFO ] After 10848ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 161 ms.
Support contains 48 out of 1311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1311/1311 places, 1101/1101 transitions.
Applied a total of 0 rules in 57 ms. Remains 1311 /1311 variables (removed 0) and now considering 1101/1101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 1311/1311 places, 1101/1101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1311/1311 places, 1101/1101 transitions.
Applied a total of 0 rules in 58 ms. Remains 1311 /1311 variables (removed 0) and now considering 1101/1101 (removed 0) transitions.
[2023-03-22 07:38:49] [INFO ] Invariant cache hit.
[2023-03-22 07:38:50] [INFO ] Implicit Places using invariants in 962 ms returned []
[2023-03-22 07:38:50] [INFO ] Invariant cache hit.
[2023-03-22 07:38:51] [INFO ] State equation strengthened by 215 read => feed constraints.
[2023-03-22 07:38:54] [INFO ] Implicit Places using invariants and state equation in 4315 ms returned []
Implicit Place search using SMT with State Equation took 5296 ms to find 0 implicit places.
[2023-03-22 07:38:54] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-22 07:38:54] [INFO ] Invariant cache hit.
[2023-03-22 07:38:55] [INFO ] Dead Transitions using invariants and state equation in 1328 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6813 ms. Remains : 1311/1311 places, 1101/1101 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 1311 transition count 1100
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1310 transition count 1100
Partial Free-agglomeration rule applied 305 times.
Drop transitions removed 305 transitions
Iterating global reduction 0 with 305 rules applied. Total rules applied 307 place count 1310 transition count 1100
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 308 place count 1310 transition count 1099
Applied a total of 308 rules in 155 ms. Remains 1310 /1311 variables (removed 1) and now considering 1099/1101 (removed 2) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1099 rows 1310 cols
[2023-03-22 07:38:56] [INFO ] Computed 551 place invariants in 4 ms
[2023-03-22 07:38:56] [INFO ] [Real]Absence check using 551 positive place invariants in 129 ms returned sat
[2023-03-22 07:38:56] [INFO ] After 452ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 07:38:56] [INFO ] [Nat]Absence check using 551 positive place invariants in 130 ms returned sat
[2023-03-22 07:38:58] [INFO ] After 1135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 07:38:58] [INFO ] State equation strengthened by 292 read => feed constraints.
[2023-03-22 07:39:00] [INFO ] After 2097ms SMT Verify possible using 292 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 07:39:00] [INFO ] Deduced a trap composed of 5 places in 287 ms of which 1 ms to minimize.
[2023-03-22 07:39:00] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 1 ms to minimize.
[2023-03-22 07:39:01] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 1 ms to minimize.
[2023-03-22 07:39:01] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2023-03-22 07:39:01] [INFO ] Deduced a trap composed of 6 places in 271 ms of which 1 ms to minimize.
[2023-03-22 07:39:02] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 1 ms to minimize.
[2023-03-22 07:39:02] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 0 ms to minimize.
[2023-03-22 07:39:02] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 0 ms to minimize.
[2023-03-22 07:39:03] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 5 ms to minimize.
[2023-03-22 07:39:03] [INFO ] Deduced a trap composed of 7 places in 263 ms of which 0 ms to minimize.
[2023-03-22 07:39:03] [INFO ] Deduced a trap composed of 7 places in 288 ms of which 1 ms to minimize.
[2023-03-22 07:39:03] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 1 ms to minimize.
[2023-03-22 07:39:04] [INFO ] Deduced a trap composed of 15 places in 243 ms of which 0 ms to minimize.
[2023-03-22 07:39:04] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 1 ms to minimize.
[2023-03-22 07:39:04] [INFO ] Deduced a trap composed of 7 places in 247 ms of which 2 ms to minimize.
[2023-03-22 07:39:05] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 0 ms to minimize.
[2023-03-22 07:39:05] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 13 ms to minimize.
[2023-03-22 07:39:05] [INFO ] Deduced a trap composed of 10 places in 349 ms of which 1 ms to minimize.
[2023-03-22 07:39:05] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5529 ms
[2023-03-22 07:39:06] [INFO ] Deduced a trap composed of 8 places in 504 ms of which 0 ms to minimize.
[2023-03-22 07:39:06] [INFO ] Deduced a trap composed of 7 places in 251 ms of which 1 ms to minimize.
[2023-03-22 07:39:07] [INFO ] Deduced a trap composed of 11 places in 349 ms of which 1 ms to minimize.
[2023-03-22 07:39:07] [INFO ] Deduced a trap composed of 8 places in 307 ms of which 1 ms to minimize.
[2023-03-22 07:39:08] [INFO ] Deduced a trap composed of 17 places in 376 ms of which 1 ms to minimize.
[2023-03-22 07:39:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2191 ms
[2023-03-22 07:39:09] [INFO ] Deduced a trap composed of 5 places in 314 ms of which 1 ms to minimize.
[2023-03-22 07:39:09] [INFO ] Deduced a trap composed of 5 places in 322 ms of which 1 ms to minimize.
[2023-03-22 07:39:09] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 1 ms to minimize.
[2023-03-22 07:39:10] [INFO ] Deduced a trap composed of 8 places in 269 ms of which 1 ms to minimize.
[2023-03-22 07:39:10] [INFO ] Deduced a trap composed of 8 places in 293 ms of which 1 ms to minimize.
[2023-03-22 07:39:10] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 0 ms to minimize.
[2023-03-22 07:39:11] [INFO ] Deduced a trap composed of 6 places in 313 ms of which 1 ms to minimize.
[2023-03-22 07:39:11] [INFO ] Deduced a trap composed of 7 places in 373 ms of which 28 ms to minimize.
[2023-03-22 07:39:12] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 1 ms to minimize.
[2023-03-22 07:39:12] [INFO ] Deduced a trap composed of 9 places in 380 ms of which 0 ms to minimize.
[2023-03-22 07:39:12] [INFO ] Deduced a trap composed of 10 places in 270 ms of which 1 ms to minimize.
[2023-03-22 07:39:13] [INFO ] Deduced a trap composed of 10 places in 293 ms of which 2 ms to minimize.
[2023-03-22 07:39:13] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 1 ms to minimize.
[2023-03-22 07:39:13] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 0 ms to minimize.
[2023-03-22 07:39:14] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 1 ms to minimize.
[2023-03-22 07:39:14] [INFO ] Deduced a trap composed of 18 places in 300 ms of which 14 ms to minimize.
[2023-03-22 07:39:14] [INFO ] Deduced a trap composed of 7 places in 324 ms of which 31 ms to minimize.
[2023-03-22 07:39:15] [INFO ] Deduced a trap composed of 10 places in 362 ms of which 0 ms to minimize.
[2023-03-22 07:39:15] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 14 ms to minimize.
[2023-03-22 07:39:15] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 3 ms to minimize.
[2023-03-22 07:39:16] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 7230 ms
[2023-03-22 07:39:17] [INFO ] Deduced a trap composed of 6 places in 303 ms of which 1 ms to minimize.
[2023-03-22 07:39:17] [INFO ] Deduced a trap composed of 6 places in 285 ms of which 1 ms to minimize.
[2023-03-22 07:39:17] [INFO ] Deduced a trap composed of 11 places in 308 ms of which 0 ms to minimize.
[2023-03-22 07:39:18] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 1 ms to minimize.
[2023-03-22 07:39:18] [INFO ] Deduced a trap composed of 7 places in 326 ms of which 1 ms to minimize.
[2023-03-22 07:39:18] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 0 ms to minimize.
[2023-03-22 07:39:19] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 1 ms to minimize.
[2023-03-22 07:39:19] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 1 ms to minimize.
[2023-03-22 07:39:19] [INFO ] Deduced a trap composed of 9 places in 263 ms of which 1 ms to minimize.
[2023-03-22 07:39:20] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 1 ms to minimize.
[2023-03-22 07:39:20] [INFO ] Deduced a trap composed of 9 places in 345 ms of which 0 ms to minimize.
[2023-03-22 07:39:20] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 0 ms to minimize.
[2023-03-22 07:39:21] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 0 ms to minimize.
[2023-03-22 07:39:21] [INFO ] Deduced a trap composed of 10 places in 345 ms of which 1 ms to minimize.
[2023-03-22 07:39:22] [INFO ] Deduced a trap composed of 10 places in 257 ms of which 1 ms to minimize.
[2023-03-22 07:39:22] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 5440 ms
[2023-03-22 07:39:22] [INFO ] After 23928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3338 ms.
[2023-03-22 07:39:25] [INFO ] After 28989ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-22 07:39:25] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-22 07:39:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1311 places, 1101 transitions and 4951 arcs took 15 ms.
[2023-03-22 07:39:26] [INFO ] Flatten gal took : 137 ms
Total runtime 84708 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 --invariant=/tmp/758/inv_0_ --invariant=/tmp/758/inv_1_ --invariant=/tmp/758/inv_2_ --invariant=/tmp/758/inv_3_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 167788 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16289852 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.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
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="ShieldPPPt-PT-050B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldPPPt-PT-050B, 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 r393-oct2-167903717300686"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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