fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r391-oct2-167903715000175
Last Updated
May 14, 2023

About the Execution of LoLa+red for ShieldIIPs-PT-100B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1272.531 254880.00 364632.00 82.10 FTFTTFTFFFTTFTTT normal

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-167903715000175.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-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715000175
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:40 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.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 25 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:41 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 1.7M 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-100B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679269482241

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 23:44:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 23:44:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 23:44:45] [INFO ] Load time of PNML (sax parser for PT used): 408 ms
[2023-03-19 23:44:46] [INFO ] Transformed 6003 places.
[2023-03-19 23:44:46] [INFO ] Transformed 5903 transitions.
[2023-03-19 23:44:46] [INFO ] Found NUPN structural information;
[2023-03-19 23:44:46] [INFO ] Parsed PT model containing 6003 places and 5903 transitions and 17806 arcs in 847 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 699 ms. (steps per millisecond=14 ) properties (out of 16) seen :5
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 5903 rows 6003 cols
[2023-03-19 23:44:47] [INFO ] Computed 901 place invariants in 115 ms
[2023-03-19 23:44:50] [INFO ] After 2959ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 23:44:55] [INFO ] [Nat]Absence check using 901 positive place invariants in 1143 ms returned sat
[2023-03-19 23:45:15] [INFO ] After 19220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-19 23:45:15] [INFO ] After 19238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-19 23:45:15] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 441 ms.
Support contains 176 out of 6003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Drop transitions removed 470 transitions
Trivial Post-agglo rules discarded 470 transitions
Performed 470 trivial Post agglomeration. Transition count delta: 470
Iterating post reduction 0 with 470 rules applied. Total rules applied 470 place count 6003 transition count 5433
Reduce places removed 470 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 477 rules applied. Total rules applied 947 place count 5533 transition count 5426
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 954 place count 5526 transition count 5426
Performed 496 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 496 Pre rules applied. Total rules applied 954 place count 5526 transition count 4930
Deduced a syphon composed of 496 places in 57 ms
Reduce places removed 496 places and 0 transitions.
Iterating global reduction 3 with 992 rules applied. Total rules applied 1946 place count 5030 transition count 4930
Discarding 675 places :
Symmetric choice reduction at 3 with 675 rule applications. Total rules 2621 place count 4355 transition count 4255
Iterating global reduction 3 with 675 rules applied. Total rules applied 3296 place count 4355 transition count 4255
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 251 Pre rules applied. Total rules applied 3296 place count 4355 transition count 4004
Deduced a syphon composed of 251 places in 23 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 3 with 502 rules applied. Total rules applied 3798 place count 4104 transition count 4004
Performed 1444 Post agglomeration using F-continuation condition.Transition count delta: 1444
Deduced a syphon composed of 1444 places in 37 ms
Reduce places removed 1444 places and 0 transitions.
Iterating global reduction 3 with 2888 rules applied. Total rules applied 6686 place count 2660 transition count 2560
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 650 times.
Drop transitions removed 650 transitions
Iterating global reduction 3 with 650 rules applied. Total rules applied 7336 place count 2660 transition count 2560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7337 place count 2659 transition count 2559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7338 place count 2658 transition count 2559
Applied a total of 7338 rules in 3037 ms. Remains 2658 /6003 variables (removed 3345) and now considering 2559/5903 (removed 3344) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3038 ms. Remains : 2658/6003 places, 2559/5903 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 528 ms. (steps per millisecond=18 ) properties (out of 11) seen :5
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2559 rows 2658 cols
[2023-03-19 23:45:20] [INFO ] Computed 900 place invariants in 128 ms
[2023-03-19 23:45:21] [INFO ] After 594ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 23:45:22] [INFO ] [Nat]Absence check using 881 positive place invariants in 404 ms returned sat
[2023-03-19 23:45:22] [INFO ] [Nat]Absence check using 881 positive and 19 generalized place invariants in 5 ms returned sat
[2023-03-19 23:45:28] [INFO ] After 5144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 23:45:29] [INFO ] Deduced a trap composed of 5 places in 612 ms of which 6 ms to minimize.
[2023-03-19 23:45:36] [INFO ] Deduced a trap composed of 3 places in 6674 ms of which 4 ms to minimize.
[2023-03-19 23:45:38] [INFO ] Deduced a trap composed of 13 places in 2054 ms of which 2 ms to minimize.
[2023-03-19 23:45:40] [INFO ] Deduced a trap composed of 14 places in 1925 ms of which 13 ms to minimize.
[2023-03-19 23:45:41] [INFO ] Deduced a trap composed of 5 places in 626 ms of which 1 ms to minimize.
[2023-03-19 23:45:41] [INFO ] Deduced a trap composed of 19 places in 664 ms of which 1 ms to minimize.
[2023-03-19 23:45:42] [INFO ] Deduced a trap composed of 11 places in 541 ms of which 13 ms to minimize.
[2023-03-19 23:45:43] [INFO ] Deduced a trap composed of 13 places in 554 ms of which 1 ms to minimize.
[2023-03-19 23:45:44] [INFO ] Deduced a trap composed of 16 places in 553 ms of which 1 ms to minimize.
[2023-03-19 23:45:44] [INFO ] Deduced a trap composed of 13 places in 719 ms of which 13 ms to minimize.
[2023-03-19 23:45:45] [INFO ] Deduced a trap composed of 16 places in 636 ms of which 14 ms to minimize.
[2023-03-19 23:45:46] [INFO ] Deduced a trap composed of 14 places in 486 ms of which 0 ms to minimize.
[2023-03-19 23:45:47] [INFO ] Deduced a trap composed of 16 places in 604 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-19 23:45:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:45:47] [INFO ] After 25636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 1251 ms.
Support contains 125 out of 2658 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2658/2658 places, 2559/2559 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 2658 transition count 2555
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 2654 transition count 2555
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 8 place count 2654 transition count 2545
Deduced a syphon composed of 10 places in 11 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 28 place count 2644 transition count 2545
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 14 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 86 place count 2615 transition count 2516
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 100 place count 2615 transition count 2516
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 2613 transition count 2514
Applied a total of 102 rules in 400 ms. Remains 2613 /2658 variables (removed 45) and now considering 2514/2559 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 400 ms. Remains : 2613/2658 places, 2514/2559 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 494 ms. (steps per millisecond=20 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 50587 steps, run timeout after 3011 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 50587 steps, saw 49019 distinct states, run finished after 3014 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2514 rows 2613 cols
[2023-03-19 23:45:52] [INFO ] Computed 900 place invariants in 33 ms
[2023-03-19 23:45:53] [INFO ] After 810ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 23:45:55] [INFO ] [Nat]Absence check using 886 positive place invariants in 735 ms returned sat
[2023-03-19 23:45:55] [INFO ] [Nat]Absence check using 886 positive and 14 generalized place invariants in 91 ms returned sat
[2023-03-19 23:45:59] [INFO ] After 4216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 23:46:01] [INFO ] Deduced a trap composed of 7 places in 769 ms of which 1 ms to minimize.
[2023-03-19 23:46:02] [INFO ] Deduced a trap composed of 11 places in 935 ms of which 1 ms to minimize.
[2023-03-19 23:46:02] [INFO ] Deduced a trap composed of 10 places in 415 ms of which 0 ms to minimize.
[2023-03-19 23:46:03] [INFO ] Deduced a trap composed of 12 places in 396 ms of which 3 ms to minimize.
[2023-03-19 23:46:03] [INFO ] Deduced a trap composed of 9 places in 435 ms of which 1 ms to minimize.
[2023-03-19 23:46:04] [INFO ] Deduced a trap composed of 5 places in 544 ms of which 1 ms to minimize.
[2023-03-19 23:46:04] [INFO ] Deduced a trap composed of 19 places in 348 ms of which 0 ms to minimize.
[2023-03-19 23:46:05] [INFO ] Deduced a trap composed of 6 places in 650 ms of which 1 ms to minimize.
[2023-03-19 23:46:06] [INFO ] Deduced a trap composed of 13 places in 587 ms of which 1 ms to minimize.
[2023-03-19 23:46:07] [INFO ] Deduced a trap composed of 20 places in 1254 ms of which 0 ms to minimize.
[2023-03-19 23:46:08] [INFO ] Deduced a trap composed of 11 places in 425 ms of which 1 ms to minimize.
[2023-03-19 23:46:09] [INFO ] Deduced a trap composed of 6 places in 882 ms of which 1 ms to minimize.
[2023-03-19 23:46:09] [INFO ] Deduced a trap composed of 7 places in 384 ms of which 1 ms to minimize.
[2023-03-19 23:46:10] [INFO ] Deduced a trap composed of 14 places in 754 ms of which 1 ms to minimize.
[2023-03-19 23:46:11] [INFO ] Deduced a trap composed of 20 places in 694 ms of which 0 ms to minimize.
[2023-03-19 23:46:12] [INFO ] Deduced a trap composed of 6 places in 431 ms of which 0 ms to minimize.
[2023-03-19 23:46:12] [INFO ] Deduced a trap composed of 11 places in 434 ms of which 1 ms to minimize.
[2023-03-19 23:46:13] [INFO ] Deduced a trap composed of 19 places in 457 ms of which 1 ms to minimize.
[2023-03-19 23:46:14] [INFO ] Deduced a trap composed of 12 places in 530 ms of which 1 ms to minimize.
[2023-03-19 23:46:14] [INFO ] Deduced a trap composed of 9 places in 337 ms of which 1 ms to minimize.
[2023-03-19 23:46:15] [INFO ] Deduced a trap composed of 14 places in 404 ms of which 5 ms to minimize.
[2023-03-19 23:46:15] [INFO ] Deduced a trap composed of 13 places in 515 ms of which 1 ms to minimize.
[2023-03-19 23:46:16] [INFO ] Deduced a trap composed of 24 places in 388 ms of which 3 ms to minimize.
[2023-03-19 23:46:16] [INFO ] Deduced a trap composed of 13 places in 333 ms of which 1 ms to minimize.
[2023-03-19 23:46:17] [INFO ] Deduced a trap composed of 14 places in 521 ms of which 1 ms to minimize.
[2023-03-19 23:46:17] [INFO ] Deduced a trap composed of 21 places in 354 ms of which 1 ms to minimize.
[2023-03-19 23:46:18] [INFO ] Deduced a trap composed of 26 places in 341 ms of which 0 ms to minimize.
[2023-03-19 23:46:18] [INFO ] Deduced a trap composed of 15 places in 315 ms of which 0 ms to minimize.
[2023-03-19 23:46:22] [INFO ] Deduced a trap composed of 2 places in 3680 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:46:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:46:22] [INFO ] After 28695ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 1051 ms.
Support contains 125 out of 2613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2613/2613 places, 2514/2514 transitions.
Applied a total of 0 rules in 91 ms. Remains 2613 /2613 variables (removed 0) and now considering 2514/2514 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 2613/2613 places, 2514/2514 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2613/2613 places, 2514/2514 transitions.
Applied a total of 0 rules in 89 ms. Remains 2613 /2613 variables (removed 0) and now considering 2514/2514 (removed 0) transitions.
[2023-03-19 23:46:23] [INFO ] Invariant cache hit.
[2023-03-19 23:46:28] [INFO ] Implicit Places using invariants in 4345 ms returned []
[2023-03-19 23:46:28] [INFO ] Invariant cache hit.
[2023-03-19 23:46:33] [INFO ] Implicit Places using invariants and state equation in 5872 ms returned []
Implicit Place search using SMT with State Equation took 10228 ms to find 0 implicit places.
[2023-03-19 23:46:34] [INFO ] Redundant transitions in 307 ms returned []
[2023-03-19 23:46:34] [INFO ] Invariant cache hit.
[2023-03-19 23:46:38] [INFO ] Dead Transitions using invariants and state equation in 3692 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14373 ms. Remains : 2613/2613 places, 2514/2514 transitions.
Applied a total of 0 rules in 86 ms. Remains 2613 /2613 variables (removed 0) and now considering 2514/2514 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-19 23:46:38] [INFO ] Invariant cache hit.
[2023-03-19 23:46:38] [INFO ] After 597ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 23:46:40] [INFO ] [Nat]Absence check using 886 positive place invariants in 672 ms returned sat
[2023-03-19 23:46:40] [INFO ] [Nat]Absence check using 886 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-19 23:46:44] [INFO ] After 4139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 23:46:45] [INFO ] Deduced a trap composed of 6 places in 359 ms of which 1 ms to minimize.
[2023-03-19 23:46:46] [INFO ] Deduced a trap composed of 9 places in 701 ms of which 13 ms to minimize.
[2023-03-19 23:46:46] [INFO ] Deduced a trap composed of 11 places in 411 ms of which 1 ms to minimize.
[2023-03-19 23:46:47] [INFO ] Deduced a trap composed of 5 places in 268 ms of which 1 ms to minimize.
[2023-03-19 23:46:48] [INFO ] Deduced a trap composed of 10 places in 665 ms of which 1 ms to minimize.
[2023-03-19 23:46:48] [INFO ] Deduced a trap composed of 14 places in 563 ms of which 1 ms to minimize.
[2023-03-19 23:46:49] [INFO ] Deduced a trap composed of 6 places in 880 ms of which 0 ms to minimize.
[2023-03-19 23:46:50] [INFO ] Deduced a trap composed of 7 places in 304 ms of which 1 ms to minimize.
[2023-03-19 23:46:50] [INFO ] Deduced a trap composed of 14 places in 358 ms of which 13 ms to minimize.
[2023-03-19 23:46:51] [INFO ] Deduced a trap composed of 9 places in 382 ms of which 0 ms to minimize.
[2023-03-19 23:46:52] [INFO ] Deduced a trap composed of 7 places in 434 ms of which 1 ms to minimize.
[2023-03-19 23:46:52] [INFO ] Deduced a trap composed of 10 places in 730 ms of which 0 ms to minimize.
[2023-03-19 23:46:54] [INFO ] Deduced a trap composed of 14 places in 916 ms of which 1 ms to minimize.
[2023-03-19 23:46:54] [INFO ] Deduced a trap composed of 6 places in 406 ms of which 11 ms to minimize.
[2023-03-19 23:46:55] [INFO ] Deduced a trap composed of 12 places in 641 ms of which 1 ms to minimize.
[2023-03-19 23:46:55] [INFO ] Deduced a trap composed of 14 places in 350 ms of which 0 ms to minimize.
[2023-03-19 23:46:56] [INFO ] Deduced a trap composed of 11 places in 604 ms of which 1 ms to minimize.
[2023-03-19 23:46:58] [INFO ] Deduced a trap composed of 14 places in 1956 ms of which 2 ms to minimize.
[2023-03-19 23:47:01] [INFO ] Deduced a trap composed of 12 places in 2291 ms of which 2 ms to minimize.
[2023-03-19 23:47:01] [INFO ] Deduced a trap composed of 16 places in 340 ms of which 1 ms to minimize.
[2023-03-19 23:47:02] [INFO ] Deduced a trap composed of 11 places in 389 ms of which 1 ms to minimize.
[2023-03-19 23:47:02] [INFO ] Deduced a trap composed of 13 places in 536 ms of which 2 ms to minimize.
[2023-03-19 23:47:03] [INFO ] Deduced a trap composed of 13 places in 323 ms of which 14 ms to minimize.
[2023-03-19 23:47:03] [INFO ] Deduced a trap composed of 9 places in 372 ms of which 1 ms to minimize.
[2023-03-19 23:47:04] [INFO ] Deduced a trap composed of 18 places in 334 ms of which 2 ms to minimize.
[2023-03-19 23:47:04] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 8 ms to minimize.
[2023-03-19 23:47:05] [INFO ] Deduced a trap composed of 11 places in 351 ms of which 14 ms to minimize.
[2023-03-19 23:47:05] [INFO ] Deduced a trap composed of 11 places in 433 ms of which 1 ms to minimize.
[2023-03-19 23:47:06] [INFO ] Deduced a trap composed of 14 places in 366 ms of which 1 ms to minimize.
[2023-03-19 23:47:06] [INFO ] Deduced a trap composed of 9 places in 325 ms of which 0 ms to minimize.
[2023-03-19 23:47:06] [INFO ] Deduced a trap composed of 18 places in 299 ms of which 1 ms to minimize.
[2023-03-19 23:47:07] [INFO ] Deduced a trap composed of 12 places in 489 ms of which 5 ms to minimize.
[2023-03-19 23:47:07] [INFO ] Deduced a trap composed of 24 places in 230 ms of which 0 ms to minimize.
[2023-03-19 23:47:08] [INFO ] Deduced a trap composed of 18 places in 616 ms of which 1 ms to minimize.
[2023-03-19 23:47:09] [INFO ] Deduced a trap composed of 11 places in 298 ms of which 1 ms to minimize.
[2023-03-19 23:47:09] [INFO ] Deduced a trap composed of 14 places in 260 ms of which 1 ms to minimize.
[2023-03-19 23:47:09] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 1 ms to minimize.
[2023-03-19 23:47:10] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 1 ms to minimize.
[2023-03-19 23:47:10] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 1 ms to minimize.
[2023-03-19 23:47:10] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 1 ms to minimize.
[2023-03-19 23:47:11] [INFO ] Deduced a trap composed of 32 places in 303 ms of which 0 ms to minimize.
[2023-03-19 23:47:11] [INFO ] Deduced a trap composed of 8 places in 270 ms of which 1 ms to minimize.
[2023-03-19 23:47:12] [INFO ] Deduced a trap composed of 15 places in 257 ms of which 0 ms to minimize.
[2023-03-19 23:47:12] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 0 ms to minimize.
[2023-03-19 23:47:12] [INFO ] Deduced a trap composed of 14 places in 426 ms of which 0 ms to minimize.
[2023-03-19 23:47:13] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 28197 ms
[2023-03-19 23:47:15] [INFO ] Deduced a trap composed of 11 places in 929 ms of which 2 ms to minimize.
[2023-03-19 23:47:16] [INFO ] Deduced a trap composed of 11 places in 1333 ms of which 2 ms to minimize.
[2023-03-19 23:47:18] [INFO ] Deduced a trap composed of 9 places in 2102 ms of which 1 ms to minimize.
[2023-03-19 23:47:20] [INFO ] Deduced a trap composed of 16 places in 1606 ms of which 2 ms to minimize.
[2023-03-19 23:47:22] [INFO ] Deduced a trap composed of 22 places in 1132 ms of which 2 ms to minimize.
[2023-03-19 23:47:24] [INFO ] Deduced a trap composed of 4 places in 2440 ms of which 2 ms to minimize.
[2023-03-19 23:47:26] [INFO ] Deduced a trap composed of 17 places in 1944 ms of which 3 ms to minimize.
[2023-03-19 23:47:28] [INFO ] Deduced a trap composed of 11 places in 1616 ms of which 3 ms to minimize.
[2023-03-19 23:47:30] [INFO ] Deduced a trap composed of 8 places in 1139 ms of which 1 ms to minimize.
[2023-03-19 23:47:34] [INFO ] Deduced a trap composed of 10 places in 4550 ms of which 2 ms to minimize.
[2023-03-19 23:47:37] [INFO ] Deduced a trap composed of 11 places in 2239 ms of which 2 ms to minimize.
[2023-03-19 23:47:38] [INFO ] Deduced a trap composed of 16 places in 1415 ms of which 2 ms to minimize.
[2023-03-19 23:47:43] [INFO ] Deduced a trap composed of 19 places in 4501 ms of which 3 ms to minimize.
[2023-03-19 23:47:44] [INFO ] Deduced a trap composed of 13 places in 1104 ms of which 1 ms to minimize.
[2023-03-19 23:47:44] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 30626 ms
[2023-03-19 23:47:46] [INFO ] Deduced a trap composed of 9 places in 690 ms of which 0 ms to minimize.
[2023-03-19 23:47:46] [INFO ] Deduced a trap composed of 8 places in 395 ms of which 1 ms to minimize.
[2023-03-19 23:47:47] [INFO ] Deduced a trap composed of 13 places in 427 ms of which 1 ms to minimize.
[2023-03-19 23:47:47] [INFO ] Deduced a trap composed of 9 places in 511 ms of which 2 ms to minimize.
[2023-03-19 23:47:48] [INFO ] Deduced a trap composed of 13 places in 537 ms of which 1 ms to minimize.
[2023-03-19 23:47:49] [INFO ] Deduced a trap composed of 15 places in 523 ms of which 1 ms to minimize.
[2023-03-19 23:47:50] [INFO ] Deduced a trap composed of 13 places in 705 ms of which 1 ms to minimize.
[2023-03-19 23:47:50] [INFO ] Deduced a trap composed of 11 places in 490 ms of which 1 ms to minimize.
[2023-03-19 23:47:51] [INFO ] Deduced a trap composed of 18 places in 483 ms of which 1 ms to minimize.
[2023-03-19 23:47:51] [INFO ] Deduced a trap composed of 9 places in 526 ms of which 1 ms to minimize.
[2023-03-19 23:47:52] [INFO ] Deduced a trap composed of 6 places in 675 ms of which 2 ms to minimize.
[2023-03-19 23:47:53] [INFO ] Deduced a trap composed of 10 places in 606 ms of which 1 ms to minimize.
[2023-03-19 23:48:01] [INFO ] Deduced a trap composed of 10 places in 7587 ms of which 1 ms to minimize.
[2023-03-19 23:48:01] [INFO ] Deduced a trap composed of 12 places in 524 ms of which 2 ms to minimize.
[2023-03-19 23:48:02] [INFO ] Deduced a trap composed of 10 places in 506 ms of which 1 ms to minimize.
[2023-03-19 23:48:03] [INFO ] Deduced a trap composed of 9 places in 426 ms of which 1 ms to minimize.
[2023-03-19 23:48:03] [INFO ] Deduced a trap composed of 19 places in 316 ms of which 1 ms to minimize.
[2023-03-19 23:48:04] [INFO ] Deduced a trap composed of 14 places in 476 ms of which 1 ms to minimize.
[2023-03-19 23:48:08] [INFO ] Deduced a trap composed of 13 places in 4501 ms of which 27 ms to minimize.
[2023-03-19 23:48:09] [INFO ] Deduced a trap composed of 13 places in 486 ms of which 1 ms to minimize.
[2023-03-19 23:48:10] [INFO ] Deduced a trap composed of 11 places in 485 ms of which 1 ms to minimize.
[2023-03-19 23:48:10] [INFO ] Deduced a trap composed of 15 places in 500 ms of which 13 ms to minimize.
[2023-03-19 23:48:11] [INFO ] Deduced a trap composed of 15 places in 459 ms of which 3 ms to minimize.
[2023-03-19 23:48:11] [INFO ] Deduced a trap composed of 5 places in 338 ms of which 2 ms to minimize.
[2023-03-19 23:48:12] [INFO ] Deduced a trap composed of 14 places in 305 ms of which 1 ms to minimize.
[2023-03-19 23:48:12] [INFO ] Deduced a trap composed of 17 places in 452 ms of which 0 ms to minimize.
[2023-03-19 23:48:13] [INFO ] Deduced a trap composed of 15 places in 368 ms of which 1 ms to minimize.
[2023-03-19 23:48:14] [INFO ] Deduced a trap composed of 22 places in 1065 ms of which 1 ms to minimize.
[2023-03-19 23:48:14] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 29417 ms
[2023-03-19 23:48:17] [INFO ] Deduced a trap composed of 8 places in 1745 ms of which 1 ms to minimize.
[2023-03-19 23:48:17] [INFO ] Deduced a trap composed of 5 places in 325 ms of which 1 ms to minimize.
[2023-03-19 23:48:18] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 0 ms to minimize.
[2023-03-19 23:48:18] [INFO ] Deduced a trap composed of 5 places in 468 ms of which 1 ms to minimize.
[2023-03-19 23:48:19] [INFO ] Deduced a trap composed of 7 places in 276 ms of which 0 ms to minimize.
[2023-03-19 23:48:19] [INFO ] Deduced a trap composed of 6 places in 468 ms of which 0 ms to minimize.
[2023-03-19 23:48:21] [INFO ] Deduced a trap composed of 7 places in 1567 ms of which 0 ms to minimize.
[2023-03-19 23:48:23] [INFO ] Deduced a trap composed of 11 places in 1730 ms of which 2 ms to minimize.
[2023-03-19 23:48:24] [INFO ] Deduced a trap composed of 7 places in 718 ms of which 0 ms to minimize.
[2023-03-19 23:48:24] [INFO ] Deduced a trap composed of 5 places in 407 ms of which 1 ms to minimize.
[2023-03-19 23:48:25] [INFO ] Deduced a trap composed of 6 places in 407 ms of which 2 ms to minimize.
[2023-03-19 23:48:25] [INFO ] Deduced a trap composed of 8 places in 500 ms of which 1 ms to minimize.
[2023-03-19 23:48:26] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 1 ms to minimize.
[2023-03-19 23:48:26] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 1 ms to minimize.
[2023-03-19 23:48:27] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 1 ms to minimize.
[2023-03-19 23:48:27] [INFO ] Deduced a trap composed of 16 places in 284 ms of which 1 ms to minimize.
[2023-03-19 23:48:28] [INFO ] Deduced a trap composed of 22 places in 556 ms of which 1 ms to minimize.
[2023-03-19 23:48:28] [INFO ] Deduced a trap composed of 16 places in 441 ms of which 1 ms to minimize.
[2023-03-19 23:48:29] [INFO ] Deduced a trap composed of 14 places in 380 ms of which 1 ms to minimize.
[2023-03-19 23:48:29] [INFO ] Deduced a trap composed of 16 places in 292 ms of which 1 ms to minimize.
[2023-03-19 23:48:30] [INFO ] Deduced a trap composed of 14 places in 329 ms of which 0 ms to minimize.
[2023-03-19 23:48:30] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 1 ms to minimize.
[2023-03-19 23:48:30] [INFO ] Deduced a trap composed of 8 places in 286 ms of which 1 ms to minimize.
[2023-03-19 23:48:31] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 0 ms to minimize.
[2023-03-19 23:48:31] [INFO ] Deduced a trap composed of 11 places in 481 ms of which 1 ms to minimize.
[2023-03-19 23:48:32] [INFO ] Deduced a trap composed of 11 places in 771 ms of which 1 ms to minimize.
[2023-03-19 23:48:33] [INFO ] Deduced a trap composed of 13 places in 464 ms of which 0 ms to minimize.
[2023-03-19 23:48:33] [INFO ] Deduced a trap composed of 22 places in 276 ms of which 1 ms to minimize.
[2023-03-19 23:48:34] [INFO ] Deduced a trap composed of 6 places in 414 ms of which 1 ms to minimize.
[2023-03-19 23:48:34] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 0 ms to minimize.
[2023-03-19 23:48:34] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 19441 ms
[2023-03-19 23:48:35] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 0 ms to minimize.
[2023-03-19 23:48:35] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 0 ms to minimize.
[2023-03-19 23:48:35] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 0 ms to minimize.
[2023-03-19 23:48:37] [INFO ] Deduced a trap composed of 9 places in 1244 ms of which 1 ms to minimize.
[2023-03-19 23:48:37] [INFO ] Deduced a trap composed of 8 places in 461 ms of which 1 ms to minimize.
[2023-03-19 23:48:39] [INFO ] Deduced a trap composed of 18 places in 886 ms of which 1 ms to minimize.
[2023-03-19 23:48:40] [INFO ] Deduced a trap composed of 9 places in 938 ms of which 1 ms to minimize.
[2023-03-19 23:48:40] [INFO ] Deduced a trap composed of 14 places in 310 ms of which 0 ms to minimize.
[2023-03-19 23:48:40] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 1 ms to minimize.
[2023-03-19 23:48:41] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 6140 ms
[2023-03-19 23:48:42] [INFO ] Deduced a trap composed of 13 places in 1384 ms of which 0 ms to minimize.
[2023-03-19 23:48:42] [INFO ] Deduced a trap composed of 19 places in 224 ms of which 1 ms to minimize.
[2023-03-19 23:48:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1937 ms
[2023-03-19 23:48:43] [INFO ] After 122774ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2811 ms.
[2023-03-19 23:48:45] [INFO ] After 127147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-19 23:48:45] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 19 ms.
[2023-03-19 23:48:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2613 places, 2514 transitions and 12346 arcs took 17 ms.
[2023-03-19 23:48:46] [INFO ] Flatten gal took : 287 ms
Total runtime 241432 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-100B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
ReachabilityFireability

FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679269737121

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 1.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: 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 # 22 (type EXCL) for 3 ShieldIIPs-PT-100B-ReachabilityFireability-04
lola: time limit : 598 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 18 (type FNDP) for 3 ShieldIIPs-PT-100B-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type EQUN) for 3 ShieldIIPs-PT-100B-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 21 (type SRCH) for 3 ShieldIIPs-PT-100B-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
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:711
lola: FINISHED task # 21 (type SRCH) for ShieldIIPs-PT-100B-ReachabilityFireability-04
lola: result : true
lola: markings : 119
lola: fired transitions : 118
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 18 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityFireability-04 (obsolete)
lola: CANCELED task # 19 (type EQUN) for ShieldIIPs-PT-100B-ReachabilityFireability-04 (obsolete)
lola: CANCELED task # 22 (type EXCL) for ShieldIIPs-PT-100B-ReachabilityFireability-04 (obsolete)
lola: LAUNCH task # 28 (type EXCL) for 12 ShieldIIPs-PT-100B-ReachabilityFireability-13
lola: time limit : 718 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 24 (type FNDP) for 12 ShieldIIPs-PT-100B-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type EQUN) for 12 ShieldIIPs-PT-100B-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 27 (type SRCH) for 12 ShieldIIPs-PT-100B-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 24 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityFireability-13
lola: result : true
lola: fired transitions : 49
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 25 (type EQUN) for ShieldIIPs-PT-100B-ReachabilityFireability-13 (obsolete)
lola: CANCELED task # 27 (type SRCH) for ShieldIIPs-PT-100B-ReachabilityFireability-13 (obsolete)
lola: CANCELED task # 28 (type EXCL) for ShieldIIPs-PT-100B-ReachabilityFireability-13 (obsolete)
lola: FINISHED task # 18 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityFireability-04
lola: result : true
lola: fired transitions : 117
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/376/ReachabilityFireability-25.sara.
sara: try reading problem file /home/mcc/execution/376/ReachabilityFireability-19.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: LAUNCH task # 35 (type EXCL) for 9 ShieldIIPs-PT-100B-ReachabilityFireability-12
lola: time limit : 897 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 31 (type FNDP) for 9 ShieldIIPs-PT-100B-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 32 (type EQUN) for 9 ShieldIIPs-PT-100B-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 34 (type SRCH) for 9 ShieldIIPs-PT-100B-ReachabilityFireability-12
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: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: FINISHED task # 34 (type SRCH) for ShieldIIPs-PT-100B-ReachabilityFireability-12
lola: result : true
lola: markings : 195
lola: fired transitions : 194
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 31 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityFireability-12 (obsolete)
lola: CANCELED task # 32 (type EQUN) for ShieldIIPs-PT-100B-ReachabilityFireability-12 (obsolete)
lola: CANCELED task # 35 (type EXCL) for ShieldIIPs-PT-100B-ReachabilityFireability-12 (obsolete)
lola: LAUNCH task # 41 (type EXCL) for 15 ShieldIIPs-PT-100B-ReachabilityFireability-14
lola: time limit : 1196 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 37 (type FNDP) for 15 ShieldIIPs-PT-100B-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 38 (type EQUN) for 15 ShieldIIPs-PT-100B-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 40 (type SRCH) for 15 ShieldIIPs-PT-100B-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 40 (type SRCH) for ShieldIIPs-PT-100B-ReachabilityFireability-14
lola: result : true
lola: markings : 177
lola: fired transitions : 176
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 37 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityFireability-14 (obsolete)
lola: CANCELED task # 38 (type EQUN) for ShieldIIPs-PT-100B-ReachabilityFireability-14 (obsolete)
lola: CANCELED task # 41 (type EXCL) for ShieldIIPs-PT-100B-ReachabilityFireability-14 (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: LAUNCH task # 47 (type EXCL) for 6 ShieldIIPs-PT-100B-ReachabilityFireability-06
lola: time limit : 1795 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 43 (type FNDP) for 6 ShieldIIPs-PT-100B-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 44 (type EQUN) for 6 ShieldIIPs-PT-100B-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 46 (type SRCH) for 6 ShieldIIPs-PT-100B-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 37 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityFireability-14
lola: result : true
lola: fired transitions : 175
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/376/ReachabilityFireability-38.sara.
lola: FINISHED task # 46 (type SRCH) for ShieldIIPs-PT-100B-ReachabilityFireability-06
lola: result : true
lola: markings : 242
lola: fired transitions : 241
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 43 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityFireability-06 (obsolete)
lola: CANCELED task # 44 (type EQUN) for ShieldIIPs-PT-100B-ReachabilityFireability-06 (obsolete)
lola: CANCELED task # 47 (type EXCL) for ShieldIIPs-PT-100B-ReachabilityFireability-06 (obsolete)
lola: FINISHED task # 43 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityFireability-06
lola: result : unknown
lola: fired transitions : 594
lola: tried executions : 101
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 # 53 (type EXCL) for 0 ShieldIIPs-PT-100B-ReachabilityFireability-01
lola: time limit : 3590 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 49 (type FNDP) for 0 ShieldIIPs-PT-100B-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 50 (type EQUN) for 0 ShieldIIPs-PT-100B-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 52 (type SRCH) for 0 ShieldIIPs-PT-100B-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/376/ReachabilityFireability-44.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 49 (type FNDP) for ShieldIIPs-PT-100B-ReachabilityFireability-01
lola: result : true
lola: fired transitions : 175
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
lola: CANCELED task # 50 (type EQUN) for ShieldIIPs-PT-100B-ReachabilityFireability-01 (obsolete)
lola: CANCELED task # 52 (type SRCH) for ShieldIIPs-PT-100B-ReachabilityFireability-01 (obsolete)
lola: CANCELED task # 53 (type EXCL) for ShieldIIPs-PT-100B-ReachabilityFireability-01 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-100B-ReachabilityFireability-01: EF true findpath
ShieldIIPs-PT-100B-ReachabilityFireability-04: EF true tandem / insertion
ShieldIIPs-PT-100B-ReachabilityFireability-06: EF true tandem / insertion
ShieldIIPs-PT-100B-ReachabilityFireability-12: AG false tandem / insertion
ShieldIIPs-PT-100B-ReachabilityFireability-13: EF true findpath
ShieldIIPs-PT-100B-ReachabilityFireability-14: EF true tandem / insertion


Time elapsed: 11 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-100B"
export BK_EXAMINATION="ReachabilityFireability"
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-100B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903715000175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-100B.tgz
mv ShieldIIPs-PT-100B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;