About the Execution of Marcie+red for ShieldPPPs-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10089.228 | 3600000.00 | 3710104.00 | 150.90 | FTTTTF?T?FFFTF?? | 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-167903718000510.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 ShieldPPPs-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718000510
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 01:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 01:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 888K 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 ShieldPPPs-PT-050B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679520823043
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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-050B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 21:33:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 21:33:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 21:33:46] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2023-03-22 21:33:46] [INFO ] Transformed 3403 places.
[2023-03-22 21:33:46] [INFO ] Transformed 3153 transitions.
[2023-03-22 21:33:46] [INFO ] Found NUPN structural information;
[2023-03-22 21:33:46] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 484 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 594 ms. (steps per millisecond=16 ) properties (out of 14) seen :6
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 3153 rows 3403 cols
[2023-03-22 21:33:47] [INFO ] Computed 551 place invariants in 68 ms
[2023-03-22 21:33:48] [INFO ] After 1450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 21:33:50] [INFO ] [Nat]Absence check using 551 positive place invariants in 414 ms returned sat
[2023-03-22 21:34:00] [INFO ] After 9453ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 21:34:04] [INFO ] Deduced a trap composed of 27 places in 1487 ms of which 49 ms to minimize.
[2023-03-22 21:34:06] [INFO ] Deduced a trap composed of 14 places in 1695 ms of which 15 ms to minimize.
[2023-03-22 21:34:08] [INFO ] Deduced a trap composed of 23 places in 1541 ms of which 5 ms to minimize.
[2023-03-22 21:34:09] [INFO ] Deduced a trap composed of 23 places in 1606 ms of which 15 ms to minimize.
[2023-03-22 21:34:11] [INFO ] Deduced a trap composed of 26 places in 1546 ms of which 8 ms to minimize.
[2023-03-22 21:34:13] [INFO ] Deduced a trap composed of 31 places in 1339 ms of which 3 ms to minimize.
[2023-03-22 21:34:15] [INFO ] Deduced a trap composed of 31 places in 2067 ms of which 17 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-22 21:34:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 21:34:15] [INFO ] After 26467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 1324 ms.
Support contains 113 out of 3403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Drop transitions removed 310 transitions
Trivial Post-agglo rules discarded 310 transitions
Performed 310 trivial Post agglomeration. Transition count delta: 310
Iterating post reduction 0 with 310 rules applied. Total rules applied 310 place count 3403 transition count 2843
Reduce places removed 310 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 327 rules applied. Total rules applied 637 place count 3093 transition count 2826
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 654 place count 3076 transition count 2826
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 248 Pre rules applied. Total rules applied 654 place count 3076 transition count 2578
Deduced a syphon composed of 248 places in 19 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 1150 place count 2828 transition count 2578
Discarding 315 places :
Symmetric choice reduction at 3 with 315 rule applications. Total rules 1465 place count 2513 transition count 2263
Iterating global reduction 3 with 315 rules applied. Total rules applied 1780 place count 2513 transition count 2263
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 1780 place count 2513 transition count 2139
Deduced a syphon composed of 124 places in 44 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 2028 place count 2389 transition count 2139
Performed 702 Post agglomeration using F-continuation condition.Transition count delta: 702
Deduced a syphon composed of 702 places in 3 ms
Reduce places removed 702 places and 0 transitions.
Iterating global reduction 3 with 1404 rules applied. Total rules applied 3432 place count 1687 transition count 1437
Partial Free-agglomeration rule applied 406 times.
Drop transitions removed 406 transitions
Iterating global reduction 3 with 406 rules applied. Total rules applied 3838 place count 1687 transition count 1437
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3839 place count 1686 transition count 1436
Applied a total of 3839 rules in 1265 ms. Remains 1686 /3403 variables (removed 1717) and now considering 1436/3153 (removed 1717) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1266 ms. Remains : 1686/3403 places, 1436/3153 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 6) 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 6) 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 6) 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 6) seen :1
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1436 rows 1686 cols
[2023-03-22 21:34:18] [INFO ] Computed 551 place invariants in 61 ms
[2023-03-22 21:34:19] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 21:34:20] [INFO ] [Nat]Absence check using 526 positive place invariants in 378 ms returned sat
[2023-03-22 21:34:20] [INFO ] [Nat]Absence check using 526 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-22 21:34:23] [INFO ] After 3008ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 21:34:24] [INFO ] Deduced a trap composed of 5 places in 359 ms of which 0 ms to minimize.
[2023-03-22 21:34:25] [INFO ] Deduced a trap composed of 7 places in 1111 ms of which 0 ms to minimize.
[2023-03-22 21:34:25] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 0 ms to minimize.
[2023-03-22 21:34:26] [INFO ] Deduced a trap composed of 6 places in 415 ms of which 1 ms to minimize.
[2023-03-22 21:34:26] [INFO ] Deduced a trap composed of 8 places in 408 ms of which 1 ms to minimize.
[2023-03-22 21:34:27] [INFO ] Deduced a trap composed of 7 places in 570 ms of which 0 ms to minimize.
[2023-03-22 21:34:27] [INFO ] Deduced a trap composed of 11 places in 331 ms of which 1 ms to minimize.
[2023-03-22 21:34:28] [INFO ] Deduced a trap composed of 6 places in 377 ms of which 0 ms to minimize.
[2023-03-22 21:34:28] [INFO ] Deduced a trap composed of 7 places in 262 ms of which 1 ms to minimize.
[2023-03-22 21:34:28] [INFO ] Deduced a trap composed of 8 places in 269 ms of which 0 ms to minimize.
[2023-03-22 21:34:29] [INFO ] Deduced a trap composed of 6 places in 295 ms of which 0 ms to minimize.
[2023-03-22 21:34:29] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 0 ms to minimize.
[2023-03-22 21:34:30] [INFO ] Deduced a trap composed of 9 places in 300 ms of which 1 ms to minimize.
[2023-03-22 21:34:30] [INFO ] Deduced a trap composed of 10 places in 272 ms of which 1 ms to minimize.
[2023-03-22 21:34:30] [INFO ] Deduced a trap composed of 9 places in 467 ms of which 1 ms to minimize.
[2023-03-22 21:34:31] [INFO ] Deduced a trap composed of 6 places in 387 ms of which 2 ms to minimize.
[2023-03-22 21:34:31] [INFO ] Deduced a trap composed of 7 places in 285 ms of which 1 ms to minimize.
[2023-03-22 21:34:32] [INFO ] Deduced a trap composed of 8 places in 565 ms of which 1 ms to minimize.
[2023-03-22 21:34:32] [INFO ] Deduced a trap composed of 7 places in 273 ms of which 0 ms to minimize.
[2023-03-22 21:34:33] [INFO ] Deduced a trap composed of 8 places in 240 ms of which 0 ms to minimize.
[2023-03-22 21:34:33] [INFO ] Deduced a trap composed of 6 places in 361 ms of which 0 ms to minimize.
[2023-03-22 21:34:34] [INFO ] Deduced a trap composed of 13 places in 291 ms of which 1 ms to minimize.
[2023-03-22 21:34:34] [INFO ] Deduced a trap composed of 7 places in 289 ms of which 1 ms to minimize.
[2023-03-22 21:34:34] [INFO ] Deduced a trap composed of 12 places in 257 ms of which 1 ms to minimize.
[2023-03-22 21:34:35] [INFO ] Deduced a trap composed of 10 places in 277 ms of which 1 ms to minimize.
[2023-03-22 21:34:35] [INFO ] Deduced a trap composed of 10 places in 477 ms of which 1 ms to minimize.
[2023-03-22 21:34:36] [INFO ] Deduced a trap composed of 12 places in 324 ms of which 1 ms to minimize.
[2023-03-22 21:34:36] [INFO ] Deduced a trap composed of 9 places in 468 ms of which 1 ms to minimize.
[2023-03-22 21:34:37] [INFO ] Deduced a trap composed of 11 places in 750 ms of which 1 ms to minimize.
[2023-03-22 21:34:38] [INFO ] Deduced a trap composed of 13 places in 671 ms of which 1 ms to minimize.
[2023-03-22 21:34:39] [INFO ] Deduced a trap composed of 9 places in 614 ms of which 1 ms to minimize.
[2023-03-22 21:34:39] [INFO ] Deduced a trap composed of 9 places in 372 ms of which 1 ms to minimize.
[2023-03-22 21:34:40] [INFO ] Deduced a trap composed of 8 places in 347 ms of which 1 ms to minimize.
[2023-03-22 21:34:40] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 1 ms to minimize.
[2023-03-22 21:34:40] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 0 ms to minimize.
[2023-03-22 21:34:41] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 1 ms to minimize.
[2023-03-22 21:34:41] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 1 ms to minimize.
[2023-03-22 21:34:41] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 0 ms to minimize.
[2023-03-22 21:34:41] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 0 ms to minimize.
[2023-03-22 21:34:42] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 0 ms to minimize.
[2023-03-22 21:34:42] [INFO ] Deduced a trap composed of 17 places in 306 ms of which 1 ms to minimize.
[2023-03-22 21:34:42] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 0 ms to minimize.
[2023-03-22 21:34:43] [INFO ] Deduced a trap composed of 25 places in 351 ms of which 1 ms to minimize.
[2023-03-22 21:34:43] [INFO ] Deduced a trap composed of 8 places in 226 ms of which 13 ms to minimize.
[2023-03-22 21:34:43] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 0 ms to minimize.
[2023-03-22 21:34:44] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 20406 ms
[2023-03-22 21:34:44] [INFO ] Deduced a trap composed of 11 places in 370 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-22 21:34:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 21:34:44] [INFO ] After 25327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 375 ms.
Support contains 86 out of 1686 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1686/1686 places, 1436/1436 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1686 transition count 1430
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 1680 transition count 1430
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 12 place count 1680 transition count 1423
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 26 place count 1673 transition count 1423
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 1672 transition count 1422
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 1672 transition count 1422
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 70 place count 1651 transition count 1401
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 1651 transition count 1401
Applied a total of 76 rules in 240 ms. Remains 1651 /1686 variables (removed 35) and now considering 1401/1436 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 1651/1686 places, 1401/1436 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 68646 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68646 steps, saw 63252 distinct states, run finished after 3006 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1401 rows 1651 cols
[2023-03-22 21:34:48] [INFO ] Computed 551 place invariants in 17 ms
[2023-03-22 21:34:49] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 21:34:49] [INFO ] [Nat]Absence check using 525 positive place invariants in 167 ms returned sat
[2023-03-22 21:34:49] [INFO ] [Nat]Absence check using 525 positive and 26 generalized place invariants in 7 ms returned sat
[2023-03-22 21:34:52] [INFO ] After 2518ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 21:34:53] [INFO ] Deduced a trap composed of 8 places in 282 ms of which 1 ms to minimize.
[2023-03-22 21:34:54] [INFO ] Deduced a trap composed of 6 places in 498 ms of which 1 ms to minimize.
[2023-03-22 21:34:54] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 18 ms to minimize.
[2023-03-22 21:34:54] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 1 ms to minimize.
[2023-03-22 21:34:55] [INFO ] Deduced a trap composed of 7 places in 364 ms of which 1 ms to minimize.
[2023-03-22 21:34:55] [INFO ] Deduced a trap composed of 8 places in 296 ms of which 1 ms to minimize.
[2023-03-22 21:34:56] [INFO ] Deduced a trap composed of 7 places in 398 ms of which 1 ms to minimize.
[2023-03-22 21:34:56] [INFO ] Deduced a trap composed of 9 places in 323 ms of which 1 ms to minimize.
[2023-03-22 21:34:57] [INFO ] Deduced a trap composed of 6 places in 419 ms of which 1 ms to minimize.
[2023-03-22 21:34:57] [INFO ] Deduced a trap composed of 8 places in 277 ms of which 1 ms to minimize.
[2023-03-22 21:34:57] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 1 ms to minimize.
[2023-03-22 21:34:58] [INFO ] Deduced a trap composed of 8 places in 338 ms of which 0 ms to minimize.
[2023-03-22 21:34:58] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 0 ms to minimize.
[2023-03-22 21:34:59] [INFO ] Deduced a trap composed of 7 places in 512 ms of which 16 ms to minimize.
[2023-03-22 21:34:59] [INFO ] Deduced a trap composed of 6 places in 522 ms of which 23 ms to minimize.
[2023-03-22 21:35:00] [INFO ] Deduced a trap composed of 14 places in 310 ms of which 23 ms to minimize.
[2023-03-22 21:35:00] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 0 ms to minimize.
[2023-03-22 21:35:00] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 1 ms to minimize.
[2023-03-22 21:35:01] [INFO ] Deduced a trap composed of 6 places in 315 ms of which 0 ms to minimize.
[2023-03-22 21:35:01] [INFO ] Deduced a trap composed of 6 places in 496 ms of which 0 ms to minimize.
[2023-03-22 21:35:02] [INFO ] Deduced a trap composed of 7 places in 212 ms of which 1 ms to minimize.
[2023-03-22 21:35:02] [INFO ] Deduced a trap composed of 7 places in 405 ms of which 1 ms to minimize.
[2023-03-22 21:35:03] [INFO ] Deduced a trap composed of 8 places in 603 ms of which 0 ms to minimize.
[2023-03-22 21:35:03] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 1 ms to minimize.
[2023-03-22 21:35:03] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 0 ms to minimize.
[2023-03-22 21:35:04] [INFO ] Deduced a trap composed of 9 places in 253 ms of which 1 ms to minimize.
[2023-03-22 21:35:04] [INFO ] Deduced a trap composed of 8 places in 281 ms of which 0 ms to minimize.
[2023-03-22 21:35:04] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 1 ms to minimize.
[2023-03-22 21:35:05] [INFO ] Deduced a trap composed of 7 places in 489 ms of which 1 ms to minimize.
[2023-03-22 21:35:05] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 1 ms to minimize.
[2023-03-22 21:35:06] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 0 ms to minimize.
[2023-03-22 21:35:06] [INFO ] Deduced a trap composed of 7 places in 249 ms of which 1 ms to minimize.
[2023-03-22 21:35:06] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 1 ms to minimize.
[2023-03-22 21:35:07] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 0 ms to minimize.
[2023-03-22 21:35:07] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 0 ms to minimize.
[2023-03-22 21:35:07] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 1 ms to minimize.
[2023-03-22 21:35:08] [INFO ] Deduced a trap composed of 9 places in 282 ms of which 1 ms to minimize.
[2023-03-22 21:35:09] [INFO ] Deduced a trap composed of 10 places in 1685 ms of which 27 ms to minimize.
[2023-03-22 21:35:10] [INFO ] Deduced a trap composed of 12 places in 401 ms of which 1 ms to minimize.
[2023-03-22 21:35:10] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 0 ms to minimize.
[2023-03-22 21:35:11] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 1 ms to minimize.
[2023-03-22 21:35:11] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 0 ms to minimize.
[2023-03-22 21:35:11] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 0 ms to minimize.
[2023-03-22 21:35:11] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 1 ms to minimize.
[2023-03-22 21:35:12] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 0 ms to minimize.
[2023-03-22 21:35:12] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 0 ms to minimize.
[2023-03-22 21:35:12] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 2 ms to minimize.
[2023-03-22 21:35:12] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 19679 ms
[2023-03-22 21:35:13] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 1 ms to minimize.
[2023-03-22 21:35:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 368 ms
[2023-03-22 21:35:13] [INFO ] Deduced a trap composed of 5 places in 323 ms of which 1 ms to minimize.
[2023-03-22 21:35:14] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 0 ms to minimize.
[2023-03-22 21:35:14] [INFO ] Deduced a trap composed of 6 places in 278 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-22 21:35:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 21:35:14] [INFO ] After 25227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 295 ms.
Support contains 86 out of 1651 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1651/1651 places, 1401/1401 transitions.
Applied a total of 0 rules in 58 ms. Remains 1651 /1651 variables (removed 0) and now considering 1401/1401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 1651/1651 places, 1401/1401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1651/1651 places, 1401/1401 transitions.
Applied a total of 0 rules in 64 ms. Remains 1651 /1651 variables (removed 0) and now considering 1401/1401 (removed 0) transitions.
[2023-03-22 21:35:14] [INFO ] Invariant cache hit.
[2023-03-22 21:35:16] [INFO ] Implicit Places using invariants in 1359 ms returned []
[2023-03-22 21:35:16] [INFO ] Invariant cache hit.
[2023-03-22 21:35:19] [INFO ] Implicit Places using invariants and state equation in 3529 ms returned []
Implicit Place search using SMT with State Equation took 4890 ms to find 0 implicit places.
[2023-03-22 21:35:19] [INFO ] Redundant transitions in 81 ms returned []
[2023-03-22 21:35:19] [INFO ] Invariant cache hit.
[2023-03-22 21:35:20] [INFO ] Dead Transitions using invariants and state equation in 1005 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6062 ms. Remains : 1651/1651 places, 1401/1401 transitions.
Applied a total of 0 rules in 101 ms. Remains 1651 /1651 variables (removed 0) and now considering 1401/1401 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-22 21:35:21] [INFO ] Invariant cache hit.
[2023-03-22 21:35:21] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 21:35:21] [INFO ] [Nat]Absence check using 525 positive place invariants in 132 ms returned sat
[2023-03-22 21:35:21] [INFO ] [Nat]Absence check using 525 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-22 21:35:24] [INFO ] After 2116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 21:35:25] [INFO ] Deduced a trap composed of 8 places in 324 ms of which 1 ms to minimize.
[2023-03-22 21:35:25] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 0 ms to minimize.
[2023-03-22 21:35:26] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 1 ms to minimize.
[2023-03-22 21:35:26] [INFO ] Deduced a trap composed of 10 places in 431 ms of which 1 ms to minimize.
[2023-03-22 21:35:27] [INFO ] Deduced a trap composed of 7 places in 748 ms of which 1 ms to minimize.
[2023-03-22 21:35:28] [INFO ] Deduced a trap composed of 6 places in 578 ms of which 1 ms to minimize.
[2023-03-22 21:35:29] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 0 ms to minimize.
[2023-03-22 21:35:29] [INFO ] Deduced a trap composed of 15 places in 830 ms of which 1 ms to minimize.
[2023-03-22 21:35:30] [INFO ] Deduced a trap composed of 7 places in 444 ms of which 1 ms to minimize.
[2023-03-22 21:35:30] [INFO ] Deduced a trap composed of 9 places in 291 ms of which 1 ms to minimize.
[2023-03-22 21:35:31] [INFO ] Deduced a trap composed of 10 places in 437 ms of which 1 ms to minimize.
[2023-03-22 21:35:31] [INFO ] Deduced a trap composed of 8 places in 357 ms of which 0 ms to minimize.
[2023-03-22 21:35:32] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 1 ms to minimize.
[2023-03-22 21:35:32] [INFO ] Deduced a trap composed of 12 places in 255 ms of which 1 ms to minimize.
[2023-03-22 21:35:33] [INFO ] Deduced a trap composed of 9 places in 555 ms of which 0 ms to minimize.
[2023-03-22 21:35:33] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 0 ms to minimize.
[2023-03-22 21:35:33] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 1 ms to minimize.
[2023-03-22 21:35:34] [INFO ] Deduced a trap composed of 9 places in 554 ms of which 0 ms to minimize.
[2023-03-22 21:35:34] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 0 ms to minimize.
[2023-03-22 21:35:35] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 0 ms to minimize.
[2023-03-22 21:35:35] [INFO ] Deduced a trap composed of 8 places in 228 ms of which 0 ms to minimize.
[2023-03-22 21:35:35] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 0 ms to minimize.
[2023-03-22 21:35:35] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 0 ms to minimize.
[2023-03-22 21:35:36] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 1 ms to minimize.
[2023-03-22 21:35:36] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2023-03-22 21:35:36] [INFO ] Deduced a trap composed of 11 places in 279 ms of which 0 ms to minimize.
[2023-03-22 21:35:37] [INFO ] Deduced a trap composed of 14 places in 233 ms of which 0 ms to minimize.
[2023-03-22 21:35:37] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 0 ms to minimize.
[2023-03-22 21:35:37] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 1 ms to minimize.
[2023-03-22 21:35:38] [INFO ] Deduced a trap composed of 13 places in 269 ms of which 1 ms to minimize.
[2023-03-22 21:35:38] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 13016 ms
[2023-03-22 21:35:38] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 1 ms to minimize.
[2023-03-22 21:35:38] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 1 ms to minimize.
[2023-03-22 21:35:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 663 ms
[2023-03-22 21:35:39] [INFO ] Deduced a trap composed of 7 places in 373 ms of which 1 ms to minimize.
[2023-03-22 21:35:40] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 1 ms to minimize.
[2023-03-22 21:35:40] [INFO ] Deduced a trap composed of 8 places in 288 ms of which 0 ms to minimize.
[2023-03-22 21:35:40] [INFO ] Deduced a trap composed of 8 places in 273 ms of which 1 ms to minimize.
[2023-03-22 21:35:41] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 1 ms to minimize.
[2023-03-22 21:35:41] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 0 ms to minimize.
[2023-03-22 21:35:41] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 1 ms to minimize.
[2023-03-22 21:35:42] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 1 ms to minimize.
[2023-03-22 21:35:42] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 1 ms to minimize.
[2023-03-22 21:35:42] [INFO ] Deduced a trap composed of 10 places in 322 ms of which 1 ms to minimize.
[2023-03-22 21:35:43] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 1 ms to minimize.
[2023-03-22 21:35:43] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2023-03-22 21:35:43] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 1 ms to minimize.
[2023-03-22 21:35:44] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 0 ms to minimize.
[2023-03-22 21:35:44] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 0 ms to minimize.
[2023-03-22 21:35:44] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2023-03-22 21:35:45] [INFO ] Deduced a trap composed of 10 places in 263 ms of which 1 ms to minimize.
[2023-03-22 21:35:45] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2023-03-22 21:35:45] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 0 ms to minimize.
[2023-03-22 21:35:45] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 1 ms to minimize.
[2023-03-22 21:35:46] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 1 ms to minimize.
[2023-03-22 21:35:46] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 0 ms to minimize.
[2023-03-22 21:35:46] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 7033 ms
[2023-03-22 21:35:47] [INFO ] Deduced a trap composed of 8 places in 420 ms of which 2 ms to minimize.
[2023-03-22 21:35:48] [INFO ] Deduced a trap composed of 6 places in 350 ms of which 1 ms to minimize.
[2023-03-22 21:35:48] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 1 ms to minimize.
[2023-03-22 21:35:48] [INFO ] Deduced a trap composed of 9 places in 308 ms of which 2 ms to minimize.
[2023-03-22 21:35:49] [INFO ] Deduced a trap composed of 8 places in 350 ms of which 0 ms to minimize.
[2023-03-22 21:35:49] [INFO ] Deduced a trap composed of 7 places in 292 ms of which 0 ms to minimize.
[2023-03-22 21:35:50] [INFO ] Deduced a trap composed of 8 places in 323 ms of which 1 ms to minimize.
[2023-03-22 21:35:50] [INFO ] Deduced a trap composed of 6 places in 346 ms of which 1 ms to minimize.
[2023-03-22 21:35:51] [INFO ] Deduced a trap composed of 8 places in 325 ms of which 1 ms to minimize.
[2023-03-22 21:35:51] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 1 ms to minimize.
[2023-03-22 21:35:51] [INFO ] Deduced a trap composed of 6 places in 391 ms of which 1 ms to minimize.
[2023-03-22 21:35:52] [INFO ] Deduced a trap composed of 7 places in 382 ms of which 1 ms to minimize.
[2023-03-22 21:35:52] [INFO ] Deduced a trap composed of 6 places in 424 ms of which 0 ms to minimize.
[2023-03-22 21:35:53] [INFO ] Deduced a trap composed of 9 places in 410 ms of which 1 ms to minimize.
[2023-03-22 21:35:53] [INFO ] Deduced a trap composed of 8 places in 255 ms of which 0 ms to minimize.
[2023-03-22 21:35:54] [INFO ] Deduced a trap composed of 8 places in 354 ms of which 0 ms to minimize.
[2023-03-22 21:35:54] [INFO ] Deduced a trap composed of 8 places in 279 ms of which 1 ms to minimize.
[2023-03-22 21:35:55] [INFO ] Deduced a trap composed of 6 places in 558 ms of which 0 ms to minimize.
[2023-03-22 21:35:55] [INFO ] Deduced a trap composed of 8 places in 382 ms of which 0 ms to minimize.
[2023-03-22 21:35:56] [INFO ] Deduced a trap composed of 9 places in 484 ms of which 1 ms to minimize.
[2023-03-22 21:35:56] [INFO ] Deduced a trap composed of 11 places in 283 ms of which 1 ms to minimize.
[2023-03-22 21:35:57] [INFO ] Deduced a trap composed of 10 places in 413 ms of which 1 ms to minimize.
[2023-03-22 21:35:57] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 1 ms to minimize.
[2023-03-22 21:35:57] [INFO ] Deduced a trap composed of 11 places in 370 ms of which 1 ms to minimize.
[2023-03-22 21:35:58] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 1 ms to minimize.
[2023-03-22 21:35:58] [INFO ] Deduced a trap composed of 6 places in 426 ms of which 0 ms to minimize.
[2023-03-22 21:35:59] [INFO ] Deduced a trap composed of 8 places in 444 ms of which 0 ms to minimize.
[2023-03-22 21:35:59] [INFO ] Deduced a trap composed of 9 places in 271 ms of which 1 ms to minimize.
[2023-03-22 21:35:59] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 1 ms to minimize.
[2023-03-22 21:36:00] [INFO ] Deduced a trap composed of 8 places in 250 ms of which 1 ms to minimize.
[2023-03-22 21:36:00] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 1 ms to minimize.
[2023-03-22 21:36:00] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 1 ms to minimize.
[2023-03-22 21:36:01] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 1 ms to minimize.
[2023-03-22 21:36:01] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 1 ms to minimize.
[2023-03-22 21:36:02] [INFO ] Deduced a trap composed of 9 places in 433 ms of which 1 ms to minimize.
[2023-03-22 21:36:02] [INFO ] Deduced a trap composed of 15 places in 411 ms of which 0 ms to minimize.
[2023-03-22 21:36:02] [INFO ] Deduced a trap composed of 19 places in 293 ms of which 1 ms to minimize.
[2023-03-22 21:36:03] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 1 ms to minimize.
[2023-03-22 21:36:03] [INFO ] Deduced a trap composed of 10 places in 323 ms of which 1 ms to minimize.
[2023-03-22 21:36:03] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 1 ms to minimize.
[2023-03-22 21:36:04] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 0 ms to minimize.
[2023-03-22 21:36:04] [INFO ] Deduced a trap composed of 15 places in 236 ms of which 1 ms to minimize.
[2023-03-22 21:36:04] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 1 ms to minimize.
[2023-03-22 21:36:05] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 0 ms to minimize.
[2023-03-22 21:36:05] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 18200 ms
[2023-03-22 21:36:05] [INFO ] After 43239ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 1688 ms.
[2023-03-22 21:36:07] [INFO ] After 45705ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
[2023-03-22 21:36:07] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 18 ms.
[2023-03-22 21:36:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1651 places, 1401 transitions and 6321 arcs took 17 ms.
[2023-03-22 21:36:07] [INFO ] Flatten gal took : 185 ms
Total runtime 141924 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=ReachabilityCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: ShieldPPPs_PT_050B
(NrP: 1651 NrTr: 1401 NrArc: 6321)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.231sec
net check time: 0m 0.001sec
init dd package: 0m 2.978sec
before gc: list nodes free: 628747
after gc: idd nodes used:113710, unused:63886290; list nodes free:267900237
before gc: list nodes free: 178522
after gc: idd nodes used:175792, unused:63824208; list nodes free:269705235
before gc: list nodes free: 1989648
after gc: idd nodes used:239304, unused:63760696; list nodes free:279898005
before gc: list nodes free: 1166567
after gc: idd nodes used:291137, unused:63708863; list nodes free:281753260
before gc: list nodes free: 4223033
after gc: idd nodes used:343384, unused:63656616; list nodes free:281518182
before gc: list nodes free: 8291448
after gc: idd nodes used:378374, unused:63621626; list nodes free:281332071
before gc: list nodes free: 1569826
after gc: idd nodes used:532462, unused:63467538; list nodes free:284823053
before gc: list nodes free: 13479242
after gc: idd nodes used:707425, unused:63292575; list nodes free:283977694
before gc: list nodes free: 340672
after gc: idd nodes used:782729, unused:63217271; list nodes free:294111309
before gc: list nodes free: 7396480
after gc: idd nodes used:620216, unused:63379784; list nodes free:294922181
before gc: list nodes free: 10472790
after gc: idd nodes used:494994, unused:63505006; list nodes free:295497416
before gc: list nodes free: 14158651
after gc: idd nodes used:587785, unused:63412215; list nodes free:295040874
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6056092 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096496 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
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.010sec
62883 108920 129487 159530 186285 194725 252429 324878 313599 337360 337591 419818 519954 521603 651605 645543 522348 534853
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="ShieldPPPs-PT-050B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldPPPs-PT-050B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r394-oct2-167903718000510"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-050B.tgz
mv ShieldPPPs-PT-050B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;