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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679280684706

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=ShieldPPPt-PT-050B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 02:51:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 02:51:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:51:27] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2023-03-20 02:51:27] [INFO ] Transformed 3903 places.
[2023-03-20 02:51:27] [INFO ] Transformed 3553 transitions.
[2023-03-20 02:51:27] [INFO ] Found NUPN structural information;
[2023-03-20 02:51:27] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 392 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 468 ms. (steps per millisecond=21 ) properties (out of 16) seen :4
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 3553 rows 3903 cols
[2023-03-20 02:51:28] [INFO ] Computed 551 place invariants in 39 ms
[2023-03-20 02:51:31] [INFO ] [Real]Absence check using 551 positive place invariants in 378 ms returned sat
[2023-03-20 02:51:31] [INFO ] After 2572ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-20 02:51:33] [INFO ] [Nat]Absence check using 551 positive place invariants in 472 ms returned sat
[2023-03-20 02:51:46] [INFO ] After 12387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-20 02:51:48] [INFO ] Deduced a trap composed of 25 places in 1595 ms of which 15 ms to minimize.
[2023-03-20 02:51:50] [INFO ] Deduced a trap composed of 24 places in 1543 ms of which 3 ms to minimize.
[2023-03-20 02:51:51] [INFO ] Deduced a trap composed of 29 places in 1303 ms of which 4 ms to minimize.
[2023-03-20 02:51:53] [INFO ] Deduced a trap composed of 17 places in 1268 ms of which 2 ms to minimize.
[2023-03-20 02:51:54] [INFO ] Deduced a trap composed of 22 places in 1256 ms of which 15 ms to minimize.
[2023-03-20 02:51:56] [INFO ] Deduced a trap composed of 19 places in 1184 ms of which 4 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 02:51:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:51:56] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 2193 ms.
Support contains 290 out of 3903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Drop transitions removed 736 transitions
Trivial Post-agglo rules discarded 736 transitions
Performed 736 trivial Post agglomeration. Transition count delta: 736
Iterating post reduction 0 with 736 rules applied. Total rules applied 736 place count 3903 transition count 2817
Reduce places removed 736 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 738 rules applied. Total rules applied 1474 place count 3167 transition count 2815
Reduce places removed 1 places and 0 transitions.
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Iterating post reduction 2 with 78 rules applied. Total rules applied 1552 place count 3166 transition count 2738
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 3 with 77 rules applied. Total rules applied 1629 place count 3089 transition count 2738
Performed 225 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 225 Pre rules applied. Total rules applied 1629 place count 3089 transition count 2513
Deduced a syphon composed of 225 places in 22 ms
Reduce places removed 225 places and 0 transitions.
Iterating global reduction 4 with 450 rules applied. Total rules applied 2079 place count 2864 transition count 2513
Discarding 299 places :
Symmetric choice reduction at 4 with 299 rule applications. Total rules 2378 place count 2565 transition count 2214
Iterating global reduction 4 with 299 rules applied. Total rules applied 2677 place count 2565 transition count 2214
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 98 Pre rules applied. Total rules applied 2677 place count 2565 transition count 2116
Deduced a syphon composed of 98 places in 15 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 2873 place count 2467 transition count 2116
Performed 733 Post agglomeration using F-continuation condition.Transition count delta: 733
Deduced a syphon composed of 733 places in 9 ms
Reduce places removed 733 places and 0 transitions.
Iterating global reduction 4 with 1466 rules applied. Total rules applied 4339 place count 1734 transition count 1383
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 9 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4541 place count 1633 transition count 1383
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 4549 place count 1629 transition count 1383
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 4558 place count 1629 transition count 1374
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 4567 place count 1620 transition count 1374
Partial Free-agglomeration rule applied 121 times.
Drop transitions removed 121 transitions
Iterating global reduction 5 with 121 rules applied. Total rules applied 4688 place count 1620 transition count 1374
Applied a total of 4688 rules in 1323 ms. Remains 1620 /3903 variables (removed 2283) and now considering 1374/3553 (removed 2179) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1324 ms. Remains : 1620/3903 places, 1374/3553 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 12) seen :1
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 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 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 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 90336 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90336 steps, saw 45453 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1374 rows 1620 cols
[2023-03-20 02:52:03] [INFO ] Computed 551 place invariants in 6 ms
[2023-03-20 02:52:04] [INFO ] [Real]Absence check using 551 positive place invariants in 152 ms returned sat
[2023-03-20 02:52:04] [INFO ] After 686ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 02:52:05] [INFO ] [Nat]Absence check using 551 positive place invariants in 203 ms returned sat
[2023-03-20 02:52:07] [INFO ] After 1807ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 02:52:07] [INFO ] State equation strengthened by 203 read => feed constraints.
[2023-03-20 02:52:10] [INFO ] After 2843ms SMT Verify possible using 203 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-20 02:52:11] [INFO ] Deduced a trap composed of 9 places in 532 ms of which 1 ms to minimize.
[2023-03-20 02:52:11] [INFO ] Deduced a trap composed of 9 places in 462 ms of which 2 ms to minimize.
[2023-03-20 02:52:12] [INFO ] Deduced a trap composed of 5 places in 382 ms of which 1 ms to minimize.
[2023-03-20 02:52:12] [INFO ] Deduced a trap composed of 6 places in 618 ms of which 2 ms to minimize.
[2023-03-20 02:52:13] [INFO ] Deduced a trap composed of 9 places in 385 ms of which 1 ms to minimize.
[2023-03-20 02:52:13] [INFO ] Deduced a trap composed of 10 places in 347 ms of which 1 ms to minimize.
[2023-03-20 02:52:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3221 ms
[2023-03-20 02:52:14] [INFO ] Deduced a trap composed of 9 places in 505 ms of which 1 ms to minimize.
[2023-03-20 02:52:14] [INFO ] Deduced a trap composed of 8 places in 400 ms of which 0 ms to minimize.
[2023-03-20 02:52:15] [INFO ] Deduced a trap composed of 5 places in 331 ms of which 1 ms to minimize.
[2023-03-20 02:52:15] [INFO ] Deduced a trap composed of 14 places in 470 ms of which 1 ms to minimize.
[2023-03-20 02:52:16] [INFO ] Deduced a trap composed of 9 places in 341 ms of which 1 ms to minimize.
[2023-03-20 02:52:16] [INFO ] Deduced a trap composed of 10 places in 402 ms of which 12 ms to minimize.
[2023-03-20 02:52:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2947 ms
[2023-03-20 02:52:17] [INFO ] Deduced a trap composed of 8 places in 282 ms of which 1 ms to minimize.
[2023-03-20 02:52:17] [INFO ] Deduced a trap composed of 11 places in 292 ms of which 1 ms to minimize.
[2023-03-20 02:52:18] [INFO ] Deduced a trap composed of 9 places in 287 ms of which 1 ms to minimize.
[2023-03-20 02:52:18] [INFO ] Deduced a trap composed of 9 places in 271 ms of which 1 ms to minimize.
[2023-03-20 02:52:18] [INFO ] Deduced a trap composed of 13 places in 375 ms of which 0 ms to minimize.
[2023-03-20 02:52:19] [INFO ] Deduced a trap composed of 10 places in 401 ms of which 1 ms to minimize.
[2023-03-20 02:52:19] [INFO ] Deduced a trap composed of 8 places in 352 ms of which 1 ms to minimize.
[2023-03-20 02:52:20] [INFO ] Deduced a trap composed of 13 places in 300 ms of which 2 ms to minimize.
[2023-03-20 02:52:20] [INFO ] Deduced a trap composed of 14 places in 319 ms of which 0 ms to minimize.
[2023-03-20 02:52:21] [INFO ] Deduced a trap composed of 16 places in 306 ms of which 1 ms to minimize.
[2023-03-20 02:52:21] [INFO ] Deduced a trap composed of 16 places in 294 ms of which 1 ms to minimize.
[2023-03-20 02:52:21] [INFO ] Deduced a trap composed of 11 places in 271 ms of which 1 ms to minimize.
[2023-03-20 02:52:22] [INFO ] Deduced a trap composed of 13 places in 285 ms of which 0 ms to minimize.
[2023-03-20 02:52:22] [INFO ] Deduced a trap composed of 14 places in 302 ms of which 1 ms to minimize.
[2023-03-20 02:52:22] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5405 ms
[2023-03-20 02:52:23] [INFO ] Deduced a trap composed of 17 places in 311 ms of which 1 ms to minimize.
[2023-03-20 02:52:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 451 ms
[2023-03-20 02:52:23] [INFO ] Deduced a trap composed of 6 places in 356 ms of which 1 ms to minimize.
[2023-03-20 02:52:24] [INFO ] Deduced a trap composed of 8 places in 286 ms of which 0 ms to minimize.
[2023-03-20 02:52:24] [INFO ] Deduced a trap composed of 8 places in 314 ms of which 1 ms to minimize.
[2023-03-20 02:52:25] [INFO ] Deduced a trap composed of 8 places in 295 ms of which 1 ms to minimize.
[2023-03-20 02:52:25] [INFO ] Deduced a trap composed of 13 places in 314 ms of which 0 ms to minimize.
[2023-03-20 02:52:25] [INFO ] Deduced a trap composed of 9 places in 311 ms of which 1 ms to minimize.
[2023-03-20 02:52:26] [INFO ] Deduced a trap composed of 8 places in 267 ms of which 1 ms to minimize.
[2023-03-20 02:52:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2735 ms
[2023-03-20 02:52:26] [INFO ] Deduced a trap composed of 13 places in 298 ms of which 0 ms to minimize.
[2023-03-20 02:52:27] [INFO ] Deduced a trap composed of 18 places in 263 ms of which 1 ms to minimize.
[2023-03-20 02:52:27] [INFO ] Deduced a trap composed of 14 places in 294 ms of which 1 ms to minimize.
[2023-03-20 02:52:27] [INFO ] Deduced a trap composed of 7 places in 355 ms of which 1 ms to minimize.
[2023-03-20 02:52:28] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 1 ms to minimize.
[2023-03-20 02:52:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1794 ms
[2023-03-20 02:52:28] [INFO ] Deduced a trap composed of 11 places in 325 ms of which 0 ms to minimize.
[2023-03-20 02:52:29] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 0 ms to minimize.
[2023-03-20 02:52:29] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 1 ms to minimize.
[2023-03-20 02:52:29] [INFO ] Deduced a trap composed of 7 places in 322 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 02:52:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:52:29] [INFO ] After 25273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 287 ms.
Support contains 252 out of 1620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1620/1620 places, 1374/1374 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 1620 transition count 1370
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 1616 transition count 1369
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 1615 transition count 1369
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 10 place count 1615 transition count 1359
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 30 place count 1605 transition count 1359
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 82 place count 1579 transition count 1333
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 94 place count 1573 transition count 1333
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 1573 transition count 1331
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 1571 transition count 1331
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 102 place count 1571 transition count 1331
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 1570 transition count 1330
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 104 place count 1569 transition count 1330
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 104 place count 1569 transition count 1328
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 108 place count 1567 transition count 1328
Applied a total of 108 rules in 339 ms. Remains 1567 /1620 variables (removed 53) and now considering 1328/1374 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 352 ms. Remains : 1567/1620 places, 1328/1374 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 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 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 77671 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77671 steps, saw 41205 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1328 rows 1567 cols
[2023-03-20 02:52:34] [INFO ] Computed 550 place invariants in 5 ms
[2023-03-20 02:52:35] [INFO ] [Real]Absence check using 550 positive place invariants in 123 ms returned sat
[2023-03-20 02:52:35] [INFO ] After 567ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 02:52:36] [INFO ] [Nat]Absence check using 550 positive place invariants in 167 ms returned sat
[2023-03-20 02:52:38] [INFO ] After 1904ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 02:52:38] [INFO ] State equation strengthened by 204 read => feed constraints.
[2023-03-20 02:52:41] [INFO ] After 2584ms SMT Verify possible using 204 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-20 02:52:41] [INFO ] Deduced a trap composed of 10 places in 565 ms of which 1 ms to minimize.
[2023-03-20 02:52:42] [INFO ] Deduced a trap composed of 12 places in 441 ms of which 14 ms to minimize.
[2023-03-20 02:52:42] [INFO ] Deduced a trap composed of 5 places in 477 ms of which 1 ms to minimize.
[2023-03-20 02:52:43] [INFO ] Deduced a trap composed of 13 places in 436 ms of which 1 ms to minimize.
[2023-03-20 02:52:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2295 ms
[2023-03-20 02:52:44] [INFO ] Deduced a trap composed of 6 places in 346 ms of which 1 ms to minimize.
[2023-03-20 02:52:45] [INFO ] Deduced a trap composed of 8 places in 285 ms of which 1 ms to minimize.
[2023-03-20 02:52:45] [INFO ] Deduced a trap composed of 7 places in 288 ms of which 1 ms to minimize.
[2023-03-20 02:52:45] [INFO ] Deduced a trap composed of 7 places in 264 ms of which 1 ms to minimize.
[2023-03-20 02:52:46] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 1 ms to minimize.
[2023-03-20 02:52:46] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 0 ms to minimize.
[2023-03-20 02:52:46] [INFO ] Deduced a trap composed of 7 places in 349 ms of which 1 ms to minimize.
[2023-03-20 02:52:48] [INFO ] Deduced a trap composed of 12 places in 1386 ms of which 1 ms to minimize.
[2023-03-20 02:52:48] [INFO ] Deduced a trap composed of 6 places in 503 ms of which 0 ms to minimize.
[2023-03-20 02:52:49] [INFO ] Deduced a trap composed of 16 places in 337 ms of which 1 ms to minimize.
[2023-03-20 02:52:49] [INFO ] Deduced a trap composed of 8 places in 365 ms of which 1 ms to minimize.
[2023-03-20 02:52:50] [INFO ] Deduced a trap composed of 13 places in 283 ms of which 1 ms to minimize.
[2023-03-20 02:52:50] [INFO ] Deduced a trap composed of 8 places in 257 ms of which 1 ms to minimize.
[2023-03-20 02:52:50] [INFO ] Deduced a trap composed of 19 places in 293 ms of which 1 ms to minimize.
[2023-03-20 02:52:51] [INFO ] Deduced a trap composed of 14 places in 267 ms of which 1 ms to minimize.
[2023-03-20 02:52:51] [INFO ] Deduced a trap composed of 12 places in 265 ms of which 1 ms to minimize.
[2023-03-20 02:52:52] [INFO ] Deduced a trap composed of 14 places in 348 ms of which 0 ms to minimize.
[2023-03-20 02:52:52] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 1 ms to minimize.
[2023-03-20 02:52:52] [INFO ] Deduced a trap composed of 17 places in 259 ms of which 0 ms to minimize.
[2023-03-20 02:52:53] [INFO ] Deduced a trap composed of 17 places in 272 ms of which 1 ms to minimize.
[2023-03-20 02:52:53] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 8819 ms
[2023-03-20 02:52:53] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 1 ms to minimize.
[2023-03-20 02:52:54] [INFO ] Deduced a trap composed of 15 places in 254 ms of which 0 ms to minimize.
[2023-03-20 02:52:54] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 1 ms to minimize.
[2023-03-20 02:52:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 943 ms
[2023-03-20 02:52:54] [INFO ] Deduced a trap composed of 11 places in 293 ms of which 1 ms to minimize.
[2023-03-20 02:52:55] [INFO ] Deduced a trap composed of 12 places in 269 ms of which 1 ms to minimize.
[2023-03-20 02:52:55] [INFO ] Deduced a trap composed of 12 places in 268 ms of which 1 ms to minimize.
[2023-03-20 02:52:55] [INFO ] Deduced a trap composed of 17 places in 215 ms of which 1 ms to minimize.
[2023-03-20 02:52:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1309 ms
[2023-03-20 02:52:56] [INFO ] Deduced a trap composed of 10 places in 371 ms of which 2 ms to minimize.
[2023-03-20 02:52:56] [INFO ] Deduced a trap composed of 10 places in 305 ms of which 1 ms to minimize.
[2023-03-20 02:52:57] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 1 ms to minimize.
[2023-03-20 02:52:57] [INFO ] Deduced a trap composed of 11 places in 273 ms of which 1 ms to minimize.
[2023-03-20 02:52:57] [INFO ] Deduced a trap composed of 17 places in 306 ms of which 1 ms to minimize.
[2023-03-20 02:52:58] [INFO ] Deduced a trap composed of 15 places in 267 ms of which 1 ms to minimize.
[2023-03-20 02:52:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2147 ms
[2023-03-20 02:52:58] [INFO ] Deduced a trap composed of 12 places in 308 ms of which 0 ms to minimize.
[2023-03-20 02:52:58] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 0 ms to minimize.
[2023-03-20 02:52:59] [INFO ] Deduced a trap composed of 18 places in 242 ms of which 1 ms to minimize.
[2023-03-20 02:52:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 998 ms
[2023-03-20 02:53:00] [INFO ] Deduced a trap composed of 5 places in 332 ms of which 1 ms to minimize.
[2023-03-20 02:53:00] [INFO ] Deduced a trap composed of 7 places in 666 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 02:53:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:53:00] [INFO ] After 25632ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 302 ms.
Support contains 252 out of 1567 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1567/1567 places, 1328/1328 transitions.
Applied a total of 0 rules in 42 ms. Remains 1567 /1567 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 1567/1567 places, 1328/1328 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1567/1567 places, 1328/1328 transitions.
Applied a total of 0 rules in 39 ms. Remains 1567 /1567 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-20 02:53:01] [INFO ] Invariant cache hit.
[2023-03-20 02:53:02] [INFO ] Implicit Places using invariants in 876 ms returned [1544, 1548]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 883 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1565/1567 places, 1328/1328 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1563 transition count 1326
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1563 transition count 1326
Applied a total of 4 rules in 169 ms. Remains 1563 /1565 variables (removed 2) and now considering 1326/1328 (removed 2) transitions.
// Phase 1: matrix 1326 rows 1563 cols
[2023-03-20 02:53:02] [INFO ] Computed 548 place invariants in 12 ms
[2023-03-20 02:53:03] [INFO ] Implicit Places using invariants in 918 ms returned []
[2023-03-20 02:53:03] [INFO ] Invariant cache hit.
[2023-03-20 02:53:04] [INFO ] State equation strengthened by 202 read => feed constraints.
[2023-03-20 02:53:07] [INFO ] Implicit Places using invariants and state equation in 4679 ms returned []
Implicit Place search using SMT with State Equation took 5598 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1563/1567 places, 1326/1328 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6689 ms. Remains : 1563/1567 places, 1326/1328 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 90969 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90969 steps, saw 47689 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-20 02:53:11] [INFO ] Invariant cache hit.
[2023-03-20 02:53:12] [INFO ] [Real]Absence check using 548 positive place invariants in 199 ms returned sat
[2023-03-20 02:53:12] [INFO ] After 741ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 02:53:13] [INFO ] [Nat]Absence check using 548 positive place invariants in 162 ms returned sat
[2023-03-20 02:53:15] [INFO ] After 1955ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 02:53:15] [INFO ] State equation strengthened by 202 read => feed constraints.
[2023-03-20 02:53:18] [INFO ] After 2474ms SMT Verify possible using 202 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-20 02:53:18] [INFO ] Deduced a trap composed of 8 places in 275 ms of which 0 ms to minimize.
[2023-03-20 02:53:18] [INFO ] Deduced a trap composed of 8 places in 447 ms of which 1 ms to minimize.
[2023-03-20 02:53:19] [INFO ] Deduced a trap composed of 12 places in 290 ms of which 1 ms to minimize.
[2023-03-20 02:53:19] [INFO ] Deduced a trap composed of 8 places in 303 ms of which 1 ms to minimize.
[2023-03-20 02:53:20] [INFO ] Deduced a trap composed of 12 places in 253 ms of which 1 ms to minimize.
[2023-03-20 02:53:20] [INFO ] Deduced a trap composed of 11 places in 288 ms of which 1 ms to minimize.
[2023-03-20 02:53:20] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 0 ms to minimize.
[2023-03-20 02:53:21] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 1 ms to minimize.
[2023-03-20 02:53:21] [INFO ] Deduced a trap composed of 10 places in 286 ms of which 1 ms to minimize.
[2023-03-20 02:53:21] [INFO ] Deduced a trap composed of 14 places in 279 ms of which 0 ms to minimize.
[2023-03-20 02:53:22] [INFO ] Deduced a trap composed of 5 places in 372 ms of which 1 ms to minimize.
[2023-03-20 02:53:23] [INFO ] Deduced a trap composed of 7 places in 536 ms of which 1 ms to minimize.
[2023-03-20 02:53:23] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5097 ms
[2023-03-20 02:53:24] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 0 ms to minimize.
[2023-03-20 02:53:24] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 1 ms to minimize.
[2023-03-20 02:53:24] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 0 ms to minimize.
[2023-03-20 02:53:25] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 1 ms to minimize.
[2023-03-20 02:53:25] [INFO ] Deduced a trap composed of 15 places in 300 ms of which 0 ms to minimize.
[2023-03-20 02:53:25] [INFO ] Deduced a trap composed of 14 places in 274 ms of which 1 ms to minimize.
[2023-03-20 02:53:26] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 0 ms to minimize.
[2023-03-20 02:53:26] [INFO ] Deduced a trap composed of 16 places in 339 ms of which 1 ms to minimize.
[2023-03-20 02:53:27] [INFO ] Deduced a trap composed of 14 places in 252 ms of which 0 ms to minimize.
[2023-03-20 02:53:27] [INFO ] Deduced a trap composed of 17 places in 250 ms of which 0 ms to minimize.
[2023-03-20 02:53:27] [INFO ] Deduced a trap composed of 15 places in 298 ms of which 0 ms to minimize.
[2023-03-20 02:53:28] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 1 ms to minimize.
[2023-03-20 02:53:28] [INFO ] Deduced a trap composed of 17 places in 288 ms of which 1 ms to minimize.
[2023-03-20 02:53:28] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4493 ms
[2023-03-20 02:53:29] [INFO ] Deduced a trap composed of 7 places in 366 ms of which 1 ms to minimize.
[2023-03-20 02:53:29] [INFO ] Deduced a trap composed of 8 places in 296 ms of which 1 ms to minimize.
[2023-03-20 02:53:30] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 0 ms to minimize.
[2023-03-20 02:53:30] [INFO ] Deduced a trap composed of 7 places in 317 ms of which 1 ms to minimize.
[2023-03-20 02:53:30] [INFO ] Deduced a trap composed of 8 places in 301 ms of which 1 ms to minimize.
[2023-03-20 02:53:31] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 1 ms to minimize.
[2023-03-20 02:53:31] [INFO ] Deduced a trap composed of 16 places in 294 ms of which 13 ms to minimize.
[2023-03-20 02:53:31] [INFO ] Deduced a trap composed of 12 places in 411 ms of which 1 ms to minimize.
[2023-03-20 02:53:32] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 1 ms to minimize.
[2023-03-20 02:53:32] [INFO ] Deduced a trap composed of 15 places in 250 ms of which 1 ms to minimize.
[2023-03-20 02:53:32] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 0 ms to minimize.
[2023-03-20 02:53:33] [INFO ] Deduced a trap composed of 16 places in 285 ms of which 2 ms to minimize.
[2023-03-20 02:53:33] [INFO ] Deduced a trap composed of 12 places in 281 ms of which 0 ms to minimize.
[2023-03-20 02:53:33] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4885 ms
[2023-03-20 02:53:34] [INFO ] Deduced a trap composed of 12 places in 419 ms of which 2 ms to minimize.
[2023-03-20 02:53:34] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 1 ms to minimize.
[2023-03-20 02:53:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 914 ms
[2023-03-20 02:53:35] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 1 ms to minimize.
[2023-03-20 02:53:35] [INFO ] Deduced a trap composed of 5 places in 309 ms of which 0 ms to minimize.
[2023-03-20 02:53:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 802 ms
[2023-03-20 02:53:36] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 1 ms to minimize.
[2023-03-20 02:53:36] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 1 ms to minimize.
[2023-03-20 02:53:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 701 ms
[2023-03-20 02:53:37] [INFO ] Deduced a trap composed of 14 places in 330 ms of which 1 ms to minimize.
[2023-03-20 02:53:37] [INFO ] Deduced a trap composed of 13 places in 294 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 02:53:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:53:37] [INFO ] After 25293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 398 ms.
Support contains 252 out of 1563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1326/1326 transitions.
Applied a total of 0 rules in 42 ms. Remains 1563 /1563 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 1563/1563 places, 1326/1326 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1326/1326 transitions.
Applied a total of 0 rules in 41 ms. Remains 1563 /1563 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
[2023-03-20 02:53:38] [INFO ] Invariant cache hit.
[2023-03-20 02:53:39] [INFO ] Implicit Places using invariants in 744 ms returned []
[2023-03-20 02:53:39] [INFO ] Invariant cache hit.
[2023-03-20 02:53:40] [INFO ] State equation strengthened by 202 read => feed constraints.
[2023-03-20 02:53:43] [INFO ] Implicit Places using invariants and state equation in 4349 ms returned []
Implicit Place search using SMT with State Equation took 5100 ms to find 0 implicit places.
[2023-03-20 02:53:43] [INFO ] Redundant transitions in 102 ms returned []
[2023-03-20 02:53:43] [INFO ] Invariant cache hit.
[2023-03-20 02:53:44] [INFO ] Dead Transitions using invariants and state equation in 850 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6105 ms. Remains : 1563/1563 places, 1326/1326 transitions.
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 0 with 201 rules applied. Total rules applied 201 place count 1563 transition count 1326
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 204 place count 1563 transition count 1323
Applied a total of 204 rules in 112 ms. Remains 1563 /1563 variables (removed 0) and now considering 1323/1326 (removed 3) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 1323 rows 1563 cols
[2023-03-20 02:53:44] [INFO ] Computed 548 place invariants in 11 ms
[2023-03-20 02:53:45] [INFO ] [Real]Absence check using 548 positive place invariants in 189 ms returned sat
[2023-03-20 02:53:45] [INFO ] After 770ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 02:53:46] [INFO ] [Nat]Absence check using 548 positive place invariants in 203 ms returned sat
[2023-03-20 02:53:48] [INFO ] After 1932ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 02:53:48] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-20 02:53:50] [INFO ] After 1942ms SMT Verify possible using 159 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-20 02:53:51] [INFO ] Deduced a trap composed of 11 places in 592 ms of which 2 ms to minimize.
[2023-03-20 02:53:51] [INFO ] Deduced a trap composed of 6 places in 473 ms of which 2 ms to minimize.
[2023-03-20 02:53:52] [INFO ] Deduced a trap composed of 8 places in 583 ms of which 1 ms to minimize.
[2023-03-20 02:53:53] [INFO ] Deduced a trap composed of 6 places in 551 ms of which 1 ms to minimize.
[2023-03-20 02:53:53] [INFO ] Deduced a trap composed of 7 places in 505 ms of which 1 ms to minimize.
[2023-03-20 02:53:54] [INFO ] Deduced a trap composed of 11 places in 621 ms of which 1 ms to minimize.
[2023-03-20 02:53:55] [INFO ] Deduced a trap composed of 8 places in 511 ms of which 1 ms to minimize.
[2023-03-20 02:53:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4656 ms
[2023-03-20 02:53:56] [INFO ] Deduced a trap composed of 3 places in 525 ms of which 1 ms to minimize.
[2023-03-20 02:53:56] [INFO ] Deduced a trap composed of 7 places in 448 ms of which 1 ms to minimize.
[2023-03-20 02:53:57] [INFO ] Deduced a trap composed of 8 places in 491 ms of which 1 ms to minimize.
[2023-03-20 02:53:58] [INFO ] Deduced a trap composed of 20 places in 555 ms of which 1 ms to minimize.
[2023-03-20 02:53:58] [INFO ] Deduced a trap composed of 5 places in 456 ms of which 1 ms to minimize.
[2023-03-20 02:53:59] [INFO ] Deduced a trap composed of 12 places in 401 ms of which 1 ms to minimize.
[2023-03-20 02:53:59] [INFO ] Deduced a trap composed of 17 places in 468 ms of which 2 ms to minimize.
[2023-03-20 02:54:00] [INFO ] Deduced a trap composed of 15 places in 462 ms of which 1 ms to minimize.
[2023-03-20 02:54:00] [INFO ] Deduced a trap composed of 9 places in 708 ms of which 1 ms to minimize.
[2023-03-20 02:54:01] [INFO ] Deduced a trap composed of 11 places in 472 ms of which 1 ms to minimize.
[2023-03-20 02:54:02] [INFO ] Deduced a trap composed of 14 places in 465 ms of which 1 ms to minimize.
[2023-03-20 02:54:02] [INFO ] Deduced a trap composed of 12 places in 458 ms of which 1 ms to minimize.
[2023-03-20 02:54:03] [INFO ] Deduced a trap composed of 10 places in 346 ms of which 2 ms to minimize.
[2023-03-20 02:54:03] [INFO ] Deduced a trap composed of 9 places in 363 ms of which 1 ms to minimize.
[2023-03-20 02:54:04] [INFO ] Deduced a trap composed of 14 places in 505 ms of which 1 ms to minimize.
[2023-03-20 02:54:04] [INFO ] Deduced a trap composed of 11 places in 530 ms of which 1 ms to minimize.
[2023-03-20 02:54:04] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 9233 ms
[2023-03-20 02:54:05] [INFO ] Deduced a trap composed of 7 places in 436 ms of which 1 ms to minimize.
[2023-03-20 02:54:05] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 1 ms to minimize.
[2023-03-20 02:54:06] [INFO ] Deduced a trap composed of 7 places in 346 ms of which 1 ms to minimize.
[2023-03-20 02:54:06] [INFO ] Deduced a trap composed of 12 places in 344 ms of which 2 ms to minimize.
[2023-03-20 02:54:07] [INFO ] Deduced a trap composed of 14 places in 324 ms of which 1 ms to minimize.
[2023-03-20 02:54:07] [INFO ] Deduced a trap composed of 15 places in 318 ms of which 0 ms to minimize.
[2023-03-20 02:54:07] [INFO ] Deduced a trap composed of 12 places in 362 ms of which 2 ms to minimize.
[2023-03-20 02:54:08] [INFO ] Deduced a trap composed of 19 places in 275 ms of which 1 ms to minimize.
[2023-03-20 02:54:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3313 ms
[2023-03-20 02:54:08] [INFO ] Deduced a trap composed of 15 places in 380 ms of which 1 ms to minimize.
[2023-03-20 02:54:09] [INFO ] Deduced a trap composed of 25 places in 325 ms of which 0 ms to minimize.
[2023-03-20 02:54:09] [INFO ] Deduced a trap composed of 21 places in 282 ms of which 1 ms to minimize.
[2023-03-20 02:54:10] [INFO ] Deduced a trap composed of 17 places in 354 ms of which 1 ms to minimize.
[2023-03-20 02:54:10] [INFO ] Deduced a trap composed of 16 places in 411 ms of which 1 ms to minimize.
[2023-03-20 02:54:10] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 0 ms to minimize.
[2023-03-20 02:54:11] [INFO ] Deduced a trap composed of 23 places in 299 ms of which 1 ms to minimize.
[2023-03-20 02:54:11] [INFO ] Deduced a trap composed of 17 places in 293 ms of which 1 ms to minimize.
[2023-03-20 02:54:12] [INFO ] Deduced a trap composed of 18 places in 495 ms of which 2 ms to minimize.
[2023-03-20 02:54:12] [INFO ] Deduced a trap composed of 15 places in 379 ms of which 1 ms to minimize.
[2023-03-20 02:54:13] [INFO ] Deduced a trap composed of 13 places in 332 ms of which 0 ms to minimize.
[2023-03-20 02:54:13] [INFO ] Deduced a trap composed of 15 places in 622 ms of which 6 ms to minimize.
[2023-03-20 02:54:14] [INFO ] Deduced a trap composed of 14 places in 372 ms of which 0 ms to minimize.
[2023-03-20 02:54:14] [INFO ] Deduced a trap composed of 13 places in 299 ms of which 1 ms to minimize.
[2023-03-20 02:54:15] [INFO ] Deduced a trap composed of 13 places in 357 ms of which 1 ms to minimize.
[2023-03-20 02:54:15] [INFO ] Deduced a trap composed of 16 places in 384 ms of which 0 ms to minimize.
[2023-03-20 02:54:15] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 7190 ms
[2023-03-20 02:54:16] [INFO ] Deduced a trap composed of 16 places in 352 ms of which 0 ms to minimize.
[2023-03-20 02:54:17] [INFO ] Deduced a trap composed of 18 places in 1021 ms of which 2 ms to minimize.
[2023-03-20 02:54:17] [INFO ] Deduced a trap composed of 13 places in 374 ms of which 1 ms to minimize.
[2023-03-20 02:54:18] [INFO ] Deduced a trap composed of 17 places in 310 ms of which 1 ms to minimize.
[2023-03-20 02:54:18] [INFO ] Deduced a trap composed of 20 places in 320 ms of which 0 ms to minimize.
[2023-03-20 02:54:18] [INFO ] Deduced a trap composed of 15 places in 291 ms of which 1 ms to minimize.
[2023-03-20 02:54:19] [INFO ] Deduced a trap composed of 15 places in 335 ms of which 1 ms to minimize.
[2023-03-20 02:54:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3568 ms
[2023-03-20 02:54:20] [INFO ] Deduced a trap composed of 3 places in 373 ms of which 1 ms to minimize.
[2023-03-20 02:54:20] [INFO ] Deduced a trap composed of 7 places in 321 ms of which 1 ms to minimize.
[2023-03-20 02:54:21] [INFO ] Deduced a trap composed of 7 places in 1037 ms of which 1 ms to minimize.
[2023-03-20 02:54:22] [INFO ] Deduced a trap composed of 12 places in 678 ms of which 0 ms to minimize.
[2023-03-20 02:54:23] [INFO ] Deduced a trap composed of 9 places in 906 ms of which 1 ms to minimize.
[2023-03-20 02:54:23] [INFO ] Deduced a trap composed of 12 places in 315 ms of which 1 ms to minimize.
[2023-03-20 02:54:24] [INFO ] Deduced a trap composed of 6 places in 402 ms of which 1 ms to minimize.
[2023-03-20 02:54:24] [INFO ] Deduced a trap composed of 6 places in 439 ms of which 2 ms to minimize.
[2023-03-20 02:54:25] [INFO ] Deduced a trap composed of 7 places in 312 ms of which 1 ms to minimize.
[2023-03-20 02:54:25] [INFO ] Deduced a trap composed of 16 places in 279 ms of which 0 ms to minimize.
[2023-03-20 02:54:25] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5856 ms
[2023-03-20 02:54:25] [INFO ] Deduced a trap composed of 13 places in 312 ms of which 1 ms to minimize.
[2023-03-20 02:54:26] [INFO ] Deduced a trap composed of 23 places in 349 ms of which 1 ms to minimize.
[2023-03-20 02:54:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 843 ms
[2023-03-20 02:54:27] [INFO ] Deduced a trap composed of 7 places in 402 ms of which 0 ms to minimize.
[2023-03-20 02:54:27] [INFO ] Deduced a trap composed of 16 places in 293 ms of which 1 ms to minimize.
[2023-03-20 02:54:27] [INFO ] Deduced a trap composed of 21 places in 292 ms of which 1 ms to minimize.
[2023-03-20 02:54:28] [INFO ] Deduced a trap composed of 16 places in 260 ms of which 1 ms to minimize.
[2023-03-20 02:54:28] [INFO ] Deduced a trap composed of 7 places in 257 ms of which 0 ms to minimize.
[2023-03-20 02:54:28] [INFO ] Deduced a trap composed of 12 places in 333 ms of which 1 ms to minimize.
[2023-03-20 02:54:29] [INFO ] Deduced a trap composed of 16 places in 353 ms of which 1 ms to minimize.
[2023-03-20 02:54:29] [INFO ] Deduced a trap composed of 15 places in 270 ms of which 1 ms to minimize.
[2023-03-20 02:54:29] [INFO ] Deduced a trap composed of 12 places in 265 ms of which 1 ms to minimize.
[2023-03-20 02:54:29] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3386 ms
[2023-03-20 02:54:30] [INFO ] Deduced a trap composed of 5 places in 381 ms of which 1 ms to minimize.
[2023-03-20 02:54:30] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 0 ms to minimize.
[2023-03-20 02:54:31] [INFO ] Deduced a trap composed of 6 places in 285 ms of which 0 ms to minimize.
[2023-03-20 02:54:31] [INFO ] Deduced a trap composed of 6 places in 342 ms of which 3 ms to minimize.
[2023-03-20 02:54:32] [INFO ] Deduced a trap composed of 14 places in 509 ms of which 1 ms to minimize.
[2023-03-20 02:54:32] [INFO ] Deduced a trap composed of 12 places in 348 ms of which 1 ms to minimize.
[2023-03-20 02:54:33] [INFO ] Deduced a trap composed of 12 places in 405 ms of which 1 ms to minimize.
[2023-03-20 02:54:33] [INFO ] Deduced a trap composed of 9 places in 317 ms of which 1 ms to minimize.
[2023-03-20 02:54:34] [INFO ] Deduced a trap composed of 16 places in 392 ms of which 1 ms to minimize.
[2023-03-20 02:54:34] [INFO ] Deduced a trap composed of 12 places in 333 ms of which 1 ms to minimize.
[2023-03-20 02:54:34] [INFO ] Deduced a trap composed of 15 places in 358 ms of which 1 ms to minimize.
[2023-03-20 02:54:35] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 0 ms to minimize.
[2023-03-20 02:54:35] [INFO ] Deduced a trap composed of 17 places in 355 ms of which 0 ms to minimize.
[2023-03-20 02:54:36] [INFO ] Deduced a trap composed of 15 places in 417 ms of which 1 ms to minimize.
[2023-03-20 02:54:36] [INFO ] Deduced a trap composed of 14 places in 364 ms of which 1 ms to minimize.
[2023-03-20 02:54:37] [INFO ] Deduced a trap composed of 18 places in 283 ms of which 1 ms to minimize.
[2023-03-20 02:54:37] [INFO ] Deduced a trap composed of 15 places in 291 ms of which 1 ms to minimize.
[2023-03-20 02:54:37] [INFO ] Deduced a trap composed of 16 places in 351 ms of which 0 ms to minimize.
[2023-03-20 02:54:37] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 7822 ms
[2023-03-20 02:54:38] [INFO ] Deduced a trap composed of 14 places in 287 ms of which 1 ms to minimize.
[2023-03-20 02:54:38] [INFO ] Deduced a trap composed of 6 places in 370 ms of which 3 ms to minimize.
[2023-03-20 02:54:39] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 1 ms to minimize.
[2023-03-20 02:54:39] [INFO ] Deduced a trap composed of 12 places in 439 ms of which 1 ms to minimize.
[2023-03-20 02:54:40] [INFO ] Deduced a trap composed of 13 places in 351 ms of which 1 ms to minimize.
[2023-03-20 02:54:40] [INFO ] Deduced a trap composed of 12 places in 248 ms of which 1 ms to minimize.
[2023-03-20 02:54:40] [INFO ] Deduced a trap composed of 12 places in 266 ms of which 0 ms to minimize.
[2023-03-20 02:54:41] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 1 ms to minimize.
[2023-03-20 02:54:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3040 ms
[2023-03-20 02:54:41] [INFO ] Deduced a trap composed of 5 places in 297 ms of which 1 ms to minimize.
[2023-03-20 02:54:42] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 1 ms to minimize.
[2023-03-20 02:54:42] [INFO ] Deduced a trap composed of 9 places in 328 ms of which 1 ms to minimize.
[2023-03-20 02:54:43] [INFO ] Deduced a trap composed of 20 places in 372 ms of which 1 ms to minimize.
[2023-03-20 02:54:43] [INFO ] Deduced a trap composed of 15 places in 250 ms of which 1 ms to minimize.
[2023-03-20 02:54:43] [INFO ] Deduced a trap composed of 13 places in 291 ms of which 1 ms to minimize.
[2023-03-20 02:54:44] [INFO ] Deduced a trap composed of 12 places in 335 ms of which 1 ms to minimize.
[2023-03-20 02:54:44] [INFO ] Deduced a trap composed of 13 places in 290 ms of which 1 ms to minimize.
[2023-03-20 02:54:44] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 1 ms to minimize.
[2023-03-20 02:54:45] [INFO ] Deduced a trap composed of 14 places in 255 ms of which 0 ms to minimize.
[2023-03-20 02:54:45] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 2 ms to minimize.
[2023-03-20 02:54:45] [INFO ] Deduced a trap composed of 15 places in 320 ms of which 0 ms to minimize.
[2023-03-20 02:54:46] [INFO ] Deduced a trap composed of 18 places in 308 ms of which 1 ms to minimize.
[2023-03-20 02:54:46] [INFO ] Deduced a trap composed of 18 places in 279 ms of which 1 ms to minimize.
[2023-03-20 02:54:46] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 1 ms to minimize.
[2023-03-20 02:54:47] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 1 ms to minimize.
[2023-03-20 02:54:47] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 0 ms to minimize.
[2023-03-20 02:54:47] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5966 ms
[2023-03-20 02:54:47] [INFO ] After 59085ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 2593 ms.
[2023-03-20 02:54:50] [INFO ] After 64684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
[2023-03-20 02:54:50] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 50 ms.
[2023-03-20 02:54:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1563 places, 1326 transitions and 5216 arcs took 6 ms.
[2023-03-20 02:54:50] [INFO ] Flatten gal took : 157 ms
Total runtime 203629 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPt-PT-050B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
ReachabilityFireability

FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679280898233

--------------------
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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/ReachabilityFireability.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: 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: 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 # 38 (type EXCL) for 6 ShieldPPPt-PT-050B-ReachabilityFireability-02
lola: time limit : 326 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 34 (type FNDP) for 6 ShieldPPPt-PT-050B-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 35 (type EQUN) for 6 ShieldPPPt-PT-050B-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 37 (type SRCH) for 6 ShieldPPPt-PT-050B-ReachabilityFireability-02
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: FINISHED task # 37 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityFireability-02
lola: result : false
lola: markings : 4
lola: fired transitions : 3
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 34 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-02 (obsolete)
lola: CANCELED task # 35 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityFireability-02 (obsolete)
lola: CANCELED task # 38 (type EXCL) for ShieldPPPt-PT-050B-ReachabilityFireability-02 (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 # 44 (type EXCL) for 24 ShieldPPPt-PT-050B-ReachabilityFireability-11
lola: time limit : 359 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 40 (type FNDP) for 24 ShieldPPPt-PT-050B-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 41 (type EQUN) for 24 ShieldPPPt-PT-050B-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 43 (type SRCH) for 24 ShieldPPPt-PT-050B-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 43 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityFireability-11
lola: result : true
lola: markings : 90
lola: fired transitions : 89
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 40 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-11 (obsolete)
lola: CANCELED task # 41 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityFireability-11 (obsolete)
lola: CANCELED task # 44 (type EXCL) for ShieldPPPt-PT-050B-ReachabilityFireability-11 (obsolete)
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 # 51 (type EXCL) for 21 ShieldPPPt-PT-050B-ReachabilityFireability-10
lola: time limit : 449 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 47 (type FNDP) for 21 ShieldPPPt-PT-050B-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 48 (type EQUN) for 21 ShieldPPPt-PT-050B-ReachabilityFireability-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: LAUNCH task # 50 (type SRCH) for 21 ShieldPPPt-PT-050B-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 40 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-11
lola: result : true
lola: fired transitions : 88
lola: tried executions : 1
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: 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: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 50 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityFireability-10
lola: result : true
lola: markings : 103
lola: fired transitions : 102
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: 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: CANCELED task # 47 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-10 (obsolete)
lola: CANCELED task # 48 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityFireability-10 (obsolete)
lola: CANCELED task # 51 (type EXCL) for ShieldPPPt-PT-050B-ReachabilityFireability-10 (obsolete)
lola: LAUNCH task # 57 (type EXCL) for 27 ShieldPPPt-PT-050B-ReachabilityFireability-12
lola: time limit : 449 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 66 (type FNDP) for 30 ShieldPPPt-PT-050B-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 67 (type EQUN) for 30 ShieldPPPt-PT-050B-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 69 (type SRCH) for 30 ShieldPPPt-PT-050B-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/374/ReachabilityFireability-41.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 69 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityFireability-14
lola: result : true
lola: markings : 471
lola: fired transitions : 479
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 66 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-14 (obsolete)
lola: CANCELED task # 67 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityFireability-14 (obsolete)
lola: LAUNCH task # 59 (type FNDP) for 12 ShieldPPPt-PT-050B-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 60 (type EQUN) for 12 ShieldPPPt-PT-050B-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 62 (type SRCH) for 12 ShieldPPPt-PT-050B-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 66 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-14
lola: result : unknown
lola: fired transitions : 259
lola: tried executions : 2
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: FINISHED task # 47 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-10
lola: result : true
lola: fired transitions : 101
lola: tried executions : 1
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: FINISHED task # 59 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-05
lola: result : true
lola: fired transitions : 51
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 60 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 62 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityFireability-05 (obsolete)
lola: LAUNCH task # 73 (type FNDP) for 18 ShieldPPPt-PT-050B-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 74 (type EQUN) for 18 ShieldPPPt-PT-050B-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 76 (type SRCH) for 18 ShieldPPPt-PT-050B-ReachabilityFireability-07
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 # 76 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityFireability-07
lola: result : true
lola: markings : 70
lola: fired transitions : 69
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 73 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-07 (obsolete)
lola: CANCELED task # 74 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityFireability-07 (obsolete)
lola: LAUNCH task # 92 (type FNDP) for 15 ShieldPPPt-PT-050B-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 93 (type EQUN) for 15 ShieldPPPt-PT-050B-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 95 (type SRCH) for 15 ShieldPPPt-PT-050B-ReachabilityFireability-06
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 # 73 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-07
lola: result : true
lola: fired transitions : 68
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 95 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityFireability-06
lola: result : false
lola: markings : 170
lola: fired transitions : 258
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 92 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-06 (obsolete)
lola: CANCELED task # 93 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityFireability-06 (obsolete)
lola: LAUNCH task # 99 (type FNDP) for 3 ShieldPPPt-PT-050B-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 100 (type EQUN) for 3 ShieldPPPt-PT-050B-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 102 (type SRCH) for 3 ShieldPPPt-PT-050B-ReachabilityFireability-01
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
sara: try reading problem file /home/mcc/execution/374/ReachabilityFireability-60.sara.
lola: FINISHED task # 102 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityFireability-01
lola: result : true
lola: markings : 122
lola: fired transitions : 121
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 99 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-01 (obsolete)
lola: CANCELED task # 100 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityFireability-01 (obsolete)
lola: LAUNCH task # 85 (type FNDP) for 0 ShieldPPPt-PT-050B-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 86 (type EQUN) for 0 ShieldPPPt-PT-050B-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 88 (type SRCH) for 0 ShieldPPPt-PT-050B-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 85 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-00
lola: result : true
lola: fired transitions : 35
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: CANCELED task # 86 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityFireability-00 (obsolete)
lola: CANCELED task # 88 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityFireability-00 (obsolete)
lola: LAUNCH task # 79 (type FNDP) for 9 ShieldPPPt-PT-050B-ReachabilityFireability-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 80 (type EQUN) for 9 ShieldPPPt-PT-050B-ReachabilityFireability-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 82 (type SRCH) for 9 ShieldPPPt-PT-050B-ReachabilityFireability-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 99 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-01
lola: result : true
lola: fired transitions : 120
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
lola: FINISHED task # 79 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-03
lola: result : true
lola: fired transitions : 90
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 80 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityFireability-03 (obsolete)
lola: CANCELED task # 82 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityFireability-03 (obsolete)
lola: LAUNCH task # 53 (type FNDP) for 27 ShieldPPPt-PT-050B-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 54 (type EQUN) for 27 ShieldPPPt-PT-050B-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 56 (type SRCH) for 27 ShieldPPPt-PT-050B-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/374/ReachabilityFireability-74.sara.
lola: FINISHED task # 56 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityFireability-12
lola: result : true
lola: markings : 125
lola: fired transitions : 124
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 53 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityFireability-12 (obsolete)
lola: CANCELED task # 54 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityFireability-12 (obsolete)
lola: CANCELED task # 57 (type EXCL) for ShieldPPPt-PT-050B-ReachabilityFireability-12 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-050B-ReachabilityFireability-00: EF true findpath
ShieldPPPt-PT-050B-ReachabilityFireability-01: AG false tandem / insertion
ShieldPPPt-PT-050B-ReachabilityFireability-02: AG true tandem / insertion
ShieldPPPt-PT-050B-ReachabilityFireability-03: EF true findpath
ShieldPPPt-PT-050B-ReachabilityFireability-05: EF true findpath
ShieldPPPt-PT-050B-ReachabilityFireability-06: AG true tandem / insertion
ShieldPPPt-PT-050B-ReachabilityFireability-07: AG false tandem / insertion
ShieldPPPt-PT-050B-ReachabilityFireability-10: AG false tandem / insertion
ShieldPPPt-PT-050B-ReachabilityFireability-11: EF true tandem / insertion
ShieldPPPt-PT-050B-ReachabilityFireability-12: EF true tandem / insertion
ShieldPPPt-PT-050B-ReachabilityFireability-14: AG false tandem / insertion


Time elapsed: 8 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="ShieldPPPt-PT-050B"
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 ShieldPPPt-PT-050B, 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-167903715600687"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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