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-167856420900838.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-S24C06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420900838
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 11K Feb 26 03:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 03:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 03:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 03:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 03:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 03:36 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 13M 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-S24C06-ReachabilityCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679616234194

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-S24C06
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 00:03:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 00:03:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 00:03:56] [INFO ] Load time of PNML (sax parser for PT used): 436 ms
[2023-03-24 00:03:56] [INFO ] Transformed 12464 places.
[2023-03-24 00:03:56] [INFO ] Transformed 18463 transitions.
[2023-03-24 00:03:56] [INFO ] Parsed PT model containing 12464 places and 18463 transitions and 71462 arcs in 564 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 161 resets, run finished after 660 ms. (steps per millisecond=15 ) properties (out of 16) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 3 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 3 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 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 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 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 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 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 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 12372 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{1=1, 8=1}
Probabilistic random walk after 12372 steps, saw 6057 distinct states, run finished after 3002 ms. (steps per millisecond=4 ) properties seen :2
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 13 properties.
[2023-03-24 00:04:00] [INFO ] Flow matrix only has 17863 transitions (discarded 600 similar events)
// Phase 1: matrix 17863 rows 12464 cols
[2023-03-24 00:04:01] [INFO ] Computed 1029 place invariants in 1188 ms
[2023-03-24 00:04:05] [INFO ] [Real]Absence check using 66 positive place invariants in 67 ms returned sat
[2023-03-24 00:04:06] [INFO ] [Real]Absence check using 66 positive and 963 generalized place invariants in 689 ms returned sat
[2023-03-24 00:04:06] [INFO ] After 4508ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:12
[2023-03-24 00:04:09] [INFO ] [Nat]Absence check using 66 positive place invariants in 48 ms returned sat
[2023-03-24 00:04:09] [INFO ] [Nat]Absence check using 66 positive and 963 generalized place invariants in 655 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 00:04:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 00:04:31] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:12
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26 out of 12464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12464/12464 places, 18463/18463 transitions.
Graph (complete) has 41533 edges and 12464 vertex of which 12424 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.42 ms
Discarding 40 places :
Also discarding 0 output transitions
Drop transitions removed 3583 transitions
Trivial Post-agglo rules discarded 3583 transitions
Performed 3583 trivial Post agglomeration. Transition count delta: 3583
Iterating post reduction 0 with 3583 rules applied. Total rules applied 3584 place count 12424 transition count 14880
Reduce places removed 3583 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 3590 rules applied. Total rules applied 7174 place count 8841 transition count 14873
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 7181 place count 8834 transition count 14873
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 300 Pre rules applied. Total rules applied 7181 place count 8834 transition count 14573
Deduced a syphon composed of 300 places in 20 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 3 with 600 rules applied. Total rules applied 7781 place count 8534 transition count 14573
Discarding 3283 places :
Symmetric choice reduction at 3 with 3283 rule applications. Total rules 11064 place count 5251 transition count 11290
Iterating global reduction 3 with 3283 rules applied. Total rules applied 14347 place count 5251 transition count 11290
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 14347 place count 5251 transition count 11286
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 14355 place count 5247 transition count 11286
Discarding 532 places :
Symmetric choice reduction at 3 with 532 rule applications. Total rules 14887 place count 4715 transition count 8094
Iterating global reduction 3 with 532 rules applied. Total rules applied 15419 place count 4715 transition count 8094
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 10 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 15467 place count 4691 transition count 8070
Free-agglomeration rule (complex) applied 348 times.
Iterating global reduction 3 with 348 rules applied. Total rules applied 15815 place count 4691 transition count 10382
Reduce places removed 348 places and 0 transitions.
Iterating post reduction 3 with 348 rules applied. Total rules applied 16163 place count 4343 transition count 10382
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 4 with 200 rules applied. Total rules applied 16363 place count 4343 transition count 10382
Applied a total of 16363 rules in 4628 ms. Remains 4343 /12464 variables (removed 8121) and now considering 10382/18463 (removed 8081) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4630 ms. Remains : 4343/12464 places, 10382/18463 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 2) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S24C06-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 00:04:36] [INFO ] Flow matrix only has 9501 transitions (discarded 881 similar events)
// Phase 1: matrix 9501 rows 4343 cols
[2023-03-24 00:04:36] [INFO ] Computed 989 place invariants in 277 ms
[2023-03-24 00:04:37] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 00:04:37] [INFO ] [Nat]Absence check using 49 positive place invariants in 72 ms returned sat
[2023-03-24 00:04:37] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 266 ms returned sat
[2023-03-24 00:04:42] [INFO ] After 4624ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 00:04:42] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2023-03-24 00:04:51] [INFO ] After 9410ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-24 00:04:51] [INFO ] After 14944ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 14 ms.
Support contains 24 out of 4343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4343/4343 places, 10382/10382 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 4343 transition count 10381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4342 transition count 10381
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 4342 transition count 10381
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 4341 transition count 10380
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 4341 transition count 10380
Applied a total of 5 rules in 1369 ms. Remains 4341 /4343 variables (removed 2) and now considering 10380/10382 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1369 ms. Remains : 4341/4343 places, 10380/10382 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 24567 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :{}
Probabilistic random walk after 24567 steps, saw 11216 distinct states, run finished after 3002 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 00:04:56] [INFO ] Flow matrix only has 9499 transitions (discarded 881 similar events)
// Phase 1: matrix 9499 rows 4341 cols
[2023-03-24 00:04:57] [INFO ] Computed 989 place invariants in 239 ms
[2023-03-24 00:04:57] [INFO ] After 371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 00:04:57] [INFO ] [Nat]Absence check using 49 positive place invariants in 70 ms returned sat
[2023-03-24 00:04:58] [INFO ] [Nat]Absence check using 49 positive and 940 generalized place invariants in 268 ms returned sat
[2023-03-24 00:05:03] [INFO ] After 5092ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 00:05:03] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2023-03-24 00:05:12] [INFO ] After 9501ms SMT Verify possible using 5602 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 00:05:18] [INFO ] Deduced a trap composed of 285 places in 4799 ms of which 14 ms to minimize.
[2023-03-24 00:05:24] [INFO ] Deduced a trap composed of 340 places in 4727 ms of which 5 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 00:05:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 00:05:24] [INFO ] After 26975ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 24 out of 4341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4341/4341 places, 10380/10380 transitions.
Applied a total of 0 rules in 557 ms. Remains 4341 /4341 variables (removed 0) and now considering 10380/10380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 558 ms. Remains : 4341/4341 places, 10380/10380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4341/4341 places, 10380/10380 transitions.
Applied a total of 0 rules in 573 ms. Remains 4341 /4341 variables (removed 0) and now considering 10380/10380 (removed 0) transitions.
[2023-03-24 00:05:25] [INFO ] Flow matrix only has 9499 transitions (discarded 881 similar events)
[2023-03-24 00:05:25] [INFO ] Invariant cache hit.
[2023-03-24 00:05:29] [INFO ] Implicit Places using invariants in 4228 ms returned []
Implicit Place search using SMT only with invariants took 4234 ms to find 0 implicit places.
[2023-03-24 00:05:29] [INFO ] Flow matrix only has 9499 transitions (discarded 881 similar events)
[2023-03-24 00:05:29] [INFO ] Invariant cache hit.
[2023-03-24 00:05:35] [INFO ] Dead Transitions using invariants and state equation in 5712 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10523 ms. Remains : 4341/4341 places, 10380/10380 transitions.
Graph (trivial) has 3295 edges and 4341 vertex of which 24 / 4341 are part of one of the 1 SCC in 9 ms
Free SCC test removed 23 places
Drop transitions removed 606 transitions
Ensure Unique test removed 837 transitions
Reduce isomorphic transitions removed 1443 transitions.
Graph (complete) has 32113 edges and 4318 vertex of which 4296 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.5 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.
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 206 rules applied. Total rules applied 208 place count 3912 transition count 8731
Ensure Unique test removed 1 places
Reduce places removed 205 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 184 transitions
Reduce isomorphic transitions removed 185 transitions.
Drop transitions removed 183 transitions
Trivial Post-agglo rules discarded 183 transitions
Performed 183 trivial Post agglomeration. Transition count delta: 183
Iterating post reduction 1 with 573 rules applied. Total rules applied 781 place count 3707 transition count 8363
Ensure Unique test removed 1 places
Reduce places removed 184 places and 0 transitions.
Drop transitions removed 31 transitions
Ensure Unique test removed 133 transitions
Reduce isomorphic transitions removed 164 transitions.
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 2 with 479 rules applied. Total rules applied 1260 place count 3523 transition count 8068
Ensure Unique test removed 31 places
Reduce places removed 162 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 112 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 3 with 384 rules applied. Total rules applied 1644 place count 3361 transition count 7846
Ensure Unique test removed 2 places
Reduce places removed 112 places and 0 transitions.
Drop transitions removed 26 transitions
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 110 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 4 with 305 rules applied. Total rules applied 1949 place count 3249 transition count 7653
Ensure Unique test removed 26 places
Reduce places removed 109 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 83 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 5 with 273 rules applied. Total rules applied 2222 place count 3140 transition count 7489
Ensure Unique test removed 2 places
Reduce places removed 83 places and 0 transitions.
Drop transitions removed 22 transitions
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 81 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 6 with 223 rules applied. Total rules applied 2445 place count 3057 transition count 7349
Ensure Unique test removed 22 places
Reduce places removed 81 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 197 rules applied. Total rules applied 2642 place count 2976 transition count 7233
Ensure Unique test removed 2 places
Reduce places removed 59 places and 0 transitions.
Drop transitions removed 18 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 57 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 8 with 155 rules applied. Total rules applied 2797 place count 2917 transition count 7137
Ensure Unique test removed 18 places
Reduce places removed 57 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 39 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 9 with 133 rules applied. Total rules applied 2930 place count 2860 transition count 7061
Ensure Unique test removed 2 places
Reduce places removed 39 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 37 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 10 with 99 rules applied. Total rules applied 3029 place count 2821 transition count 7001
Ensure Unique test removed 14 places
Reduce places removed 37 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 11 with 81 rules applied. Total rules applied 3110 place count 2784 transition count 6957
Ensure Unique test removed 2 places
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 12 with 56 rules applied. Total rules applied 3166 place count 2761 transition count 6924
Ensure Unique test removed 9 places
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 12 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 13 with 43 rules applied. Total rules applied 3209 place count 2740 transition count 6902
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 14 with 27 rules applied. Total rules applied 3236 place count 2728 transition count 6887
Ensure Unique test removed 5 places
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 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 15 with 18 rules applied. Total rules applied 3254 place count 2718 transition count 6879
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 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 16 with 9 rules applied. Total rules applied 3263 place count 2713 transition count 6875
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 17 with 10 rules applied. Total rules applied 3273 place count 2710 transition count 6868
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 9 rules applied. Total rules applied 3282 place count 2703 transition count 6866
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 19 with 300 Pre rules applied. Total rules applied 3282 place count 2703 transition count 6566
Deduced a syphon composed of 300 places in 4 ms
Ensure Unique test removed 285 places
Reduce places removed 585 places and 0 transitions.
Iterating global reduction 19 with 885 rules applied. Total rules applied 4167 place count 2118 transition count 6566
Discarding 297 places :
Symmetric choice reduction at 19 with 297 rule applications. Total rules 4464 place count 1821 transition count 6269
Iterating global reduction 19 with 297 rules applied. Total rules applied 4761 place count 1821 transition count 6269
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 19 with 1 Pre rules applied. Total rules applied 4761 place count 1821 transition count 6268
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 4763 place count 1820 transition count 6268
Discarding 317 places :
Symmetric choice reduction at 19 with 317 rule applications. Total rules 5080 place count 1503 transition count 4366
Iterating global reduction 19 with 317 rules applied. Total rules applied 5397 place count 1503 transition count 4366
Ensure Unique test removed 317 transitions
Reduce isomorphic transitions removed 317 transitions.
Iterating post reduction 19 with 317 rules applied. Total rules applied 5714 place count 1503 transition count 4049
Performed 955 Post agglomeration using F-continuation condition.Transition count delta: 955
Deduced a syphon composed of 955 places in 1 ms
Reduce places removed 955 places and 0 transitions.
Iterating global reduction 20 with 1910 rules applied. Total rules applied 7624 place count 548 transition count 3094
Drop transitions removed 916 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 930 transitions.
Iterating post reduction 20 with 930 rules applied. Total rules applied 8554 place count 548 transition count 2164
Drop transitions removed 102 transitions
Redundant transition composition rules discarded 102 transitions
Iterating global reduction 21 with 102 rules applied. Total rules applied 8656 place count 548 transition count 2062
Ensure Unique test removed 94 places
Iterating post reduction 21 with 94 rules applied. Total rules applied 8750 place count 454 transition count 2062
Discarding 74 places :
Symmetric choice reduction at 22 with 74 rule applications. Total rules 8824 place count 380 transition count 1618
Iterating global reduction 22 with 74 rules applied. Total rules applied 8898 place count 380 transition count 1618
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 22 with 74 rules applied. Total rules applied 8972 place count 380 transition count 1544
Free-agglomeration rule applied 1 times.
Iterating global reduction 23 with 1 rules applied. Total rules applied 8973 place count 380 transition count 1543
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 8974 place count 379 transition count 1543
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 24 with 11 rules applied. Total rules applied 8985 place count 379 transition count 1532
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 24 with 11 rules applied. Total rules applied 8996 place count 368 transition count 1532
Discarding 11 places :
Symmetric choice reduction at 25 with 11 rule applications. Total rules 9007 place count 357 transition count 1466
Iterating global reduction 25 with 11 rules applied. Total rules applied 9018 place count 357 transition count 1466
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 25 with 11 rules applied. Total rules applied 9029 place count 357 transition count 1455
Partial Free-agglomeration rule applied 558 times.
Drop transitions removed 558 transitions
Iterating global reduction 26 with 558 rules applied. Total rules applied 9587 place count 357 transition count 1455
Discarding 11 places :
Symmetric choice reduction at 26 with 11 rule applications. Total rules 9598 place count 346 transition count 1389
Iterating global reduction 26 with 11 rules applied. Total rules applied 9609 place count 346 transition count 1389
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 26 with 11 rules applied. Total rules applied 9620 place count 346 transition count 1378
Applied a total of 9620 rules in 10058 ms. Remains 346 /4341 variables (removed 3995) and now considering 1378/10380 (removed 9002) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1378 rows 346 cols
[2023-03-24 00:05:45] [INFO ] Computed 61 place invariants in 44 ms
[2023-03-24 00:05:45] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 00:05:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-24 00:05:45] [INFO ] [Nat]Absence check using 4 positive and 57 generalized place invariants in 8 ms returned sat
[2023-03-24 00:05:46] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 00:05:46] [INFO ] After 341ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-24 00:05:46] [INFO ] After 444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-24 00:05:46] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 47 ms.
[2023-03-24 00:05:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4341 places, 10380 transitions and 62077 arcs took 64 ms.
[2023-03-24 00:05:47] [INFO ] Flatten gal took : 696 ms
Total runtime 111605 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: 4341 NrTr: 10380 NrArc: 62077)

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

net check time: 0m 0.011sec

init dd package: 0m 2.679sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 9997060 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16073588 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.410sec

24314 37317 52976 67041 78633 92382 104679 116703 139458 154121 160917 175736 189873

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-S24C06"
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-S24C06, 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-167856420900838"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C06.tgz
mv MultiCrashLeafsetExtension-PT-S24C06 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 ;