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-167903715200334.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 ShieldIIPt-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715200334
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 17:03 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.6K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 25 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 17:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 17:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 860K 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 ShieldIIPt-PT-050B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679273733581

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=ShieldIIPt-PT-050B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 00:55:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 00:55:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 00:55:36] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2023-03-20 00:55:37] [INFO ] Transformed 3503 places.
[2023-03-20 00:55:37] [INFO ] Transformed 3253 transitions.
[2023-03-20 00:55:37] [INFO ] Found NUPN structural information;
[2023-03-20 00:55:37] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 456 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 699 ms. (steps per millisecond=14 ) properties (out of 15) seen :7
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 3253 rows 3503 cols
[2023-03-20 00:55:38] [INFO ] Computed 451 place invariants in 63 ms
[2023-03-20 00:55:39] [INFO ] After 1462ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 00:55:41] [INFO ] [Nat]Absence check using 451 positive place invariants in 337 ms returned sat
[2023-03-20 00:55:52] [INFO ] After 9652ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 00:55:56] [INFO ] Deduced a trap composed of 20 places in 1732 ms of which 14 ms to minimize.
[2023-03-20 00:55:58] [INFO ] Deduced a trap composed of 19 places in 2073 ms of which 4 ms to minimize.
[2023-03-20 00:56:01] [INFO ] Deduced a trap composed of 12 places in 1946 ms of which 2 ms to minimize.
[2023-03-20 00:56:02] [INFO ] Deduced a trap composed of 32 places in 1034 ms of which 2 ms to minimize.
[2023-03-20 00:56:03] [INFO ] Deduced a trap composed of 30 places in 1061 ms of which 2 ms to minimize.
[2023-03-20 00:56:05] [INFO ] Deduced a trap composed of 23 places in 1502 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-20 00:56:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 00:56:05] [INFO ] After 25147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 7 different solutions.
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1590 ms.
Support contains 113 out of 3503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Drop transitions removed 772 transitions
Trivial Post-agglo rules discarded 772 transitions
Performed 772 trivial Post agglomeration. Transition count delta: 772
Iterating post reduction 0 with 772 rules applied. Total rules applied 772 place count 3503 transition count 2481
Reduce places removed 772 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 774 rules applied. Total rules applied 1546 place count 2731 transition count 2479
Reduce places removed 1 places and 0 transitions.
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Iterating post reduction 2 with 38 rules applied. Total rules applied 1584 place count 2730 transition count 2442
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 1621 place count 2693 transition count 2442
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 203 Pre rules applied. Total rules applied 1621 place count 2693 transition count 2239
Deduced a syphon composed of 203 places in 6 ms
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 4 with 406 rules applied. Total rules applied 2027 place count 2490 transition count 2239
Discarding 321 places :
Symmetric choice reduction at 4 with 321 rule applications. Total rules 2348 place count 2169 transition count 1918
Iterating global reduction 4 with 321 rules applied. Total rules applied 2669 place count 2169 transition count 1918
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 128 Pre rules applied. Total rules applied 2669 place count 2169 transition count 1790
Deduced a syphon composed of 128 places in 12 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 4 with 256 rules applied. Total rules applied 2925 place count 2041 transition count 1790
Performed 798 Post agglomeration using F-continuation condition.Transition count delta: 798
Deduced a syphon composed of 798 places in 5 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 4 with 1596 rules applied. Total rules applied 4521 place count 1243 transition count 992
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4723 place count 1142 transition count 1047
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 34 places in 5 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 4791 place count 1108 transition count 1064
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4794 place count 1108 transition count 1061
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 4797 place count 1105 transition count 1061
Partial Free-agglomeration rule applied 43 times.
Drop transitions removed 43 transitions
Iterating global reduction 5 with 43 rules applied. Total rules applied 4840 place count 1105 transition count 1061
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4841 place count 1104 transition count 1060
Applied a total of 4841 rules in 1198 ms. Remains 1104 /3503 variables (removed 2399) and now considering 1060/3253 (removed 2193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1199 ms. Remains : 1104/3503 places, 1060/3253 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 61129 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61129 steps, saw 43169 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1060 rows 1104 cols
[2023-03-20 00:56:11] [INFO ] Computed 451 place invariants in 5 ms
[2023-03-20 00:56:12] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 00:56:12] [INFO ] [Nat]Absence check using 451 positive place invariants in 139 ms returned sat
[2023-03-20 00:56:15] [INFO ] After 2607ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 00:56:15] [INFO ] State equation strengthened by 360 read => feed constraints.
[2023-03-20 00:56:17] [INFO ] After 1676ms SMT Verify possible using 360 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 00:56:17] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 13 ms to minimize.
[2023-03-20 00:56:17] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 2 ms to minimize.
[2023-03-20 00:56:18] [INFO ] Deduced a trap composed of 6 places in 245 ms of which 0 ms to minimize.
[2023-03-20 00:56:18] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2023-03-20 00:56:18] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 0 ms to minimize.
[2023-03-20 00:56:18] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
[2023-03-20 00:56:19] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2023-03-20 00:56:19] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 0 ms to minimize.
[2023-03-20 00:56:19] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 0 ms to minimize.
[2023-03-20 00:56:19] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 1 ms to minimize.
[2023-03-20 00:56:20] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2023-03-20 00:56:20] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2023-03-20 00:56:20] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2023-03-20 00:56:20] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2023-03-20 00:56:20] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3502 ms
[2023-03-20 00:56:21] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 1 ms to minimize.
[2023-03-20 00:56:21] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 13 ms to minimize.
[2023-03-20 00:56:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 708 ms
[2023-03-20 00:56:22] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 1 ms to minimize.
[2023-03-20 00:56:22] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 0 ms to minimize.
[2023-03-20 00:56:23] [INFO ] Deduced a trap composed of 12 places in 493 ms of which 1 ms to minimize.
[2023-03-20 00:56:24] [INFO ] Deduced a trap composed of 8 places in 889 ms of which 1 ms to minimize.
[2023-03-20 00:56:25] [INFO ] Deduced a trap composed of 4 places in 937 ms of which 1 ms to minimize.
[2023-03-20 00:56:26] [INFO ] Deduced a trap composed of 8 places in 292 ms of which 0 ms to minimize.
[2023-03-20 00:56:26] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 0 ms to minimize.
[2023-03-20 00:56:26] [INFO ] Deduced a trap composed of 8 places in 241 ms of which 0 ms to minimize.
[2023-03-20 00:56:27] [INFO ] Deduced a trap composed of 10 places in 566 ms of which 1 ms to minimize.
[2023-03-20 00:56:27] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 0 ms to minimize.
[2023-03-20 00:56:28] [INFO ] Deduced a trap composed of 8 places in 226 ms of which 0 ms to minimize.
[2023-03-20 00:56:28] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5909 ms
[2023-03-20 00:56:28] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 1 ms to minimize.
[2023-03-20 00:56:29] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 1 ms to minimize.
[2023-03-20 00:56:29] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 1 ms to minimize.
[2023-03-20 00:56:29] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
[2023-03-20 00:56:30] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 1 ms to minimize.
[2023-03-20 00:56:30] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 1 ms to minimize.
[2023-03-20 00:56:30] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 13 ms to minimize.
[2023-03-20 00:56:30] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 0 ms to minimize.
[2023-03-20 00:56:30] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2436 ms
[2023-03-20 00:56:35] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 1 ms to minimize.
[2023-03-20 00:56:35] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 0 ms to minimize.
[2023-03-20 00:56:35] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 0 ms to minimize.
[2023-03-20 00:56:35] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2023-03-20 00:56:37] [INFO ] Deduced a trap composed of 6 places in 964 ms of which 0 ms to minimize.
[2023-03-20 00:56:37] [INFO ] Deduced a trap composed of 8 places in 333 ms of which 1 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-20 00:56:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 00:56:37] [INFO ] After 25257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 534 ms.
Support contains 113 out of 1104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1104/1104 places, 1060/1060 transitions.
Applied a total of 0 rules in 34 ms. Remains 1104 /1104 variables (removed 0) and now considering 1060/1060 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 1104/1104 places, 1060/1060 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1104/1104 places, 1060/1060 transitions.
Applied a total of 0 rules in 32 ms. Remains 1104 /1104 variables (removed 0) and now considering 1060/1060 (removed 0) transitions.
[2023-03-20 00:56:38] [INFO ] Invariant cache hit.
[2023-03-20 00:56:39] [INFO ] Implicit Places using invariants in 1485 ms returned [1094]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1506 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1103/1104 places, 1060/1060 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 1103 transition count 1059
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1102 transition count 1059
Applied a total of 2 rules in 57 ms. Remains 1102 /1103 variables (removed 1) and now considering 1059/1060 (removed 1) transitions.
// Phase 1: matrix 1059 rows 1102 cols
[2023-03-20 00:56:39] [INFO ] Computed 450 place invariants in 4 ms
[2023-03-20 00:56:40] [INFO ] Implicit Places using invariants in 907 ms returned [1087]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 914 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1101/1104 places, 1059/1060 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1100 transition count 1058
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1100 transition count 1058
Applied a total of 2 rules in 51 ms. Remains 1100 /1101 variables (removed 1) and now considering 1058/1059 (removed 1) transitions.
// Phase 1: matrix 1058 rows 1100 cols
[2023-03-20 00:56:40] [INFO ] Computed 449 place invariants in 4 ms
[2023-03-20 00:56:41] [INFO ] Implicit Places using invariants in 723 ms returned []
[2023-03-20 00:56:41] [INFO ] Invariant cache hit.
[2023-03-20 00:56:42] [INFO ] State equation strengthened by 358 read => feed constraints.
[2023-03-20 00:56:46] [INFO ] Implicit Places using invariants and state equation in 5402 ms returned []
Implicit Place search using SMT with State Equation took 6162 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1100/1104 places, 1058/1060 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 8724 ms. Remains : 1100/1104 places, 1058/1060 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 67860 steps, run timeout after 3010 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67860 steps, saw 47304 distinct states, run finished after 3010 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-20 00:56:51] [INFO ] Invariant cache hit.
[2023-03-20 00:56:51] [INFO ] After 411ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 00:56:52] [INFO ] [Nat]Absence check using 449 positive place invariants in 325 ms returned sat
[2023-03-20 00:56:53] [INFO ] After 1446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 00:56:53] [INFO ] State equation strengthened by 358 read => feed constraints.
[2023-03-20 00:56:56] [INFO ] After 3044ms SMT Verify possible using 358 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 00:56:57] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2023-03-20 00:56:57] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 0 ms to minimize.
[2023-03-20 00:56:57] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 1 ms to minimize.
[2023-03-20 00:56:58] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 2 ms to minimize.
[2023-03-20 00:56:58] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 19 ms to minimize.
[2023-03-20 00:56:58] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 1 ms to minimize.
[2023-03-20 00:56:58] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 0 ms to minimize.
[2023-03-20 00:56:59] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
[2023-03-20 00:56:59] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 13 ms to minimize.
[2023-03-20 00:56:59] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 1 ms to minimize.
[2023-03-20 00:56:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2599 ms
[2023-03-20 00:56:59] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 1 ms to minimize.
[2023-03-20 00:57:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2023-03-20 00:57:00] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2023-03-20 00:57:00] [INFO ] Deduced a trap composed of 8 places in 282 ms of which 0 ms to minimize.
[2023-03-20 00:57:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 647 ms
[2023-03-20 00:57:01] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 1 ms to minimize.
[2023-03-20 00:57:01] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 0 ms to minimize.
[2023-03-20 00:57:02] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2023-03-20 00:57:02] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 1 ms to minimize.
[2023-03-20 00:57:02] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 0 ms to minimize.
[2023-03-20 00:57:02] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 14 ms to minimize.
[2023-03-20 00:57:03] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 1 ms to minimize.
[2023-03-20 00:57:03] [INFO ] Deduced a trap composed of 9 places in 444 ms of which 0 ms to minimize.
[2023-03-20 00:57:04] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 14 ms to minimize.
[2023-03-20 00:57:04] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2995 ms
[2023-03-20 00:57:04] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 1 ms to minimize.
[2023-03-20 00:57:05] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 0 ms to minimize.
[2023-03-20 00:57:05] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 14 ms to minimize.
[2023-03-20 00:57:05] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2023-03-20 00:57:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1136 ms
[2023-03-20 00:57:07] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 0 ms to minimize.
[2023-03-20 00:57:07] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 1 ms to minimize.
[2023-03-20 00:57:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 511 ms
[2023-03-20 00:57:07] [INFO ] After 13988ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 3067 ms.
[2023-03-20 00:57:10] [INFO ] After 19480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 387 ms.
Support contains 113 out of 1100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1100/1100 places, 1058/1058 transitions.
Applied a total of 0 rules in 29 ms. Remains 1100 /1100 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1100/1100 places, 1058/1058 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1100/1100 places, 1058/1058 transitions.
Applied a total of 0 rules in 26 ms. Remains 1100 /1100 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
[2023-03-20 00:57:11] [INFO ] Invariant cache hit.
[2023-03-20 00:57:12] [INFO ] Implicit Places using invariants in 751 ms returned []
[2023-03-20 00:57:12] [INFO ] Invariant cache hit.
[2023-03-20 00:57:13] [INFO ] State equation strengthened by 358 read => feed constraints.
[2023-03-20 00:57:17] [INFO ] Implicit Places using invariants and state equation in 5558 ms returned []
Implicit Place search using SMT with State Equation took 6322 ms to find 0 implicit places.
[2023-03-20 00:57:17] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-20 00:57:17] [INFO ] Invariant cache hit.
[2023-03-20 00:57:18] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7161 ms. Remains : 1100/1100 places, 1058/1058 transitions.
Graph (complete) has 3093 edges and 1100 vertex of which 1099 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 180 times.
Drop transitions removed 180 transitions
Iterating global reduction 0 with 180 rules applied. Total rules applied 181 place count 1099 transition count 1058
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 182 place count 1099 transition count 1057
Applied a total of 182 rules in 81 ms. Remains 1099 /1100 variables (removed 1) and now considering 1057/1058 (removed 1) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 1057 rows 1099 cols
[2023-03-20 00:57:18] [INFO ] Computed 448 place invariants in 4 ms
[2023-03-20 00:57:18] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 00:57:19] [INFO ] [Nat]Absence check using 448 positive place invariants in 551 ms returned sat
[2023-03-20 00:57:23] [INFO ] After 3213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 00:57:23] [INFO ] State equation strengthened by 162 read => feed constraints.
[2023-03-20 00:57:24] [INFO ] After 914ms SMT Verify possible using 162 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 00:57:24] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 1 ms to minimize.
[2023-03-20 00:57:24] [INFO ] Deduced a trap composed of 7 places in 401 ms of which 1 ms to minimize.
[2023-03-20 00:57:25] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 0 ms to minimize.
[2023-03-20 00:57:25] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 0 ms to minimize.
[2023-03-20 00:57:26] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 0 ms to minimize.
[2023-03-20 00:57:26] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2023-03-20 00:57:26] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 0 ms to minimize.
[2023-03-20 00:57:26] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2023-03-20 00:57:26] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 1 ms to minimize.
[2023-03-20 00:57:27] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 1 ms to minimize.
[2023-03-20 00:57:27] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 0 ms to minimize.
[2023-03-20 00:57:27] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2023-03-20 00:57:27] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 0 ms to minimize.
[2023-03-20 00:57:28] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 0 ms to minimize.
[2023-03-20 00:57:28] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 1 ms to minimize.
[2023-03-20 00:57:28] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4057 ms
[2023-03-20 00:57:28] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
[2023-03-20 00:57:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-20 00:57:28] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 0 ms to minimize.
[2023-03-20 00:57:29] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 0 ms to minimize.
[2023-03-20 00:57:29] [INFO ] Deduced a trap composed of 8 places in 341 ms of which 0 ms to minimize.
[2023-03-20 00:57:30] [INFO ] Deduced a trap composed of 5 places in 449 ms of which 0 ms to minimize.
[2023-03-20 00:57:30] [INFO ] Deduced a trap composed of 9 places in 297 ms of which 1 ms to minimize.
[2023-03-20 00:57:31] [INFO ] Deduced a trap composed of 8 places in 429 ms of which 0 ms to minimize.
[2023-03-20 00:57:31] [INFO ] Deduced a trap composed of 9 places in 823 ms of which 1 ms to minimize.
[2023-03-20 00:57:32] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 1 ms to minimize.
[2023-03-20 00:57:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3569 ms
[2023-03-20 00:57:32] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 1 ms to minimize.
[2023-03-20 00:57:33] [INFO ] Deduced a trap composed of 5 places in 468 ms of which 1 ms to minimize.
[2023-03-20 00:57:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 774 ms
[2023-03-20 00:57:33] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 1 ms to minimize.
[2023-03-20 00:57:34] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 0 ms to minimize.
[2023-03-20 00:57:34] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 1 ms to minimize.
[2023-03-20 00:57:34] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 1 ms to minimize.
[2023-03-20 00:57:34] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 1 ms to minimize.
[2023-03-20 00:57:34] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
[2023-03-20 00:57:35] [INFO ] Deduced a trap composed of 4 places in 548 ms of which 1 ms to minimize.
[2023-03-20 00:57:36] [INFO ] Deduced a trap composed of 6 places in 678 ms of which 1 ms to minimize.
[2023-03-20 00:57:36] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 1 ms to minimize.
[2023-03-20 00:57:36] [INFO ] Deduced a trap composed of 7 places in 261 ms of which 1 ms to minimize.
[2023-03-20 00:57:37] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 1 ms to minimize.
[2023-03-20 00:57:37] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3614 ms
[2023-03-20 00:57:38] [INFO ] After 14658ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1545 ms.
[2023-03-20 00:57:39] [INFO ] After 20667ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-20 00:57:39] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 34 ms.
[2023-03-20 00:57:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1100 places, 1058 transitions and 5050 arcs took 8 ms.
[2023-03-20 00:57:40] [INFO ] Flatten gal took : 185 ms
Total runtime 123637 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-050B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/378
ReachabilityCardinality

FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679273863124

--------------------
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/378/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/378/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/378/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
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 # 25 (type EXCL) for 12 ShieldIIPt-PT-050B-ReachabilityCardinality-05
lola: time limit : 514 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 21 (type FNDP) for 12 ShieldIIPt-PT-050B-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type EQUN) for 12 ShieldIIPt-PT-050B-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 24 (type SRCH) for 12 ShieldIIPt-PT-050B-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 24 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityCardinality-05
lola: result : true
lola: markings : 1163
lola: fired transitions : 1190
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 21 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 22 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 25 (type EXCL) for ShieldIIPt-PT-050B-ReachabilityCardinality-05 (obsolete)
lola: FINISHED task # 21 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityCardinality-05
lola: result : unknown
lola: fired transitions : 1341
lola: tried executions : 264
lola: time used : 0.000000
lola: memory pages used : 0
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 # 31 (type EXCL) for 9 ShieldIIPt-PT-050B-ReachabilityCardinality-03
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 27 (type FNDP) for 9 ShieldIIPt-PT-050B-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 28 (type EQUN) for 9 ShieldIIPt-PT-050B-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 30 (type SRCH) for 9 ShieldIIPt-PT-050B-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 27 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityCardinality-03
lola: result : true
lola: fired transitions : 68
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 28 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityCardinality-03 (obsolete)
lola: CANCELED task # 30 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityCardinality-03 (obsolete)
lola: CANCELED task # 31 (type EXCL) for ShieldIIPt-PT-050B-ReachabilityCardinality-03 (obsolete)
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: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 37 (type EXCL) for 6 ShieldIIPt-PT-050B-ReachabilityCardinality-02
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 40 (type FNDP) for 15 ShieldIIPt-PT-050B-ReachabilityCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 41 (type EQUN) for 15 ShieldIIPt-PT-050B-ReachabilityCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 43 (type SRCH) for 15 ShieldIIPt-PT-050B-ReachabilityCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 40 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityCardinality-10
lola: result : true
lola: fired transitions : 91
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 41 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityCardinality-10 (obsolete)
lola: CANCELED task # 43 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityCardinality-10 (obsolete)
lola: LAUNCH task # 47 (type FNDP) for 18 ShieldIIPt-PT-050B-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 48 (type EQUN) for 18 ShieldIIPt-PT-050B-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 50 (type SRCH) for 18 ShieldIIPt-PT-050B-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 50 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityCardinality-15
lola: result : true
lola: markings : 126
lola: fired transitions : 125
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: CANCELED task # 47 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityCardinality-15 (obsolete)
lola: CANCELED task # 48 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityCardinality-15 (obsolete)
lola: LAUNCH task # 33 (type FNDP) for 6 ShieldIIPt-PT-050B-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 34 (type EQUN) for 6 ShieldIIPt-PT-050B-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 36 (type SRCH) for 6 ShieldIIPt-PT-050B-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/378/ReachabilityCardinality-28.sara.
sara: try reading problem file /home/mcc/execution/378/ReachabilityCardinality-22.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 47 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityCardinality-15
lola: result : true
lola: fired transitions : 124
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 33 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityCardinality-02
lola: result : true
lola: fired transitions : 62
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 34 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityCardinality-02 (obsolete)
lola: CANCELED task # 36 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityCardinality-02 (obsolete)
lola: CANCELED task # 37 (type EXCL) for ShieldIIPt-PT-050B-ReachabilityCardinality-02 (obsolete)
lola: LAUNCH task # 58 (type EXCL) for 3 ShieldIIPt-PT-050B-ReachabilityCardinality-01
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 61 (type FNDP) for 0 ShieldIIPt-PT-050B-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 62 (type EQUN) for 0 ShieldIIPt-PT-050B-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 64 (type SRCH) for 0 ShieldIIPt-PT-050B-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 64 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityCardinality-00
lola: result : true
lola: markings : 84
lola: fired transitions : 83
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 61 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 62 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityCardinality-00 (obsolete)
sara: try reading problem file /home/mcc/execution/378/ReachabilityCardinality-34.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: LAUNCH task # 54 (type FNDP) for 3 ShieldIIPt-PT-050B-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 55 (type EQUN) for 3 ShieldIIPt-PT-050B-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 57 (type SRCH) for 3 ShieldIIPt-PT-050B-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 57 (type SRCH) for ShieldIIPt-PT-050B-ReachabilityCardinality-01
lola: result : true
lola: markings : 106
lola: fired transitions : 105
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 54 (type FNDP) for ShieldIIPt-PT-050B-ReachabilityCardinality-01 (obsolete)
lola: CANCELED task # 55 (type EQUN) for ShieldIIPt-PT-050B-ReachabilityCardinality-01 (obsolete)
lola: CANCELED task # 58 (type EXCL) for ShieldIIPt-PT-050B-ReachabilityCardinality-01 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-050B-ReachabilityCardinality-00: AG false tandem / insertion
ShieldIIPt-PT-050B-ReachabilityCardinality-01: AG false tandem / insertion
ShieldIIPt-PT-050B-ReachabilityCardinality-02: EF true findpath
ShieldIIPt-PT-050B-ReachabilityCardinality-03: EF true findpath
ShieldIIPt-PT-050B-ReachabilityCardinality-05: EF true tandem / insertion
ShieldIIPt-PT-050B-ReachabilityCardinality-10: AG false findpath
ShieldIIPt-PT-050B-ReachabilityCardinality-15: AG false tandem / insertion


Time elapsed: 3 secs. Pages in use: 3

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="ShieldIIPt-PT-050B"
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 ShieldIIPt-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 r391-oct2-167903715200334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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