fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r426-tajo-167905978500143
Last Updated
May 14, 2023

About the Execution of Marcie+red for ShieldRVs-PT-040B

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9924.615 3600000.00 3663743.00 780.40 FTF?T?FTT?FT?TFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978500143.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVs-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978500143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1012K
-rw-r--r-- 1 mcc users 8.5K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:22 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 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 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 498K 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 ShieldRVs-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679343012058

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=ShieldRVs-PT-040B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 20:10:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 20:10:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 20:10:14] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2023-03-20 20:10:14] [INFO ] Transformed 1603 places.
[2023-03-20 20:10:14] [INFO ] Transformed 1803 transitions.
[2023-03-20 20:10:14] [INFO ] Found NUPN structural information;
[2023-03-20 20:10:14] [INFO ] Parsed PT model containing 1603 places and 1803 transitions and 5760 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 638 ms. (steps per millisecond=15 ) properties (out of 16) seen :9
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1803 rows 1603 cols
[2023-03-20 20:10:15] [INFO ] Computed 161 place invariants in 32 ms
[2023-03-20 20:10:16] [INFO ] After 1121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 20:10:17] [INFO ] [Nat]Absence check using 161 positive place invariants in 140 ms returned sat
[2023-03-20 20:10:22] [INFO ] After 4367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 20:10:23] [INFO ] Deduced a trap composed of 34 places in 729 ms of which 9 ms to minimize.
[2023-03-20 20:10:24] [INFO ] Deduced a trap composed of 33 places in 713 ms of which 1 ms to minimize.
[2023-03-20 20:10:24] [INFO ] Deduced a trap composed of 25 places in 635 ms of which 2 ms to minimize.
[2023-03-20 20:10:25] [INFO ] Deduced a trap composed of 28 places in 531 ms of which 14 ms to minimize.
[2023-03-20 20:10:26] [INFO ] Deduced a trap composed of 33 places in 688 ms of which 2 ms to minimize.
[2023-03-20 20:10:27] [INFO ] Deduced a trap composed of 19 places in 695 ms of which 2 ms to minimize.
[2023-03-20 20:10:27] [INFO ] Deduced a trap composed of 42 places in 589 ms of which 14 ms to minimize.
[2023-03-20 20:10:28] [INFO ] Deduced a trap composed of 26 places in 871 ms of which 1 ms to minimize.
[2023-03-20 20:10:29] [INFO ] Deduced a trap composed of 46 places in 429 ms of which 1 ms to minimize.
[2023-03-20 20:10:29] [INFO ] Deduced a trap composed of 45 places in 365 ms of which 1 ms to minimize.
[2023-03-20 20:10:30] [INFO ] Deduced a trap composed of 53 places in 574 ms of which 1 ms to minimize.
[2023-03-20 20:10:30] [INFO ] Deduced a trap composed of 35 places in 485 ms of which 2 ms to minimize.
[2023-03-20 20:10:31] [INFO ] Deduced a trap composed of 30 places in 596 ms of which 2 ms to minimize.
[2023-03-20 20:10:32] [INFO ] Deduced a trap composed of 35 places in 488 ms of which 1 ms to minimize.
[2023-03-20 20:10:32] [INFO ] Deduced a trap composed of 35 places in 463 ms of which 0 ms to minimize.
[2023-03-20 20:10:33] [INFO ] Deduced a trap composed of 38 places in 477 ms of which 1 ms to minimize.
[2023-03-20 20:10:33] [INFO ] Deduced a trap composed of 34 places in 477 ms of which 1 ms to minimize.
[2023-03-20 20:10:34] [INFO ] Deduced a trap composed of 33 places in 563 ms of which 2 ms to minimize.
[2023-03-20 20:10:35] [INFO ] Deduced a trap composed of 22 places in 559 ms of which 2 ms to minimize.
[2023-03-20 20:10:35] [INFO ] Deduced a trap composed of 23 places in 648 ms of which 2 ms to minimize.
[2023-03-20 20:10:36] [INFO ] Deduced a trap composed of 28 places in 618 ms of which 1 ms to minimize.
[2023-03-20 20:10:37] [INFO ] Deduced a trap composed of 25 places in 499 ms of which 1 ms to minimize.
[2023-03-20 20:10:37] [INFO ] Deduced a trap composed of 20 places in 543 ms of which 1 ms to minimize.
[2023-03-20 20:10:38] [INFO ] Deduced a trap composed of 25 places in 523 ms of which 2 ms to minimize.
[2023-03-20 20:10:38] [INFO ] Deduced a trap composed of 23 places in 617 ms of which 2 ms to minimize.
[2023-03-20 20:10:39] [INFO ] Deduced a trap composed of 26 places in 628 ms of which 1 ms to minimize.
[2023-03-20 20:10:40] [INFO ] Deduced a trap composed of 21 places in 561 ms of which 1 ms to minimize.
[2023-03-20 20:10:41] [INFO ] Deduced a trap composed of 21 places in 567 ms of which 2 ms to minimize.
[2023-03-20 20:10:41] [INFO ] Deduced a trap composed of 35 places in 581 ms of which 2 ms to minimize.
[2023-03-20 20:10:42] [INFO ] Deduced a trap composed of 51 places in 571 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 20:10:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 20:10:42] [INFO ] After 25496ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 666 ms.
Support contains 170 out of 1603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1603/1603 places, 1803/1803 transitions.
Drop transitions removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 129 place count 1603 transition count 1674
Reduce places removed 129 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 133 rules applied. Total rules applied 262 place count 1474 transition count 1670
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 266 place count 1470 transition count 1670
Performed 190 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 190 Pre rules applied. Total rules applied 266 place count 1470 transition count 1480
Deduced a syphon composed of 190 places in 20 ms
Reduce places removed 190 places and 0 transitions.
Iterating global reduction 3 with 380 rules applied. Total rules applied 646 place count 1280 transition count 1480
Discarding 242 places :
Symmetric choice reduction at 3 with 242 rule applications. Total rules 888 place count 1038 transition count 1238
Iterating global reduction 3 with 242 rules applied. Total rules applied 1130 place count 1038 transition count 1238
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 1130 place count 1038 transition count 1167
Deduced a syphon composed of 71 places in 3 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 1272 place count 967 transition count 1167
Performed 247 Post agglomeration using F-continuation condition.Transition count delta: 247
Deduced a syphon composed of 247 places in 3 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 3 with 494 rules applied. Total rules applied 1766 place count 720 transition count 920
Partial Free-agglomeration rule applied 66 times.
Drop transitions removed 66 transitions
Iterating global reduction 3 with 66 rules applied. Total rules applied 1832 place count 720 transition count 920
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1833 place count 719 transition count 919
Applied a total of 1833 rules in 649 ms. Remains 719 /1603 variables (removed 884) and now considering 919/1803 (removed 884) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 650 ms. Remains : 719/1603 places, 919/1803 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 7) seen :2
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :1
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 919 rows 719 cols
[2023-03-20 20:10:44] [INFO ] Computed 161 place invariants in 7 ms
[2023-03-20 20:10:44] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 20:10:44] [INFO ] [Nat]Absence check using 161 positive place invariants in 29 ms returned sat
[2023-03-20 20:10:45] [INFO ] After 999ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 20:10:46] [INFO ] Deduced a trap composed of 14 places in 252 ms of which 1 ms to minimize.
[2023-03-20 20:10:46] [INFO ] Deduced a trap composed of 12 places in 283 ms of which 0 ms to minimize.
[2023-03-20 20:10:46] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 0 ms to minimize.
[2023-03-20 20:10:47] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 1 ms to minimize.
[2023-03-20 20:10:47] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 4 ms to minimize.
[2023-03-20 20:10:47] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 1 ms to minimize.
[2023-03-20 20:10:47] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 1 ms to minimize.
[2023-03-20 20:10:48] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 2 ms to minimize.
[2023-03-20 20:10:48] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2023-03-20 20:10:48] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 2 ms to minimize.
[2023-03-20 20:10:48] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 1 ms to minimize.
[2023-03-20 20:10:48] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2023-03-20 20:10:49] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-20 20:10:49] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2023-03-20 20:10:49] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2023-03-20 20:10:49] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 0 ms to minimize.
[2023-03-20 20:10:49] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2023-03-20 20:10:49] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3717 ms
[2023-03-20 20:10:50] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2023-03-20 20:10:50] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2023-03-20 20:10:50] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2023-03-20 20:10:50] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2023-03-20 20:10:50] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 0 ms to minimize.
[2023-03-20 20:10:50] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2023-03-20 20:10:50] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 0 ms to minimize.
[2023-03-20 20:10:51] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 0 ms to minimize.
[2023-03-20 20:10:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1293 ms
[2023-03-20 20:10:51] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 3 ms to minimize.
[2023-03-20 20:10:51] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 1 ms to minimize.
[2023-03-20 20:10:51] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 0 ms to minimize.
[2023-03-20 20:10:52] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2023-03-20 20:10:52] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 1 ms to minimize.
[2023-03-20 20:10:52] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2023-03-20 20:10:52] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2023-03-20 20:10:52] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 0 ms to minimize.
[2023-03-20 20:10:53] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 2 ms to minimize.
[2023-03-20 20:10:53] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 1 ms to minimize.
[2023-03-20 20:10:53] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 3 ms to minimize.
[2023-03-20 20:10:53] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 0 ms to minimize.
[2023-03-20 20:10:53] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 11 ms to minimize.
[2023-03-20 20:10:54] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 0 ms to minimize.
[2023-03-20 20:10:54] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2896 ms
[2023-03-20 20:10:54] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 1 ms to minimize.
[2023-03-20 20:10:54] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 1 ms to minimize.
[2023-03-20 20:10:55] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 1 ms to minimize.
[2023-03-20 20:10:55] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 1 ms to minimize.
[2023-03-20 20:10:55] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 1 ms to minimize.
[2023-03-20 20:10:55] [INFO ] Deduced a trap composed of 10 places in 245 ms of which 1 ms to minimize.
[2023-03-20 20:10:56] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2023-03-20 20:10:56] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2023-03-20 20:10:56] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2023-03-20 20:10:56] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 0 ms to minimize.
[2023-03-20 20:10:56] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2023-03-20 20:10:57] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 1 ms to minimize.
[2023-03-20 20:10:57] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 1 ms to minimize.
[2023-03-20 20:10:57] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 0 ms to minimize.
[2023-03-20 20:10:57] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 1 ms to minimize.
[2023-03-20 20:10:57] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 0 ms to minimize.
[2023-03-20 20:10:58] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2023-03-20 20:10:58] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 0 ms to minimize.
[2023-03-20 20:10:58] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4033 ms
[2023-03-20 20:10:58] [INFO ] After 13549ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 720 ms.
[2023-03-20 20:10:59] [INFO ] After 14554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 104 ms.
Support contains 151 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 919/919 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 719 transition count 916
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 716 transition count 916
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 716 transition count 912
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 712 transition count 912
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 711 transition count 911
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 711 transition count 911
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 36 place count 701 transition count 901
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 701 transition count 901
Applied a total of 40 rules in 209 ms. Remains 701 /719 variables (removed 18) and now considering 901/919 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 701/719 places, 901/919 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 117302 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 117302 steps, saw 33625 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 901 rows 701 cols
[2023-03-20 20:11:03] [INFO ] Computed 161 place invariants in 22 ms
[2023-03-20 20:11:03] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 20:11:03] [INFO ] [Nat]Absence check using 161 positive place invariants in 28 ms returned sat
[2023-03-20 20:11:04] [INFO ] After 814ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 20:11:04] [INFO ] Deduced a trap composed of 8 places in 283 ms of which 0 ms to minimize.
[2023-03-20 20:11:04] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 1 ms to minimize.
[2023-03-20 20:11:05] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 3 ms to minimize.
[2023-03-20 20:11:05] [INFO ] Deduced a trap composed of 9 places in 318 ms of which 1 ms to minimize.
[2023-03-20 20:11:05] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 0 ms to minimize.
[2023-03-20 20:11:06] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 1 ms to minimize.
[2023-03-20 20:11:06] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 1 ms to minimize.
[2023-03-20 20:11:06] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2023-03-20 20:11:06] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 1 ms to minimize.
[2023-03-20 20:11:09] [INFO ] Deduced a trap composed of 8 places in 2285 ms of which 1 ms to minimize.
[2023-03-20 20:11:09] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2023-03-20 20:11:09] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 1 ms to minimize.
[2023-03-20 20:11:09] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 1 ms to minimize.
[2023-03-20 20:11:09] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 1 ms to minimize.
[2023-03-20 20:11:10] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 0 ms to minimize.
[2023-03-20 20:11:15] [INFO ] Deduced a trap composed of 13 places in 5561 ms of which 26 ms to minimize.
[2023-03-20 20:11:15] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 0 ms to minimize.
[2023-03-20 20:11:16] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 1 ms to minimize.
[2023-03-20 20:11:16] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 1 ms to minimize.
[2023-03-20 20:11:16] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2023-03-20 20:11:16] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 0 ms to minimize.
[2023-03-20 20:11:16] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 12313 ms
[2023-03-20 20:11:16] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 1 ms to minimize.
[2023-03-20 20:11:17] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2023-03-20 20:11:17] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 0 ms to minimize.
[2023-03-20 20:11:17] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2023-03-20 20:11:17] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 1 ms to minimize.
[2023-03-20 20:11:17] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2023-03-20 20:11:17] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2023-03-20 20:11:18] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 1 ms to minimize.
[2023-03-20 20:11:18] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2023-03-20 20:11:18] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2023-03-20 20:11:18] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1762 ms
[2023-03-20 20:11:18] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 0 ms to minimize.
[2023-03-20 20:11:19] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 1 ms to minimize.
[2023-03-20 20:11:19] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 1 ms to minimize.
[2023-03-20 20:11:19] [INFO ] Deduced a trap composed of 10 places in 268 ms of which 1 ms to minimize.
[2023-03-20 20:11:20] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 1 ms to minimize.
[2023-03-20 20:11:20] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 0 ms to minimize.
[2023-03-20 20:11:20] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2023-03-20 20:11:20] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 1 ms to minimize.
[2023-03-20 20:11:20] [INFO ] Deduced a trap composed of 14 places in 274 ms of which 0 ms to minimize.
[2023-03-20 20:11:21] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 1 ms to minimize.
[2023-03-20 20:11:21] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 1 ms to minimize.
[2023-03-20 20:11:21] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 1 ms to minimize.
[2023-03-20 20:11:21] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 1 ms to minimize.
[2023-03-20 20:11:22] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 1 ms to minimize.
[2023-03-20 20:11:22] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 0 ms to minimize.
[2023-03-20 20:11:22] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 1 ms to minimize.
[2023-03-20 20:11:22] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2023-03-20 20:11:22] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 0 ms to minimize.
[2023-03-20 20:11:23] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 0 ms to minimize.
[2023-03-20 20:11:23] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4451 ms
[2023-03-20 20:11:23] [INFO ] Deduced a trap composed of 10 places in 261 ms of which 0 ms to minimize.
[2023-03-20 20:11:23] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 0 ms to minimize.
[2023-03-20 20:11:24] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 0 ms to minimize.
[2023-03-20 20:11:24] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 2 ms to minimize.
[2023-03-20 20:11:24] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 1 ms to minimize.
[2023-03-20 20:11:24] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 1 ms to minimize.
[2023-03-20 20:11:24] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
[2023-03-20 20:11:25] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 1 ms to minimize.
[2023-03-20 20:11:25] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 0 ms to minimize.
[2023-03-20 20:11:25] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 0 ms to minimize.
[2023-03-20 20:11:25] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 1 ms to minimize.
[2023-03-20 20:11:25] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 0 ms to minimize.
[2023-03-20 20:11:26] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 0 ms to minimize.
[2023-03-20 20:11:26] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 0 ms to minimize.
[2023-03-20 20:11:26] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 0 ms to minimize.
[2023-03-20 20:11:26] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 1 ms to minimize.
[2023-03-20 20:11:27] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 0 ms to minimize.
[2023-03-20 20:11:27] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 1 ms to minimize.
[2023-03-20 20:11:27] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 1 ms to minimize.
[2023-03-20 20:11:27] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
[2023-03-20 20:11:27] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 0 ms to minimize.
[2023-03-20 20:11:28] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2023-03-20 20:11:28] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 0 ms to minimize.
[2023-03-20 20:11:28] [INFO ] Trap strengthening (SAT) tested/added 23/23 trap constraints in 4943 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 20:11:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 20:11:28] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 184 ms.
Support contains 151 out of 701 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 701/701 places, 901/901 transitions.
Applied a total of 0 rules in 68 ms. Remains 701 /701 variables (removed 0) and now considering 901/901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 701/701 places, 901/901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 701/701 places, 901/901 transitions.
Applied a total of 0 rules in 69 ms. Remains 701 /701 variables (removed 0) and now considering 901/901 (removed 0) transitions.
[2023-03-20 20:11:28] [INFO ] Invariant cache hit.
[2023-03-20 20:11:29] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-20 20:11:29] [INFO ] Invariant cache hit.
[2023-03-20 20:11:29] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
[2023-03-20 20:11:30] [INFO ] Redundant transitions in 145 ms returned []
[2023-03-20 20:11:30] [INFO ] Invariant cache hit.
[2023-03-20 20:11:30] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2147 ms. Remains : 701/701 places, 901/901 transitions.
Applied a total of 0 rules in 17 ms. Remains 701 /701 variables (removed 0) and now considering 901/901 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-20 20:11:30] [INFO ] Invariant cache hit.
[2023-03-20 20:11:31] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 20:11:31] [INFO ] [Nat]Absence check using 161 positive place invariants in 28 ms returned sat
[2023-03-20 20:11:32] [INFO ] After 823ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 20:11:32] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
[2023-03-20 20:11:32] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 0 ms to minimize.
[2023-03-20 20:11:33] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 0 ms to minimize.
[2023-03-20 20:11:33] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 1 ms to minimize.
[2023-03-20 20:11:33] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 1 ms to minimize.
[2023-03-20 20:11:33] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 1 ms to minimize.
[2023-03-20 20:11:33] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 0 ms to minimize.
[2023-03-20 20:11:34] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 1 ms to minimize.
[2023-03-20 20:11:34] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 1 ms to minimize.
[2023-03-20 20:11:34] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 1 ms to minimize.
[2023-03-20 20:11:35] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 1 ms to minimize.
[2023-03-20 20:11:35] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2023-03-20 20:11:35] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 1 ms to minimize.
[2023-03-20 20:11:35] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2023-03-20 20:11:35] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 0 ms to minimize.
[2023-03-20 20:11:36] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 1 ms to minimize.
[2023-03-20 20:11:36] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 1 ms to minimize.
[2023-03-20 20:11:36] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 1 ms to minimize.
[2023-03-20 20:11:36] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 1 ms to minimize.
[2023-03-20 20:11:36] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2023-03-20 20:11:37] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2023-03-20 20:11:37] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 0 ms to minimize.
[2023-03-20 20:11:37] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 1 ms to minimize.
[2023-03-20 20:11:37] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 1 ms to minimize.
[2023-03-20 20:11:38] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 1 ms to minimize.
[2023-03-20 20:11:38] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 0 ms to minimize.
[2023-03-20 20:11:38] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 0 ms to minimize.
[2023-03-20 20:11:38] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 1 ms to minimize.
[2023-03-20 20:11:39] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 0 ms to minimize.
[2023-03-20 20:11:39] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2023-03-20 20:11:39] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 7020 ms
[2023-03-20 20:11:39] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 0 ms to minimize.
[2023-03-20 20:11:39] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2023-03-20 20:11:40] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 1 ms to minimize.
[2023-03-20 20:11:40] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2023-03-20 20:11:40] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 0 ms to minimize.
[2023-03-20 20:11:40] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2023-03-20 20:11:40] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 0 ms to minimize.
[2023-03-20 20:11:40] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1182 ms
[2023-03-20 20:11:41] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 1 ms to minimize.
[2023-03-20 20:11:41] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2023-03-20 20:11:41] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2023-03-20 20:11:41] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2023-03-20 20:11:41] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2023-03-20 20:11:42] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2023-03-20 20:11:42] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2023-03-20 20:11:42] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2023-03-20 20:11:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1415 ms
[2023-03-20 20:11:42] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 0 ms to minimize.
[2023-03-20 20:11:42] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 0 ms to minimize.
[2023-03-20 20:11:43] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2023-03-20 20:11:43] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 0 ms to minimize.
[2023-03-20 20:11:43] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 1 ms to minimize.
[2023-03-20 20:11:43] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 1 ms to minimize.
[2023-03-20 20:11:43] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 0 ms to minimize.
[2023-03-20 20:11:44] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2023-03-20 20:11:44] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 0 ms to minimize.
[2023-03-20 20:11:44] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 0 ms to minimize.
[2023-03-20 20:11:44] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2023-03-20 20:11:44] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 0 ms to minimize.
[2023-03-20 20:11:45] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2023-03-20 20:11:45] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 1 ms to minimize.
[2023-03-20 20:11:45] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 1 ms to minimize.
[2023-03-20 20:11:45] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2023-03-20 20:11:45] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2023-03-20 20:11:45] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
[2023-03-20 20:11:46] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2023-03-20 20:11:46] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2023-03-20 20:11:46] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3833 ms
[2023-03-20 20:11:46] [INFO ] After 15064ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 728 ms.
[2023-03-20 20:11:47] [INFO ] After 16023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-20 20:11:47] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-20 20:11:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 701 places, 901 transitions and 4078 arcs took 5 ms.
[2023-03-20 20:11:47] [INFO ] Flatten gal took : 107 ms
Total runtime 93341 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: ShieldRVs_PT_040B
(NrP: 701 NrTr: 901 NrArc: 4078)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.063sec

