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

About the Execution of Marcie+red for MultiCrashLeafsetExtension-PT-S24C07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6196.735 3600000.00 3676961.00 9820.70 FTFTT?T??FFFTTFF 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.r234-tall-167856420900846.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 MultiCrashLeafsetExtension-PT-S24C07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420900846
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 11K Feb 26 02:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 02:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 02:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 02:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 26 02:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 26 02:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 02:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:22 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 MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679619848205

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=MultiCrashLeafsetExtension-PT-S24C07
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 01:04:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 01:04:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 01:04:10] [INFO ] Load time of PNML (sax parser for PT used): 481 ms
[2023-03-24 01:04:10] [INFO ] Transformed 13822 places.
[2023-03-24 01:04:10] [INFO ] Transformed 20365 transitions.
[2023-03-24 01:04:10] [INFO ] Parsed PT model containing 13822 places and 20365 transitions and 77774 arcs in 623 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 139 resets, run finished after 778 ms. (steps per millisecond=12 ) properties (out of 16) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 11300 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 11300 steps, saw 5596 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-24 01:04:14] [INFO ] Flow matrix only has 19765 transitions (discarded 600 similar events)
// Phase 1: matrix 19765 rows 13822 cols
[2023-03-24 01:04:16] [INFO ] Computed 1083 place invariants in 1420 ms
[2023-03-24 01:04:20] [INFO ] [Real]Absence check using 68 positive place invariants in 63 ms returned sat
[2023-03-24 01:04:21] [INFO ] [Real]Absence check using 68 positive and 1015 generalized place invariants in 772 ms returned sat
[2023-03-24 01:04:21] [INFO ] After 5093ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:14
[2023-03-24 01:04:24] [INFO ] [Nat]Absence check using 68 positive place invariants in 58 ms returned sat
[2023-03-24 01:04:25] [INFO ] [Nat]Absence check using 68 positive and 1015 generalized place invariants in 727 ms returned sat
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
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-24 01:04:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 01:04:46] [INFO ] After 25066ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:14
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 76 out of 13822 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13822/13822 places, 20365/20365 transitions.
Graph (complete) has 45351 edges and 13822 vertex of which 13780 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.40 ms
Discarding 42 places :
Also discarding 0 output transitions
Drop transitions removed 3812 transitions
Trivial Post-agglo rules discarded 3812 transitions
Performed 3812 trivial Post agglomeration. Transition count delta: 3812
Iterating post reduction 0 with 3812 rules applied. Total rules applied 3813 place count 13780 transition count 16553
Reduce places removed 3812 places and 0 transitions.
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Iterating post reduction 1 with 3881 rules applied. Total rules applied 7694 place count 9968 transition count 16484
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 2 with 69 rules applied. Total rules applied 7763 place count 9899 transition count 16484
Performed 344 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 344 Pre rules applied. Total rules applied 7763 place count 9899 transition count 16140
Deduced a syphon composed of 344 places in 18 ms
Reduce places removed 344 places and 0 transitions.
Iterating global reduction 3 with 688 rules applied. Total rules applied 8451 place count 9555 transition count 16140
Discarding 3831 places :
Symmetric choice reduction at 3 with 3831 rule applications. Total rules 12282 place count 5724 transition count 12309
Iterating global reduction 3 with 3831 rules applied. Total rules applied 16113 place count 5724 transition count 12309
Discarding 526 places :
Symmetric choice reduction at 3 with 526 rule applications. Total rules 16639 place count 5198 transition count 10259
Iterating global reduction 3 with 526 rules applied. Total rules applied 17165 place count 5198 transition count 10259
Discarding 252 places :
Symmetric choice reduction at 3 with 252 rule applications. Total rules 17417 place count 4946 transition count 8495
Iterating global reduction 3 with 252 rules applied. Total rules applied 17669 place count 4946 transition count 8495
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 6 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 17717 place count 4922 transition count 8471
Free-agglomeration rule (complex) applied 357 times.
Iterating global reduction 3 with 357 rules applied. Total rules applied 18074 place count 4922 transition count 10778
Reduce places removed 357 places and 0 transitions.
Iterating post reduction 3 with 357 rules applied. Total rules applied 18431 place count 4565 transition count 10778
Partial Free-agglomeration rule applied 346 times.
Drop transitions removed 346 transitions
Iterating global reduction 4 with 346 rules applied. Total rules applied 18777 place count 4565 transition count 10778
Applied a total of 18777 rules in 5970 ms. Remains 4565 /13822 variables (removed 9257) and now considering 10778/20365 (removed 9587) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5972 ms. Remains : 4565/13822 places, 10778/20365 transitions.
Incomplete random walk after 10000 steps, including 220 resets, run finished after 542 ms. (steps per millisecond=18 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 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 28 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 22717 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{3=1}
Probabilistic random walk after 22717 steps, saw 10488 distinct states, run finished after 3004 ms. (steps per millisecond=7 ) properties seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C07-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
[2023-03-24 01:04:56] [INFO ] Flow matrix only has 9906 transitions (discarded 872 similar events)
// Phase 1: matrix 9906 rows 4565 cols
[2023-03-24 01:04:56] [INFO ] Computed 1041 place invariants in 260 ms
[2023-03-24 01:04:57] [INFO ] After 583ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-24 01:04:57] [INFO ] [Nat]Absence check using 49 positive place invariants in 80 ms returned sat
[2023-03-24 01:04:58] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 281 ms returned sat
[2023-03-24 01:05:05] [INFO ] After 7305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-24 01:05:05] [INFO ] State equation strengthened by 5830 read => feed constraints.
[2023-03-24 01:05:22] [INFO ] After 16473ms SMT Verify possible using 5830 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 01:05:22] [INFO ] After 16476ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-24 01:05:22] [INFO ] After 25062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 36 ms.
Support contains 74 out of 4565 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4565/4565 places, 10778/10778 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4565 transition count 10777
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4564 transition count 10777
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 4564 transition count 10777
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 4562 transition count 10775
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 4562 transition count 10775
Applied a total of 8 rules in 1730 ms. Remains 4562 /4565 variables (removed 3) and now considering 10775/10778 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1733 ms. Remains : 4562/4565 places, 10775/10778 transitions.
Incomplete random walk after 10000 steps, including 219 resets, run finished after 541 ms. (steps per millisecond=18 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 22143 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22143 steps, saw 10233 distinct states, run finished after 3002 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-24 01:05:27] [INFO ] Flow matrix only has 9903 transitions (discarded 872 similar events)
// Phase 1: matrix 9903 rows 4562 cols
[2023-03-24 01:05:28] [INFO ] Computed 1041 place invariants in 280 ms
[2023-03-24 01:05:28] [INFO ] After 515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-24 01:05:29] [INFO ] [Nat]Absence check using 49 positive place invariants in 71 ms returned sat
[2023-03-24 01:05:29] [INFO ] [Nat]Absence check using 49 positive and 992 generalized place invariants in 261 ms returned sat
[2023-03-24 01:05:37] [INFO ] After 7725ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-24 01:05:37] [INFO ] State equation strengthened by 5830 read => feed constraints.
[2023-03-24 01:05:52] [INFO ] After 14778ms SMT Verify possible using 5830 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-24 01:05:59] [INFO ] Deduced a trap composed of 428 places in 5999 ms of which 20 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-24 01:05:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 01:05:59] [INFO ] After 30435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 16 ms.
Support contains 74 out of 4562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4562/4562 places, 10775/10775 transitions.
Applied a total of 0 rules in 654 ms. Remains 4562 /4562 variables (removed 0) and now considering 10775/10775 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 654 ms. Remains : 4562/4562 places, 10775/10775 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4562/4562 places, 10775/10775 transitions.
Applied a total of 0 rules in 663 ms. Remains 4562 /4562 variables (removed 0) and now considering 10775/10775 (removed 0) transitions.
[2023-03-24 01:06:00] [INFO ] Flow matrix only has 9903 transitions (discarded 872 similar events)
[2023-03-24 01:06:00] [INFO ] Invariant cache hit.
[2023-03-24 01:06:06] [INFO ] Implicit Places using invariants in 5618 ms returned []
Implicit Place search using SMT only with invariants took 5619 ms to find 0 implicit places.
[2023-03-24 01:06:06] [INFO ] Flow matrix only has 9903 transitions (discarded 872 similar events)
[2023-03-24 01:06:06] [INFO ] Invariant cache hit.
[2023-03-24 01:06:12] [INFO ] Dead Transitions using invariants and state equation in 6404 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12701 ms. Remains : 4562/4562 places, 10775/10775 transitions.
Graph (trivial) has 3340 edges and 4562 vertex of which 24 / 4562 are part of one of the 1 SCC in 9 ms
Free SCC test removed 23 places
Drop transitions removed 589 transitions
Ensure Unique test removed 861 transitions
Reduce isomorphic transitions removed 1450 transitions.
Graph (complete) has 33471 edges and 4539 vertex of which 4517 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.4 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 383 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node10DetectsThatNode13CanReplaceNode12.Node13IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 222 rules applied. Total rules applied 224 place count 4131 transition count 9105
Ensure Unique test removed 1 places
Reduce places removed 219 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 205 transitions.
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 1 with 628 rules applied. Total rules applied 852 place count 3912 transition count 8696
Ensure Unique test removed 1 places
Reduce places removed 205 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 161 transitions
Reduce isomorphic transitions removed 193 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 2 with 557 rules applied. Total rules applied 1409 place count 3707 transition count 8344
Ensure Unique test removed 32 places
Reduce places removed 191 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 146 transitions
Reduce isomorphic transitions removed 148 transitions.
Drop transitions removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 3 with 484 rules applied. Total rules applied 1893 place count 3516 transition count 8051
Ensure Unique test removed 2 places
Reduce places removed 147 places and 0 transitions.
Drop transitions removed 23 transitions
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 135 transitions.
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 4 with 393 rules applied. Total rules applied 2286 place count 3369 transition count 7805
Ensure Unique test removed 23 places
Reduce places removed 134 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 5 with 332 rules applied. Total rules applied 2618 place count 3235 transition count 7607
Ensure Unique test removed 2 places
Reduce places removed 100 places and 0 transitions.
Drop transitions removed 15 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 87 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 6 with 257 rules applied. Total rules applied 2875 place count 3135 transition count 7450
Ensure Unique test removed 15 places
Reduce places removed 85 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 59 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 7 with 201 rules applied. Total rules applied 3076 place count 3050 transition count 7334
Ensure Unique test removed 2 places
Reduce places removed 59 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 8 with 143 rules applied. Total rules applied 3219 place count 2991 transition count 7250
Ensure Unique test removed 8 places
Reduce places removed 45 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 9 with 96 rules applied. Total rules applied 3315 place count 2946 transition count 7199
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 10 with 50 rules applied. Total rules applied 3365 place count 2920 transition count 7175
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 11 with 27 rules applied. Total rules applied 3392 place count 2908 transition count 7160
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 19 rules applied. Total rules applied 3411 place count 2893 transition count 7156
Performed 342 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 342 Pre rules applied. Total rules applied 3411 place count 2893 transition count 6814
Deduced a syphon composed of 342 places in 2 ms
Ensure Unique test removed 299 places
Reduce places removed 641 places and 0 transitions.
Iterating global reduction 13 with 983 rules applied. Total rules applied 4394 place count 2252 transition count 6814
Discarding 312 places :
Symmetric choice reduction at 13 with 312 rule applications. Total rules 4706 place count 1940 transition count 6502
Iterating global reduction 13 with 312 rules applied. Total rules applied 5018 place count 1940 transition count 6502
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 5018 place count 1940 transition count 6501
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 5020 place count 1939 transition count 6501
Discarding 99 places :
Symmetric choice reduction at 13 with 99 rule applications. Total rules 5119 place count 1840 transition count 5808
Iterating global reduction 13 with 99 rules applied. Total rules applied 5218 place count 1840 transition count 5808
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 13 with 96 rules applied. Total rules applied 5314 place count 1840 transition count 5712
Discarding 11 places :
Symmetric choice reduction at 14 with 11 rule applications. Total rules 5325 place count 1829 transition count 5701
Iterating global reduction 14 with 11 rules applied. Total rules applied 5336 place count 1829 transition count 5701
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 14 with 11 rules applied. Total rules applied 5347 place count 1829 transition count 5690
Performed 868 Post agglomeration using F-continuation condition.Transition count delta: 868
Deduced a syphon composed of 868 places in 1 ms
Reduce places removed 868 places and 0 transitions.
Iterating global reduction 15 with 1736 rules applied. Total rules applied 7083 place count 961 transition count 4822
Drop transitions removed 823 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 844 transitions.
Iterating post reduction 15 with 844 rules applied. Total rules applied 7927 place count 961 transition count 3978
Drop transitions removed 162 transitions
Redundant transition composition rules discarded 162 transitions
Iterating global reduction 16 with 162 rules applied. Total rules applied 8089 place count 961 transition count 3816
Ensure Unique test removed 144 places
Iterating post reduction 16 with 144 rules applied. Total rules applied 8233 place count 817 transition count 3816
Discarding 32 places :
Symmetric choice reduction at 17 with 32 rule applications. Total rules 8265 place count 785 transition count 3652
Iterating global reduction 17 with 32 rules applied. Total rules applied 8297 place count 785 transition count 3652
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 17 with 32 rules applied. Total rules applied 8329 place count 785 transition count 3620
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 8330 place count 785 transition count 3619
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 8331 place count 784 transition count 3619
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 19 with 10 rules applied. Total rules applied 8341 place count 784 transition count 3609
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 19 with 10 rules applied. Total rules applied 8351 place count 774 transition count 3609
Partial Free-agglomeration rule applied 1996 times.
Drop transitions removed 1996 transitions
Iterating global reduction 20 with 1996 rules applied. Total rules applied 10347 place count 774 transition count 3609
Discarding 11 places :
Symmetric choice reduction at 20 with 11 rule applications. Total rules 10358 place count 763 transition count 3532
Iterating global reduction 20 with 11 rules applied. Total rules applied 10369 place count 763 transition count 3532
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 20 with 11 rules applied. Total rules applied 10380 place count 763 transition count 3521
Partial Post-agglomeration rule applied 84 times.
Drop transitions removed 84 transitions
Iterating global reduction 21 with 84 rules applied. Total rules applied 10464 place count 763 transition count 3521
Applied a total of 10464 rules in 12097 ms. Remains 763 /4562 variables (removed 3799) and now considering 3521/10775 (removed 7254) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 3521 rows 763 cols
[2023-03-24 01:06:24] [INFO ] Computed 102 place invariants in 203 ms
[2023-03-24 01:06:24] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-24 01:06:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2023-03-24 01:06:25] [INFO ] [Nat]Absence check using 4 positive and 98 generalized place invariants in 17 ms returned sat
[2023-03-24 01:06:26] [INFO ] After 1048ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-24 01:06:26] [INFO ] After 1468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 281 ms.
[2023-03-24 01:06:26] [INFO ] After 1920ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-24 01:06:26] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-24 01:06:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4562 places, 10775 transitions and 64149 arcs took 59 ms.
[2023-03-24 01:06:27] [INFO ] Flatten gal took : 692 ms
Total runtime 138184 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: gen
(NrP: 4562 NrTr: 10775 NrArc: 64149)

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

net check time: 0m 0.010sec

init dd package: 0m 2.702sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393228 kB
MemFree: 9929268 kB
After kill :
MemTotal: 16393228 kB
MemFree: 16072444 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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.446sec

30202 53786 80492 125034 174317 224414 269257

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="MultiCrashLeafsetExtension-PT-S24C07"
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 MultiCrashLeafsetExtension-PT-S24C07, 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 r234-tall-167856420900846"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C07.tgz
mv MultiCrashLeafsetExtension-PT-S24C07 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;