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.r391-oct2-167903714900142.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 lolaxred
Input is ShieldIIPs-PT-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903714900142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 16:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 675K 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 ShieldIIPs-PT-040B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679267425130

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=lolaxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 23:10:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 23:10:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 23:10:28] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2023-03-19 23:10:28] [INFO ] Transformed 2403 places.
[2023-03-19 23:10:28] [INFO ] Transformed 2363 transitions.
[2023-03-19 23:10:28] [INFO ] Found NUPN structural information;
[2023-03-19 23:10:28] [INFO ] Parsed PT model containing 2403 places and 2363 transitions and 7126 arcs in 383 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 13) seen :10
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2363 rows 2403 cols
[2023-03-19 23:10:29] [INFO ] Computed 361 place invariants in 26 ms
[2023-03-19 23:10:29] [INFO ] After 903ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 23:10:30] [INFO ] [Nat]Absence check using 361 positive place invariants in 334 ms returned sat
[2023-03-19 23:10:33] [INFO ] After 2651ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 23:10:36] [INFO ] Deduced a trap composed of 13 places in 1275 ms of which 25 ms to minimize.
[2023-03-19 23:10:37] [INFO ] Deduced a trap composed of 18 places in 1007 ms of which 4 ms to minimize.
[2023-03-19 23:10:38] [INFO ] Deduced a trap composed of 20 places in 924 ms of which 15 ms to minimize.
[2023-03-19 23:10:39] [INFO ] Deduced a trap composed of 22 places in 879 ms of which 28 ms to minimize.
[2023-03-19 23:10:40] [INFO ] Deduced a trap composed of 27 places in 841 ms of which 15 ms to minimize.
[2023-03-19 23:10:41] [INFO ] Deduced a trap composed of 15 places in 960 ms of which 2 ms to minimize.
[2023-03-19 23:10:42] [INFO ] Deduced a trap composed of 37 places in 983 ms of which 1 ms to minimize.
[2023-03-19 23:10:43] [INFO ] Deduced a trap composed of 31 places in 747 ms of which 1 ms to minimize.
[2023-03-19 23:10:44] [INFO ] Deduced a trap composed of 40 places in 874 ms of which 5 ms to minimize.
[2023-03-19 23:10:45] [INFO ] Deduced a trap composed of 23 places in 724 ms of which 2 ms to minimize.
[2023-03-19 23:10:46] [INFO ] Deduced a trap composed of 24 places in 726 ms of which 1 ms to minimize.
[2023-03-19 23:10:47] [INFO ] Deduced a trap composed of 35 places in 853 ms of which 2 ms to minimize.
[2023-03-19 23:10:48] [INFO ] Deduced a trap composed of 29 places in 788 ms of which 1 ms to minimize.
[2023-03-19 23:10:49] [INFO ] Deduced a trap composed of 22 places in 696 ms of which 2 ms to minimize.
[2023-03-19 23:10:50] [INFO ] Deduced a trap composed of 28 places in 821 ms of which 1 ms to minimize.
[2023-03-19 23:10:51] [INFO ] Deduced a trap composed of 28 places in 601 ms of which 2 ms to minimize.
[2023-03-19 23:10:52] [INFO ] Deduced a trap composed of 20 places in 1081 ms of which 2 ms to minimize.
[2023-03-19 23:10:53] [INFO ] Deduced a trap composed of 22 places in 759 ms of which 2 ms to minimize.
[2023-03-19 23:10:54] [INFO ] Deduced a trap composed of 55 places in 753 ms of which 1 ms to minimize.
[2023-03-19 23:10:54] [INFO ] Deduced a trap composed of 56 places in 660 ms of which 2 ms to minimize.
[2023-03-19 23:10:56] [INFO ] Deduced a trap composed of 10 places in 1627 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-19 23:10:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:10:56] [INFO ] After 26666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 291 ms.
Support contains 46 out of 2403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Drop transitions removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 0 with 188 rules applied. Total rules applied 188 place count 2403 transition count 2175
Reduce places removed 188 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 190 rules applied. Total rules applied 378 place count 2215 transition count 2173
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 380 place count 2213 transition count 2173
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 380 place count 2213 transition count 1974
Deduced a syphon composed of 199 places in 6 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 778 place count 2014 transition count 1974
Discarding 270 places :
Symmetric choice reduction at 3 with 270 rule applications. Total rules 1048 place count 1744 transition count 1704
Iterating global reduction 3 with 270 rules applied. Total rules applied 1318 place count 1744 transition count 1704
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 1318 place count 1744 transition count 1589
Deduced a syphon composed of 115 places in 10 ms
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 1548 place count 1629 transition count 1589
Performed 579 Post agglomeration using F-continuation condition.Transition count delta: 579
Deduced a syphon composed of 579 places in 8 ms
Reduce places removed 579 places and 0 transitions.
Iterating global reduction 3 with 1158 rules applied. Total rules applied 2706 place count 1050 transition count 1010
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 267 times.
Drop transitions removed 267 transitions
Iterating global reduction 3 with 267 rules applied. Total rules applied 2973 place count 1050 transition count 1010
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2974 place count 1049 transition count 1009
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2975 place count 1048 transition count 1009
Applied a total of 2975 rules in 710 ms. Remains 1048 /2403 variables (removed 1355) and now considering 1009/2363 (removed 1354) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 711 ms. Remains : 1048/2403 places, 1009/2363 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 3) seen :2
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1009 rows 1048 cols
[2023-03-19 23:10:57] [INFO ] Computed 360 place invariants in 53 ms
[2023-03-19 23:10:58] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:10:58] [INFO ] [Nat]Absence check using 359 positive place invariants in 71 ms returned sat
[2023-03-19 23:10:58] [INFO ] [Nat]Absence check using 359 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 23:10:59] [INFO ] After 799ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:10:59] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 25 ms to minimize.
[2023-03-19 23:10:59] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 1 ms to minimize.
[2023-03-19 23:10:59] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 1 ms to minimize.
[2023-03-19 23:11:00] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 1 ms to minimize.
[2023-03-19 23:11:00] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 0 ms to minimize.
[2023-03-19 23:11:00] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 1 ms to minimize.
[2023-03-19 23:11:00] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 1 ms to minimize.
[2023-03-19 23:11:01] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 0 ms to minimize.
[2023-03-19 23:11:01] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 0 ms to minimize.
[2023-03-19 23:11:01] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 26 ms to minimize.
[2023-03-19 23:11:01] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 0 ms to minimize.
[2023-03-19 23:11:02] [INFO ] Deduced a trap composed of 9 places in 301 ms of which 1 ms to minimize.
[2023-03-19 23:11:02] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 1 ms to minimize.
[2023-03-19 23:11:02] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 0 ms to minimize.
[2023-03-19 23:11:02] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2023-03-19 23:11:02] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2023-03-19 23:11:03] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 1 ms to minimize.
[2023-03-19 23:11:03] [INFO ] Deduced a trap composed of 33 places in 287 ms of which 0 ms to minimize.
[2023-03-19 23:11:03] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 2 ms to minimize.
[2023-03-19 23:11:04] [INFO ] Deduced a trap composed of 25 places in 307 ms of which 1 ms to minimize.
[2023-03-19 23:11:04] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 1 ms to minimize.
[2023-03-19 23:11:04] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 13 ms to minimize.
[2023-03-19 23:11:04] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2023-03-19 23:11:04] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 5360 ms
[2023-03-19 23:11:04] [INFO ] After 6285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-19 23:11:04] [INFO ] After 6613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27 ms.
Support contains 23 out of 1048 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1048/1048 places, 1009/1009 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1048 transition count 1004
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 1043 transition count 1004
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 1043 transition count 1002
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 1041 transition count 1002
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 32 place count 1032 transition count 993
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 39 place count 1032 transition count 993
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 46 place count 1025 transition count 986
Applied a total of 46 rules in 251 ms. Remains 1025 /1048 variables (removed 23) and now considering 986/1009 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 1025/1048 places, 986/1009 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 169835 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 169835 steps, saw 111430 distinct states, run finished after 3004 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 986 rows 1025 cols
[2023-03-19 23:11:08] [INFO ] Computed 360 place invariants in 63 ms
[2023-03-19 23:11:08] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:11:08] [INFO ] [Nat]Absence check using 359 positive place invariants in 58 ms returned sat
[2023-03-19 23:11:08] [INFO ] [Nat]Absence check using 359 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 23:11:09] [INFO ] After 566ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:11:09] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 0 ms to minimize.
[2023-03-19 23:11:09] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 1 ms to minimize.
[2023-03-19 23:11:10] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 1 ms to minimize.
[2023-03-19 23:11:10] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 1 ms to minimize.
[2023-03-19 23:11:10] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 0 ms to minimize.
[2023-03-19 23:11:10] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 13 ms to minimize.
[2023-03-19 23:11:11] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 0 ms to minimize.
[2023-03-19 23:11:11] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 0 ms to minimize.
[2023-03-19 23:11:11] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2023-03-19 23:11:11] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2137 ms
[2023-03-19 23:11:11] [INFO ] After 2779ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-19 23:11:11] [INFO ] After 3137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 23 out of 1025 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1025/1025 places, 986/986 transitions.
Applied a total of 0 rules in 52 ms. Remains 1025 /1025 variables (removed 0) and now considering 986/986 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1025/1025 places, 986/986 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1025/1025 places, 986/986 transitions.
Applied a total of 0 rules in 45 ms. Remains 1025 /1025 variables (removed 0) and now considering 986/986 (removed 0) transitions.
[2023-03-19 23:11:11] [INFO ] Invariant cache hit.
[2023-03-19 23:11:12] [INFO ] Implicit Places using invariants in 637 ms returned []
[2023-03-19 23:11:12] [INFO ] Invariant cache hit.
[2023-03-19 23:11:14] [INFO ] Implicit Places using invariants and state equation in 1711 ms returned []
Implicit Place search using SMT with State Equation took 2350 ms to find 0 implicit places.
[2023-03-19 23:11:14] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-19 23:11:14] [INFO ] Invariant cache hit.
[2023-03-19 23:11:14] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3236 ms. Remains : 1025/1025 places, 986/986 transitions.
Applied a total of 0 rules in 30 ms. Remains 1025 /1025 variables (removed 0) and now considering 986/986 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 23:11:14] [INFO ] Invariant cache hit.
[2023-03-19 23:11:15] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:11:15] [INFO ] [Nat]Absence check using 359 positive place invariants in 67 ms returned sat
[2023-03-19 23:11:15] [INFO ] [Nat]Absence check using 359 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 23:11:15] [INFO ] After 498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:11:16] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
[2023-03-19 23:11:16] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 0 ms to minimize.
[2023-03-19 23:11:16] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2023-03-19 23:11:16] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2023-03-19 23:11:17] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 1 ms to minimize.
[2023-03-19 23:11:17] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2023-03-19 23:11:17] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 1 ms to minimize.
[2023-03-19 23:11:17] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2023-03-19 23:11:18] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 0 ms to minimize.
[2023-03-19 23:11:18] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 0 ms to minimize.
[2023-03-19 23:11:18] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 1 ms to minimize.
[2023-03-19 23:11:18] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 2 ms to minimize.
[2023-03-19 23:11:18] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 0 ms to minimize.
[2023-03-19 23:11:19] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 1 ms to minimize.
[2023-03-19 23:11:19] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 1 ms to minimize.
[2023-03-19 23:11:19] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2023-03-19 23:11:19] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 0 ms to minimize.
[2023-03-19 23:11:20] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 1 ms to minimize.
[2023-03-19 23:11:20] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 1 ms to minimize.
[2023-03-19 23:11:20] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 0 ms to minimize.
[2023-03-19 23:11:20] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4691 ms
[2023-03-19 23:11:20] [INFO ] After 5278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 142 ms.
[2023-03-19 23:11:20] [INFO ] After 5675ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-19 23:11:20] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 11 ms.
[2023-03-19 23:11:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1025 places, 986 transitions and 4633 arcs took 13 ms.
[2023-03-19 23:11:21] [INFO ] Flatten gal took : 132 ms
Total runtime 53271 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-040B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/381
ReachabilityCardinality

FORMULA ShieldIIPs-PT-040B-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679267482045

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/381/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/381/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/381/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 7 (type EXCL) for 0 ShieldIIPs-PT-040B-ReachabilityCardinality-00
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 ShieldIIPs-PT-040B-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 ShieldIIPs-PT-040B-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 6 (type SRCH) for 0 ShieldIIPs-PT-040B-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 6 (type SRCH) for ShieldIIPs-PT-040B-ReachabilityCardinality-00
lola: result : true
lola: markings : 153
lola: fired transitions : 152
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for ShieldIIPs-PT-040B-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 4 (type EQUN) for ShieldIIPs-PT-040B-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 7 (type EXCL) for ShieldIIPs-PT-040B-ReachabilityCardinality-00 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-040B-ReachabilityCardinality-00: EF true tandem / insertion


Time elapsed: 1 secs. Pages in use: 2

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="ShieldIIPs-PT-040B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ShieldIIPs-PT-040B, 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 r391-oct2-167903714900142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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