net check time: 0m 0.000sec

init dd package: 0m 3.172sec


before gc: list nodes free: 1146516

after gc: idd nodes used:115788, unused:63884212; list nodes free:263722359

before gc: list nodes free: 1050436

after gc: idd nodes used:212063, unused:63787937; list nodes free:280043648

before gc: list nodes free: 1376315

after gc: idd nodes used:254496, unused:63745504; list nodes free:284033228

before gc: list nodes free: 548351

after gc: idd nodes used:340365, unused:63659635; list nodes free:285725025

before gc: list nodes free: 1631067

after gc: idd nodes used:371810, unused:63628190; list nodes free:285595176

before gc: list nodes free: 2934755

after gc: idd nodes used:431123, unused:63568877; list nodes free:285363933

before gc: list nodes free: 4816009

after gc: idd nodes used:297690, unused:63702310; list nodes free:285936223

before gc: list nodes free: 3302075

after gc: idd nodes used:317871, unused:63682129; list nodes free:285849661

before gc: list nodes free: 3077210

after gc: idd nodes used:381735, unused:63618265; list nodes free:285563512

before gc: list nodes free: 1919152

after gc: idd nodes used:402416, unused:63597584; list nodes free:285463128

before gc: list nodes free: 1817640

after gc: idd nodes used:416320, unused:63583680; list nodes free:285401720

before gc: list nodes free: 760904

after gc: idd nodes used:413412, unused:63586588; list nodes free:285416941
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6227848 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16101664 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 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.003sec

81531 114819 169266 152059 165463 159263 179482 189173 121507 116567 97240 191936 263980 271887 357802 367712 368887 345478 227339 297690 313925 342413 388734 404071 413477 414399 397266

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="ShieldRVs-PT-040B"
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 ShieldRVs-PT-040B, 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 r426-tajo-167905978500143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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