About the Execution of Marcie+red for ShieldPPPt-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9990.884 | 3600000.00 | 3722779.00 | 196.60 | ????T???TT???T?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r394-oct2-167903718200687.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 marciexred
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 r394-oct2-167903718200687
=====================================================================
--------------------
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 1679531405471
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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 00:30:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 00:30:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 00:30:08] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2023-03-23 00:30:08] [INFO ] Transformed 3903 places.
[2023-03-23 00:30:08] [INFO ] Transformed 3553 transitions.
[2023-03-23 00:30:08] [INFO ] Found NUPN structural information;
[2023-03-23 00:30:08] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 413 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 590 ms. (steps per millisecond=16 ) 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 32 ms. (steps per millisecond=312 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) 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 45 ms. (steps per millisecond=222 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 3553 rows 3903 cols
[2023-03-23 00:30:10] [INFO ] Computed 551 place invariants in 51 ms
[2023-03-23 00:30:13] [INFO ] [Real]Absence check using 551 positive place invariants in 507 ms returned sat
[2023-03-23 00:30:13] [INFO ] After 2692ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-23 00:30:15] [INFO ] [Nat]Absence check using 551 positive place invariants in 525 ms returned sat
[2023-03-23 00:30:30] [INFO ] After 14096ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-23 00:30:32] [INFO ] Deduced a trap composed of 25 places in 2076 ms of which 26 ms to minimize.
[2023-03-23 00:30:34] [INFO ] Deduced a trap composed of 24 places in 1876 ms of which 24 ms to minimize.
[2023-03-23 00:30:36] [INFO ] Deduced a trap composed of 29 places in 1732 ms of which 3 ms to minimize.
[2023-03-23 00:30:38] [INFO ] Deduced a trap composed of 17 places in 1320 ms of which 9 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-23 00:30:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 00:30:38] [INFO ] After 25259ms 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 2603 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 8 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 16 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 4 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 7 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 3 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 1428 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 1429 ms. Remains : 1620/3903 places, 1374/3553 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=22 ) 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 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) 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 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 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) 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 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 77083 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77083 steps, saw 39652 distinct states, run finished after 3003 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1374 rows 1620 cols
[2023-03-23 00:30:46] [INFO ] Computed 551 place invariants in 6 ms
[2023-03-23 00:30:47] [INFO ] [Real]Absence check using 551 positive place invariants in 216 ms returned sat
[2023-03-23 00:30:47] [INFO ] After 961ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-23 00:30:48] [INFO ] [Nat]Absence check using 551 positive place invariants in 178 ms returned sat
[2023-03-23 00:30:54] [INFO ] After 5256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-23 00:30:54] [INFO ] State equation strengthened by 203 read => feed constraints.
[2023-03-23 00:30:57] [INFO ] After 2942ms SMT Verify possible using 203 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-23 00:30:58] [INFO ] Deduced a trap composed of 9 places in 621 ms of which 3 ms to minimize.
[2023-03-23 00:30:58] [INFO ] Deduced a trap composed of 9 places in 498 ms of which 1 ms to minimize.
[2023-03-23 00:30:59] [INFO ] Deduced a trap composed of 5 places in 553 ms of which 2 ms to minimize.
[2023-03-23 00:30:59] [INFO ] Deduced a trap composed of 6 places in 481 ms of which 1 ms to minimize.
[2023-03-23 00:31:00] [INFO ] Deduced a trap composed of 9 places in 477 ms of which 1 ms to minimize.
[2023-03-23 00:31:01] [INFO ] Deduced a trap composed of 10 places in 665 ms of which 2 ms to minimize.
[2023-03-23 00:31:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3846 ms
[2023-03-23 00:31:02] [INFO ] Deduced a trap composed of 9 places in 437 ms of which 1 ms to minimize.
[2023-03-23 00:31:03] [INFO ] Deduced a trap composed of 8 places in 954 ms of which 1 ms to minimize.
[2023-03-23 00:31:03] [INFO ] Deduced a trap composed of 5 places in 501 ms of which 10 ms to minimize.
[2023-03-23 00:31:04] [INFO ] Deduced a trap composed of 14 places in 405 ms of which 1 ms to minimize.
[2023-03-23 00:31:05] [INFO ] Deduced a trap composed of 9 places in 734 ms of which 2 ms to minimize.
[2023-03-23 00:31:05] [INFO ] Deduced a trap composed of 10 places in 544 ms of which 1 ms to minimize.
[2023-03-23 00:31:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4358 ms
[2023-03-23 00:31:06] [INFO ] Deduced a trap composed of 8 places in 345 ms of which 1 ms to minimize.
[2023-03-23 00:31:07] [INFO ] Deduced a trap composed of 11 places in 308 ms of which 1 ms to minimize.
[2023-03-23 00:31:07] [INFO ] Deduced a trap composed of 9 places in 598 ms of which 1 ms to minimize.
[2023-03-23 00:31:08] [INFO ] Deduced a trap composed of 9 places in 410 ms of which 1 ms to minimize.
[2023-03-23 00:31:08] [INFO ] Deduced a trap composed of 13 places in 440 ms of which 1 ms to minimize.
[2023-03-23 00:31:09] [INFO ] Deduced a trap composed of 10 places in 399 ms of which 14 ms to minimize.
[2023-03-23 00:31:09] [INFO ] Deduced a trap composed of 8 places in 328 ms of which 1 ms to minimize.
[2023-03-23 00:31:10] [INFO ] Deduced a trap composed of 13 places in 717 ms of which 23 ms to minimize.
[2023-03-23 00:31:10] [INFO ] Deduced a trap composed of 14 places in 337 ms of which 1 ms to minimize.
[2023-03-23 00:31:11] [INFO ] Deduced a trap composed of 16 places in 336 ms of which 1 ms to minimize.
[2023-03-23 00:31:11] [INFO ] Deduced a trap composed of 16 places in 296 ms of which 1 ms to minimize.
[2023-03-23 00:31:12] [INFO ] Deduced a trap composed of 11 places in 483 ms of which 1 ms to minimize.
[2023-03-23 00:31:12] [INFO ] Deduced a trap composed of 13 places in 582 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-23 00:31:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 00:31:12] [INFO ] After 25161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 278 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 3 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 16 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 3 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 461 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 461 ms. Remains : 1567/1620 places, 1328/1374 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 519 ms. (steps per millisecond=19 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) 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
Interrupted probabilistic random walk after 75003 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 75003 steps, saw 39976 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1328 rows 1567 cols
[2023-03-23 00:31:18] [INFO ] Computed 550 place invariants in 5 ms
[2023-03-23 00:31:18] [INFO ] [Real]Absence check using 550 positive place invariants in 149 ms returned sat
[2023-03-23 00:31:19] [INFO ] After 819ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-23 00:31:19] [INFO ] [Nat]Absence check using 550 positive place invariants in 153 ms returned sat
[2023-03-23 00:31:22] [INFO ] After 1918ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-23 00:31:22] [INFO ] State equation strengthened by 204 read => feed constraints.
[2023-03-23 00:31:24] [INFO ] After 2497ms SMT Verify possible using 204 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-23 00:31:25] [INFO ] Deduced a trap composed of 10 places in 545 ms of which 1 ms to minimize.
[2023-03-23 00:31:25] [INFO ] Deduced a trap composed of 12 places in 482 ms of which 2 ms to minimize.
[2023-03-23 00:31:26] [INFO ] Deduced a trap composed of 5 places in 756 ms of which 2 ms to minimize.
[2023-03-23 00:31:27] [INFO ] Deduced a trap composed of 13 places in 849 ms of which 1 ms to minimize.
[2023-03-23 00:31:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3070 ms
[2023-03-23 00:31:29] [INFO ] Deduced a trap composed of 6 places in 875 ms of which 13 ms to minimize.
[2023-03-23 00:31:30] [INFO ] Deduced a trap composed of 8 places in 500 ms of which 2 ms to minimize.
[2023-03-23 00:31:30] [INFO ] Deduced a trap composed of 7 places in 344 ms of which 2 ms to minimize.
[2023-03-23 00:31:31] [INFO ] Deduced a trap composed of 7 places in 516 ms of which 2 ms to minimize.
[2023-03-23 00:31:31] [INFO ] Deduced a trap composed of 6 places in 356 ms of which 1 ms to minimize.
[2023-03-23 00:31:32] [INFO ] Deduced a trap composed of 9 places in 327 ms of which 1 ms to minimize.
[2023-03-23 00:31:32] [INFO ] Deduced a trap composed of 7 places in 260 ms of which 1 ms to minimize.
[2023-03-23 00:31:32] [INFO ] Deduced a trap composed of 12 places in 258 ms of which 0 ms to minimize.
[2023-03-23 00:31:33] [INFO ] Deduced a trap composed of 6 places in 374 ms of which 1 ms to minimize.
[2023-03-23 00:31:33] [INFO ] Deduced a trap composed of 16 places in 425 ms of which 15 ms to minimize.
[2023-03-23 00:31:34] [INFO ] Deduced a trap composed of 8 places in 581 ms of which 1 ms to minimize.
[2023-03-23 00:31:34] [INFO ] Deduced a trap composed of 13 places in 320 ms of which 1 ms to minimize.
[2023-03-23 00:31:35] [INFO ] Deduced a trap composed of 8 places in 382 ms of which 1 ms to minimize.
[2023-03-23 00:31:35] [INFO ] Deduced a trap composed of 19 places in 397 ms of which 1 ms to minimize.
[2023-03-23 00:31:36] [INFO ] Deduced a trap composed of 14 places in 486 ms of which 1 ms to minimize.
[2023-03-23 00:31:36] [INFO ] Deduced a trap composed of 12 places in 297 ms of which 1 ms to minimize.
[2023-03-23 00:31:37] [INFO ] Deduced a trap composed of 14 places in 356 ms of which 1 ms to minimize.
[2023-03-23 00:31:37] [INFO ] Deduced a trap composed of 17 places in 317 ms of which 2 ms to minimize.
[2023-03-23 00:31:38] [INFO ] Deduced a trap composed of 17 places in 268 ms of which 1 ms to minimize.
[2023-03-23 00:31:38] [INFO ] Deduced a trap composed of 17 places in 322 ms of which 1 ms to minimize.
[2023-03-23 00:31:38] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 9878 ms
[2023-03-23 00:31:39] [INFO ] Deduced a trap composed of 6 places in 573 ms of which 1 ms to minimize.
[2023-03-23 00:31:39] [INFO ] Deduced a trap composed of 15 places in 290 ms of which 1 ms to minimize.
[2023-03-23 00:31:40] [INFO ] Deduced a trap composed of 14 places in 285 ms of which 1 ms to minimize.
[2023-03-23 00:31:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1427 ms
[2023-03-23 00:31:40] [INFO ] Deduced a trap composed of 11 places in 446 ms of which 0 ms to minimize.
[2023-03-23 00:31:41] [INFO ] Deduced a trap composed of 12 places in 384 ms of which 1 ms to minimize.
[2023-03-23 00:31:41] [INFO ] Deduced a trap composed of 12 places in 320 ms of which 1 ms to minimize.
[2023-03-23 00:31:42] [INFO ] Deduced a trap composed of 17 places in 395 ms of which 2 ms to minimize.
[2023-03-23 00:31:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1898 ms
[2023-03-23 00:31:43] [INFO ] Deduced a trap composed of 10 places in 429 ms of which 1 ms to minimize.
[2023-03-23 00:31:43] [INFO ] Deduced a trap composed of 10 places in 518 ms of which 1 ms to minimize.
[2023-03-23 00:31:44] [INFO ] Deduced a trap composed of 9 places in 389 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-23 00:31:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 00:31:44] [INFO ] After 25159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 334 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 87 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 87 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 45 ms. Remains 1567 /1567 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-23 00:31:44] [INFO ] Invariant cache hit.
[2023-03-23 00:31:45] [INFO ] Implicit Places using invariants in 1302 ms returned [1544, 1548]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1306 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 87 ms. Remains 1563 /1565 variables (removed 2) and now considering 1326/1328 (removed 2) transitions.
// Phase 1: matrix 1326 rows 1563 cols
[2023-03-23 00:31:46] [INFO ] Computed 548 place invariants in 11 ms
[2023-03-23 00:31:47] [INFO ] Implicit Places using invariants in 1198 ms returned []
[2023-03-23 00:31:47] [INFO ] Invariant cache hit.
[2023-03-23 00:31:48] [INFO ] State equation strengthened by 202 read => feed constraints.
[2023-03-23 00:31:52] [INFO ] Implicit Places using invariants and state equation in 4785 ms returned []
Implicit Place search using SMT with State Equation took 6006 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 7458 ms. Remains : 1563/1567 places, 1326/1328 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) 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 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 124 ms. (steps per millisecond=80 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) 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
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 73515 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73515 steps, saw 39026 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-23 00:31:56] [INFO ] Invariant cache hit.
[2023-03-23 00:31:57] [INFO ] [Real]Absence check using 548 positive place invariants in 160 ms returned sat
[2023-03-23 00:31:57] [INFO ] After 706ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-23 00:31:57] [INFO ] [Nat]Absence check using 548 positive place invariants in 190 ms returned sat
[2023-03-23 00:32:00] [INFO ] After 2285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-23 00:32:00] [INFO ] State equation strengthened by 202 read => feed constraints.
[2023-03-23 00:32:03] [INFO ] After 2548ms SMT Verify possible using 202 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-23 00:32:03] [INFO ] Deduced a trap composed of 8 places in 508 ms of which 13 ms to minimize.
[2023-03-23 00:32:04] [INFO ] Deduced a trap composed of 8 places in 360 ms of which 1 ms to minimize.
[2023-03-23 00:32:04] [INFO ] Deduced a trap composed of 12 places in 779 ms of which 2 ms to minimize.
[2023-03-23 00:32:05] [INFO ] Deduced a trap composed of 8 places in 391 ms of which 1 ms to minimize.
[2023-03-23 00:32:05] [INFO ] Deduced a trap composed of 12 places in 298 ms of which 1 ms to minimize.
[2023-03-23 00:32:06] [INFO ] Deduced a trap composed of 11 places in 340 ms of which 0 ms to minimize.
[2023-03-23 00:32:07] [INFO ] Deduced a trap composed of 12 places in 700 ms of which 1 ms to minimize.
[2023-03-23 00:32:07] [INFO ] Deduced a trap composed of 9 places in 324 ms of which 1 ms to minimize.
[2023-03-23 00:32:07] [INFO ] Deduced a trap composed of 10 places in 313 ms of which 1 ms to minimize.
[2023-03-23 00:32:08] [INFO ] Deduced a trap composed of 14 places in 248 ms of which 1 ms to minimize.
[2023-03-23 00:32:08] [INFO ] Deduced a trap composed of 5 places in 458 ms of which 1 ms to minimize.
[2023-03-23 00:32:10] [INFO ] Deduced a trap composed of 7 places in 1047 ms of which 1 ms to minimize.
[2023-03-23 00:32:10] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 7152 ms
[2023-03-23 00:32:11] [INFO ] Deduced a trap composed of 4 places in 719 ms of which 22 ms to minimize.
[2023-03-23 00:32:12] [INFO ] Deduced a trap composed of 13 places in 326 ms of which 1 ms to minimize.
[2023-03-23 00:32:12] [INFO ] Deduced a trap composed of 7 places in 391 ms of which 1 ms to minimize.
[2023-03-23 00:32:13] [INFO ] Deduced a trap composed of 7 places in 317 ms of which 0 ms to minimize.
[2023-03-23 00:32:13] [INFO ] Deduced a trap composed of 15 places in 520 ms of which 0 ms to minimize.
[2023-03-23 00:32:14] [INFO ] Deduced a trap composed of 14 places in 336 ms of which 1 ms to minimize.
[2023-03-23 00:32:14] [INFO ] Deduced a trap composed of 11 places in 500 ms of which 1 ms to minimize.
[2023-03-23 00:32:15] [INFO ] Deduced a trap composed of 16 places in 448 ms of which 2 ms to minimize.
[2023-03-23 00:32:15] [INFO ] Deduced a trap composed of 14 places in 309 ms of which 0 ms to minimize.
[2023-03-23 00:32:16] [INFO ] Deduced a trap composed of 17 places in 285 ms of which 1 ms to minimize.
[2023-03-23 00:32:16] [INFO ] Deduced a trap composed of 15 places in 285 ms of which 1 ms to minimize.
[2023-03-23 00:32:16] [INFO ] Deduced a trap composed of 17 places in 299 ms of which 1 ms to minimize.
[2023-03-23 00:32:17] [INFO ] Deduced a trap composed of 17 places in 411 ms of which 2 ms to minimize.
[2023-03-23 00:32:17] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 6317 ms
[2023-03-23 00:32:18] [INFO ] Deduced a trap composed of 7 places in 303 ms of which 1 ms to minimize.
[2023-03-23 00:32:18] [INFO ] Deduced a trap composed of 8 places in 305 ms of which 1 ms to minimize.
[2023-03-23 00:32:18] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 1 ms to minimize.
[2023-03-23 00:32:19] [INFO ] Deduced a trap composed of 7 places in 317 ms of which 1 ms to minimize.
[2023-03-23 00:32:19] [INFO ] Deduced a trap composed of 8 places in 337 ms of which 1 ms to minimize.
[2023-03-23 00:32:19] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 1 ms to minimize.
[2023-03-23 00:32:20] [INFO ] Deduced a trap composed of 16 places in 357 ms of which 0 ms to minimize.
[2023-03-23 00:32:20] [INFO ] Deduced a trap composed of 12 places in 308 ms of which 1 ms to minimize.
[2023-03-23 00:32:21] [INFO ] Deduced a trap composed of 15 places in 302 ms of which 0 ms to minimize.
[2023-03-23 00:32:21] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 1 ms to minimize.
[2023-03-23 00:32:21] [INFO ] Deduced a trap composed of 10 places in 353 ms of which 1 ms to minimize.
[2023-03-23 00:32:22] [INFO ] Deduced a trap composed of 16 places in 318 ms of which 0 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-23 00:32:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 00:32:22] [INFO ] After 25247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 382 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 39 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 39 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-23 00:32:22] [INFO ] Invariant cache hit.
[2023-03-23 00:32:23] [INFO ] Implicit Places using invariants in 1004 ms returned []
[2023-03-23 00:32:23] [INFO ] Invariant cache hit.
[2023-03-23 00:32:24] [INFO ] State equation strengthened by 202 read => feed constraints.
[2023-03-23 00:32:29] [INFO ] Implicit Places using invariants and state equation in 5391 ms returned []
Implicit Place search using SMT with State Equation took 6416 ms to find 0 implicit places.
[2023-03-23 00:32:29] [INFO ] Redundant transitions in 107 ms returned []
[2023-03-23 00:32:29] [INFO ] Invariant cache hit.
[2023-03-23 00:32:30] [INFO ] Dead Transitions using invariants and state equation in 969 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7553 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 130 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-23 00:32:30] [INFO ] Computed 548 place invariants in 11 ms
[2023-03-23 00:32:31] [INFO ] [Real]Absence check using 548 positive place invariants in 190 ms returned sat
[2023-03-23 00:32:31] [INFO ] After 899ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-23 00:32:32] [INFO ] [Nat]Absence check using 548 positive place invariants in 498 ms returned sat
[2023-03-23 00:32:35] [INFO ] After 2404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-23 00:32:35] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-23 00:32:37] [INFO ] After 2056ms SMT Verify possible using 159 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-23 00:32:38] [INFO ] Deduced a trap composed of 11 places in 1062 ms of which 1 ms to minimize.
[2023-03-23 00:32:39] [INFO ] Deduced a trap composed of 6 places in 996 ms of which 1 ms to minimize.
[2023-03-23 00:32:40] [INFO ] Deduced a trap composed of 8 places in 691 ms of which 2 ms to minimize.
[2023-03-23 00:32:41] [INFO ] Deduced a trap composed of 6 places in 555 ms of which 2 ms to minimize.
[2023-03-23 00:32:41] [INFO ] Deduced a trap composed of 7 places in 557 ms of which 2 ms to minimize.
[2023-03-23 00:32:42] [INFO ] Deduced a trap composed of 11 places in 436 ms of which 1 ms to minimize.
[2023-03-23 00:32:43] [INFO ] Deduced a trap composed of 8 places in 1029 ms of which 1 ms to minimize.
[2023-03-23 00:32:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 6064 ms
[2023-03-23 00:32:44] [INFO ] Deduced a trap composed of 3 places in 638 ms of which 1 ms to minimize.
[2023-03-23 00:32:45] [INFO ] Deduced a trap composed of 7 places in 636 ms of which 1 ms to minimize.
[2023-03-23 00:32:45] [INFO ] Deduced a trap composed of 8 places in 414 ms of which 3 ms to minimize.
[2023-03-23 00:32:47] [INFO ] Deduced a trap composed of 20 places in 1446 ms of which 1 ms to minimize.
[2023-03-23 00:32:47] [INFO ] Deduced a trap composed of 5 places in 459 ms of which 1 ms to minimize.
[2023-03-23 00:32:48] [INFO ] Deduced a trap composed of 12 places in 444 ms of which 2 ms to minimize.
[2023-03-23 00:32:49] [INFO ] Deduced a trap composed of 17 places in 550 ms of which 1 ms to minimize.
[2023-03-23 00:32:49] [INFO ] Deduced a trap composed of 15 places in 583 ms of which 1 ms to minimize.
[2023-03-23 00:32:50] [INFO ] Deduced a trap composed of 9 places in 987 ms of which 2 ms to minimize.
[2023-03-23 00:32:51] [INFO ] Deduced a trap composed of 11 places in 661 ms of which 1 ms to minimize.
[2023-03-23 00:32:52] [INFO ] Deduced a trap composed of 14 places in 497 ms of which 1 ms to minimize.
[2023-03-23 00:32:52] [INFO ] Deduced a trap composed of 12 places in 453 ms of which 1 ms to minimize.
[2023-03-23 00:32:53] [INFO ] Deduced a trap composed of 10 places in 570 ms of which 2 ms to minimize.
[2023-03-23 00:32:54] [INFO ] Deduced a trap composed of 9 places in 467 ms of which 4 ms to minimize.
[2023-03-23 00:32:54] [INFO ] Deduced a trap composed of 14 places in 516 ms of which 1 ms to minimize.
[2023-03-23 00:32:55] [INFO ] Deduced a trap composed of 11 places in 466 ms of which 23 ms to minimize.
[2023-03-23 00:32:55] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 11350 ms
[2023-03-23 00:32:56] [INFO ] Deduced a trap composed of 7 places in 734 ms of which 1 ms to minimize.
[2023-03-23 00:32:56] [INFO ] Deduced a trap composed of 4 places in 526 ms of which 1 ms to minimize.
[2023-03-23 00:32:57] [INFO ] Deduced a trap composed of 7 places in 361 ms of which 1 ms to minimize.
[2023-03-23 00:32:57] [INFO ] Deduced a trap composed of 12 places in 459 ms of which 1 ms to minimize.
[2023-03-23 00:32:58] [INFO ] Deduced a trap composed of 14 places in 425 ms of which 1 ms to minimize.
[2023-03-23 00:32:58] [INFO ] Deduced a trap composed of 15 places in 372 ms of which 3 ms to minimize.
[2023-03-23 00:32:59] [INFO ] Deduced a trap composed of 12 places in 398 ms of which 1 ms to minimize.
[2023-03-23 00:32:59] [INFO ] Deduced a trap composed of 19 places in 417 ms of which 1 ms to minimize.
[2023-03-23 00:32:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4284 ms
[2023-03-23 00:33:00] [INFO ] Deduced a trap composed of 15 places in 504 ms of which 1 ms to minimize.
[2023-03-23 00:33:01] [INFO ] Deduced a trap composed of 25 places in 637 ms of which 1 ms to minimize.
[2023-03-23 00:33:01] [INFO ] Deduced a trap composed of 21 places in 293 ms of which 1 ms to minimize.
[2023-03-23 00:33:01] [INFO ] Deduced a trap composed of 17 places in 300 ms of which 0 ms to minimize.
[2023-03-23 00:33:02] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 1 ms to minimize.
[2023-03-23 00:33:02] [INFO ] Deduced a trap composed of 23 places in 410 ms of which 1 ms to minimize.
[2023-03-23 00:33:03] [INFO ] Deduced a trap composed of 23 places in 682 ms of which 1 ms to minimize.
[2023-03-23 00:33:03] [INFO ] Deduced a trap composed of 17 places in 308 ms of which 1 ms to minimize.
[2023-03-23 00:33:04] [INFO ] Deduced a trap composed of 18 places in 626 ms of which 1 ms to minimize.
[2023-03-23 00:33:05] [INFO ] Deduced a trap composed of 15 places in 359 ms of which 1 ms to minimize.
[2023-03-23 00:33:05] [INFO ] Deduced a trap composed of 13 places in 500 ms of which 2 ms to minimize.
[2023-03-23 00:33:06] [INFO ] Deduced a trap composed of 15 places in 475 ms of which 1 ms to minimize.
[2023-03-23 00:33:06] [INFO ] Deduced a trap composed of 14 places in 429 ms of which 1 ms to minimize.
[2023-03-23 00:33:07] [INFO ] Deduced a trap composed of 13 places in 794 ms of which 1 ms to minimize.
[2023-03-23 00:33:08] [INFO ] Deduced a trap composed of 13 places in 1093 ms of which 1 ms to minimize.
[2023-03-23 00:33:09] [INFO ] Deduced a trap composed of 16 places in 358 ms of which 1 ms to minimize.
[2023-03-23 00:33:09] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 9356 ms
[2023-03-23 00:33:11] [INFO ] Deduced a trap composed of 16 places in 2293 ms of which 1 ms to minimize.
[2023-03-23 00:33:12] [INFO ] Deduced a trap composed of 18 places in 812 ms of which 1 ms to minimize.
[2023-03-23 00:33:13] [INFO ] Deduced a trap composed of 13 places in 512 ms of which 1 ms to minimize.
[2023-03-23 00:33:13] [INFO ] Deduced a trap composed of 17 places in 340 ms of which 1 ms to minimize.
[2023-03-23 00:33:14] [INFO ] Deduced a trap composed of 20 places in 477 ms of which 1 ms to minimize.
[2023-03-23 00:33:14] [INFO ] Deduced a trap composed of 15 places in 446 ms of which 1 ms to minimize.
[2023-03-23 00:33:15] [INFO ] Deduced a trap composed of 15 places in 588 ms of which 1 ms to minimize.
[2023-03-23 00:33:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 6056 ms
[2023-03-23 00:33:16] [INFO ] Deduced a trap composed of 3 places in 336 ms of which 1 ms to minimize.
[2023-03-23 00:33:16] [INFO ] Deduced a trap composed of 7 places in 497 ms of which 1 ms to minimize.
[2023-03-23 00:33:17] [INFO ] Deduced a trap composed of 7 places in 463 ms of which 2 ms to minimize.
[2023-03-23 00:33:18] [INFO ] Deduced a trap composed of 12 places in 770 ms of which 1 ms to minimize.
[2023-03-23 00:33:18] [INFO ] Deduced a trap composed of 9 places in 402 ms of which 1 ms to minimize.
[2023-03-23 00:33:19] [INFO ] Deduced a trap composed of 12 places in 315 ms of which 1 ms to minimize.
[2023-03-23 00:33:19] [INFO ] Deduced a trap composed of 6 places in 344 ms of which 1 ms to minimize.
[2023-03-23 00:33:19] [INFO ] Deduced a trap composed of 6 places in 336 ms of which 1 ms to minimize.
[2023-03-23 00:33:20] [INFO ] Deduced a trap composed of 7 places in 312 ms of which 1 ms to minimize.
[2023-03-23 00:33:20] [INFO ] Deduced a trap composed of 16 places in 523 ms of which 2 ms to minimize.
[2023-03-23 00:33:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5077 ms
[2023-03-23 00:33:21] [INFO ] Deduced a trap composed of 13 places in 308 ms of which 1 ms to minimize.
[2023-03-23 00:33:21] [INFO ] Deduced a trap composed of 23 places in 312 ms of which 1 ms to minimize.
[2023-03-23 00:33:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 783 ms
[2023-03-23 00:33:22] [INFO ] Deduced a trap composed of 7 places in 355 ms of which 1 ms to minimize.
[2023-03-23 00:33:22] [INFO ] Deduced a trap composed of 16 places in 447 ms of which 0 ms to minimize.
[2023-03-23 00:33:23] [INFO ] Deduced a trap composed of 21 places in 364 ms of which 1 ms to minimize.
[2023-03-23 00:33:23] [INFO ] Deduced a trap composed of 16 places in 671 ms of which 1 ms to minimize.
[2023-03-23 00:33:24] [INFO ] Deduced a trap composed of 7 places in 404 ms of which 1 ms to minimize.
[2023-03-23 00:33:24] [INFO ] Deduced a trap composed of 12 places in 391 ms of which 2 ms to minimize.
[2023-03-23 00:33:25] [INFO ] Deduced a trap composed of 16 places in 531 ms of which 1 ms to minimize.
[2023-03-23 00:33:25] [INFO ] Deduced a trap composed of 15 places in 355 ms of which 0 ms to minimize.
[2023-03-23 00:33:26] [INFO ] Deduced a trap composed of 12 places in 264 ms of which 1 ms to minimize.
[2023-03-23 00:33:26] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4488 ms
[2023-03-23 00:33:27] [INFO ] Deduced a trap composed of 5 places in 916 ms of which 1 ms to minimize.
[2023-03-23 00:33:27] [INFO ] Deduced a trap composed of 5 places in 333 ms of which 1 ms to minimize.
[2023-03-23 00:33:28] [INFO ] Deduced a trap composed of 6 places in 375 ms of which 1 ms to minimize.
[2023-03-23 00:33:28] [INFO ] Deduced a trap composed of 6 places in 374 ms of which 1 ms to minimize.
[2023-03-23 00:33:29] [INFO ] Deduced a trap composed of 14 places in 381 ms of which 1 ms to minimize.
[2023-03-23 00:33:29] [INFO ] Deduced a trap composed of 12 places in 378 ms of which 1 ms to minimize.
[2023-03-23 00:33:30] [INFO ] Deduced a trap composed of 12 places in 598 ms of which 2 ms to minimize.
[2023-03-23 00:33:31] [INFO ] Deduced a trap composed of 9 places in 643 ms of which 2 ms to minimize.
[2023-03-23 00:33:31] [INFO ] Deduced a trap composed of 16 places in 477 ms of which 0 ms to minimize.
[2023-03-23 00:33:32] [INFO ] Deduced a trap composed of 12 places in 901 ms of which 1 ms to minimize.
[2023-03-23 00:33:33] [INFO ] Deduced a trap composed of 15 places in 391 ms of which 1 ms to minimize.
[2023-03-23 00:33:33] [INFO ] Deduced a trap composed of 4 places in 374 ms of which 1 ms to minimize.
[2023-03-23 00:33:34] [INFO ] Deduced a trap composed of 17 places in 438 ms of which 1 ms to minimize.
[2023-03-23 00:33:34] [INFO ] Deduced a trap composed of 15 places in 400 ms of which 1 ms to minimize.
[2023-03-23 00:33:35] [INFO ] Deduced a trap composed of 14 places in 443 ms of which 1 ms to minimize.
[2023-03-23 00:33:35] [INFO ] Deduced a trap composed of 18 places in 328 ms of which 0 ms to minimize.
[2023-03-23 00:33:36] [INFO ] Deduced a trap composed of 15 places in 502 ms of which 0 ms to minimize.
[2023-03-23 00:33:36] [INFO ] Deduced a trap composed of 16 places in 371 ms of which 1 ms to minimize.
[2023-03-23 00:33:36] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 10209 ms
[2023-03-23 00:33:37] [INFO ] Deduced a trap composed of 14 places in 290 ms of which 1 ms to minimize.
[2023-03-23 00:33:37] [INFO ] Deduced a trap composed of 6 places in 416 ms of which 1 ms to minimize.
[2023-03-23 00:33:38] [INFO ] Deduced a trap composed of 11 places in 470 ms of which 1 ms to minimize.
[2023-03-23 00:33:38] [INFO ] Deduced a trap composed of 12 places in 303 ms of which 1 ms to minimize.
[2023-03-23 00:33:39] [INFO ] Deduced a trap composed of 13 places in 321 ms of which 1 ms to minimize.
[2023-03-23 00:33:39] [INFO ] Deduced a trap composed of 12 places in 367 ms of which 1 ms to minimize.
[2023-03-23 00:33:39] [INFO ] Deduced a trap composed of 12 places in 336 ms of which 1 ms to minimize.
[2023-03-23 00:33:40] [INFO ] Deduced a trap composed of 17 places in 576 ms of which 1 ms to minimize.
[2023-03-23 00:33:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3756 ms
[2023-03-23 00:33:41] [INFO ] Deduced a trap composed of 5 places in 378 ms of which 0 ms to minimize.
[2023-03-23 00:33:41] [INFO ] Deduced a trap composed of 7 places in 280 ms of which 1 ms to minimize.
[2023-03-23 00:33:42] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 1 ms to minimize.
[2023-03-23 00:33:42] [INFO ] Deduced a trap composed of 20 places in 356 ms of which 1 ms to minimize.
[2023-03-23 00:33:42] [INFO ] Deduced a trap composed of 15 places in 267 ms of which 0 ms to minimize.
[2023-03-23 00:33:43] [INFO ] Deduced a trap composed of 13 places in 519 ms of which 1 ms to minimize.
[2023-03-23 00:33:44] [INFO ] Deduced a trap composed of 12 places in 392 ms of which 2 ms to minimize.
[2023-03-23 00:33:44] [INFO ] Deduced a trap composed of 13 places in 361 ms of which 1 ms to minimize.
[2023-03-23 00:33:44] [INFO ] Deduced a trap composed of 13 places in 254 ms of which 1 ms to minimize.
[2023-03-23 00:33:45] [INFO ] Deduced a trap composed of 14 places in 551 ms of which 1 ms to minimize.
[2023-03-23 00:33:45] [INFO ] Deduced a trap composed of 12 places in 375 ms of which 0 ms to minimize.
[2023-03-23 00:33:46] [INFO ] Deduced a trap composed of 15 places in 549 ms of which 14 ms to minimize.
[2023-03-23 00:33:46] [INFO ] Deduced a trap composed of 18 places in 344 ms of which 1 ms to minimize.
[2023-03-23 00:33:47] [INFO ] Deduced a trap composed of 18 places in 411 ms of which 1 ms to minimize.
[2023-03-23 00:33:47] [INFO ] Deduced a trap composed of 18 places in 421 ms of which 1 ms to minimize.
[2023-03-23 00:33:48] [INFO ] Deduced a trap composed of 19 places in 591 ms of which 2 ms to minimize.
[2023-03-23 00:33:49] [INFO ] Deduced a trap composed of 15 places in 450 ms of which 1 ms to minimize.
[2023-03-23 00:33:49] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 8233 ms
[2023-03-23 00:33:49] [INFO ] After 74035ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 3002 ms.
[2023-03-23 00:33:52] [INFO ] After 80832ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
[2023-03-23 00:33:52] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2023-03-23 00:33:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1563 places, 1326 transitions and 5216 arcs took 12 ms.
[2023-03-23 00:33:52] [INFO ] Flatten gal took : 277 ms
Total runtime 224418 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: ShieldPPPt_PT_050B
(NrP: 1563 NrTr: 1326 NrArc: 5216)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.172sec
net check time: 0m 0.000sec
init dd package: 0m 2.936sec
before gc: list nodes free: 786144
after gc: idd nodes used:143215, unused:63856785; list nodes free:271960987
before gc: list nodes free: 648021
after gc: idd nodes used:199029, unused:63800971; list nodes free:284290332
before gc: list nodes free: 484044
after gc: idd nodes used:432674, unused:63567326; list nodes free:289494870
before gc: list nodes free: 6877999
after gc: idd nodes used:185183, unused:63814817; list nodes free:290643281
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6155000 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16094712 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.008sec
81118 95983 135027 357094 225303 227254
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="marciexred"
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 marciexred"
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 r394-oct2-167903718200687"
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 '
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 ;