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.r265-smll-167863540300646.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 ltsminxred
Input is Peterson-PT-7, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540300646
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.9M
-rw-r--r-- 1 mcc users 323K Feb 25 22:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Feb 25 22:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 139K Feb 25 22:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 629K Feb 25 22:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 141K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 411K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 318K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 197K Feb 25 23:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 794K Feb 25 23:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 608K Feb 25 23:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.7M Feb 25 23:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-00
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-01
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-02
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-03
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-04
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-05
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-06
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-07
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-08
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-09
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-10
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-11
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-12
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-13
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-14
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679174988068

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-7
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 21:29:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 21:29:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 21:29:52] [INFO ] Load time of PNML (sax parser for PT used): 406 ms
[2023-03-18 21:29:52] [INFO ] Transformed 1992 places.
[2023-03-18 21:29:52] [INFO ] Transformed 3096 transitions.
[2023-03-18 21:29:52] [INFO ] Found NUPN structural information;
[2023-03-18 21:29:52] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_2_0_5, IsEndLoop_0_3_6, IsEndLoop_0_2_7, EndTurn_4_2, EndTurn_4_1, EndTurn_7_0, EndTurn_6_0, EndTurn_5_0, IsEndLoop_7_6_7, IsEndLoop_6_6_7, IsEndLoop_5_6_7, BeginLoop_1_4_2, BeginLoop_0_4_2, BeginLoop_3_0_4, BeginLoop_3_6_3, BeginLoop_0_6_5, BeginLoop_3_6_5, BeginLoop_4_2_7, BeginLoop_7_1_7, BeginLoop_5_1_7, BeginLoop_6_1_7, BeginLoop_4_1_7, BeginLoop_7_0_7, BeginLoop_6_0_7, BeginLoop_5_0_7, TestAlone_2_4_0, TestAlone_2_5_0, TestAlone_3_6_1, TestAlone_3_0_2, TestAlone_1_5_5, TestAlone_0_5_5, TestAlone_3_5_6, TestAlone_2_5_6, TestIdentity_4_2_1, TestIdentity_4_3_1, TestIdentity_7_2_1, TestIdentity_5_2_1, TestIdentity_6_2_1, TestIdentity_7_6_0, TestIdentity_6_6_0, TestIdentity_5_6_0, TestIdentity_0_2_3, TestIdentity_1_2_3, TestIdentity_1_1_6, TestIdentity_0_2_6, TestIdentity_2_4_4, TestIdentity_1_4_4, TestIdentity_4_5_7, TestIdentity_6_4_7, TestIdentity_5_4_7, TestIdentity_7_4_7, TestIdentity_4_4_7, TestIdentity_6_3_7, TestIdentity_5_3_7, TestIdentity_7_3_7, CS_0, CS_2, AskForSection_2_5, AskForSection_0_5]
[2023-03-18 21:29:52] [INFO ] Parsed PT model containing 1992 places and 3096 transitions and 9584 arcs in 615 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 174 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-7-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 983 ms. (steps per millisecond=10 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1338 ms. (steps per millisecond=7 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 196947 steps, run timeout after 9001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 196947 steps, saw 126529 distinct states, run finished after 9004 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-18 21:30:05] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-18 21:30:05] [INFO ] Computed 31 place invariants in 63 ms
[2023-03-18 21:30:09] [INFO ] After 1872ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2023-03-18 21:30:10] [INFO ] [Nat]Absence check using 23 positive place invariants in 36 ms returned sat
[2023-03-18 21:30:10] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-18 21:30:13] [INFO ] After 2674ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :6
[2023-03-18 21:30:13] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:30:16] [INFO ] After 2485ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :5 sat :6
[2023-03-18 21:30:18] [INFO ] Deduced a trap composed of 17 places in 2172 ms of which 13 ms to minimize.
[2023-03-18 21:30:21] [INFO ] Deduced a trap composed of 30 places in 2677 ms of which 4 ms to minimize.
[2023-03-18 21:30:23] [INFO ] Deduced a trap composed of 45 places in 1855 ms of which 4 ms to minimize.
[2023-03-18 21:30:26] [INFO ] Deduced a trap composed of 45 places in 2027 ms of which 3 ms to minimize.
[2023-03-18 21:30:29] [INFO ] Deduced a trap composed of 45 places in 2791 ms of which 3 ms to minimize.
[2023-03-18 21:30:32] [INFO ] Deduced a trap composed of 45 places in 2773 ms of which 3 ms to minimize.
[2023-03-18 21:30:34] [INFO ] Deduced a trap composed of 45 places in 2306 ms of which 3 ms to minimize.
[2023-03-18 21:30:36] [INFO ] Deduced a trap composed of 2 places in 2298 ms of which 3 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-18 21:30:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:30:36] [INFO ] After 27363ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:10
FORMULA Peterson-PT-7-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-7-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-7-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-7-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-7-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 130 ms.
Support contains 71 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 799 transitions
Trivial Post-agglo rules discarded 799 transitions
Performed 799 trivial Post agglomeration. Transition count delta: 799
Iterating post reduction 0 with 799 rules applied. Total rules applied 799 place count 1992 transition count 2297
Reduce places removed 799 places and 0 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 1 with 830 rules applied. Total rules applied 1629 place count 1193 transition count 2266
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 1660 place count 1162 transition count 2266
Performed 415 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 415 Pre rules applied. Total rules applied 1660 place count 1162 transition count 1851
Deduced a syphon composed of 415 places in 5 ms
Reduce places removed 415 places and 0 transitions.
Iterating global reduction 3 with 830 rules applied. Total rules applied 2490 place count 747 transition count 1851
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 5 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 2594 place count 695 transition count 1799
Applied a total of 2594 rules in 648 ms. Remains 695 /1992 variables (removed 1297) and now considering 1799/3096 (removed 1297) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 650 ms. Remains : 695/1992 places, 1799/3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 245673 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 245673 steps, saw 46822 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-18 21:30:41] [INFO ] Flow matrix only has 1463 transitions (discarded 336 similar events)
// Phase 1: matrix 1463 rows 695 cols
[2023-03-18 21:30:41] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-18 21:30:41] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 21:30:42] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2023-03-18 21:30:42] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-18 21:30:43] [INFO ] After 1076ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-18 21:30:43] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:30:44] [INFO ] After 822ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-18 21:30:45] [INFO ] Deduced a trap composed of 35 places in 1005 ms of which 3 ms to minimize.
[2023-03-18 21:30:46] [INFO ] Deduced a trap composed of 59 places in 873 ms of which 2 ms to minimize.
[2023-03-18 21:30:47] [INFO ] Deduced a trap composed of 11 places in 827 ms of which 2 ms to minimize.
[2023-03-18 21:30:47] [INFO ] Deduced a trap composed of 50 places in 666 ms of which 1 ms to minimize.
[2023-03-18 21:30:48] [INFO ] Deduced a trap composed of 14 places in 667 ms of which 2 ms to minimize.
[2023-03-18 21:30:49] [INFO ] Deduced a trap composed of 59 places in 898 ms of which 1 ms to minimize.
[2023-03-18 21:30:50] [INFO ] Deduced a trap composed of 26 places in 837 ms of which 1 ms to minimize.
[2023-03-18 21:30:51] [INFO ] Deduced a trap composed of 22 places in 820 ms of which 1 ms to minimize.
[2023-03-18 21:30:52] [INFO ] Deduced a trap composed of 24 places in 755 ms of which 1 ms to minimize.
[2023-03-18 21:30:53] [INFO ] Deduced a trap composed of 22 places in 798 ms of which 1 ms to minimize.
[2023-03-18 21:30:54] [INFO ] Deduced a trap composed of 42 places in 885 ms of which 2 ms to minimize.
[2023-03-18 21:30:54] [INFO ] Deduced a trap composed of 26 places in 866 ms of which 1 ms to minimize.
[2023-03-18 21:30:55] [INFO ] Deduced a trap composed of 12 places in 836 ms of which 1 ms to minimize.
[2023-03-18 21:30:56] [INFO ] Deduced a trap composed of 40 places in 714 ms of which 1 ms to minimize.
[2023-03-18 21:30:57] [INFO ] Deduced a trap composed of 36 places in 770 ms of which 2 ms to minimize.
[2023-03-18 21:30:58] [INFO ] Deduced a trap composed of 36 places in 634 ms of which 1 ms to minimize.
[2023-03-18 21:30:58] [INFO ] Deduced a trap composed of 30 places in 570 ms of which 2 ms to minimize.
[2023-03-18 21:30:59] [INFO ] Deduced a trap composed of 56 places in 810 ms of which 1 ms to minimize.
[2023-03-18 21:31:00] [INFO ] Deduced a trap composed of 63 places in 727 ms of which 2 ms to minimize.
[2023-03-18 21:31:01] [INFO ] Deduced a trap composed of 36 places in 674 ms of which 3 ms to minimize.
[2023-03-18 21:31:02] [INFO ] Deduced a trap composed of 50 places in 746 ms of which 1 ms to minimize.
[2023-03-18 21:31:02] [INFO ] Deduced a trap composed of 22 places in 704 ms of which 1 ms to minimize.
[2023-03-18 21:31:03] [INFO ] Deduced a trap composed of 27 places in 810 ms of which 1 ms to minimize.
[2023-03-18 21:31:04] [INFO ] Deduced a trap composed of 58 places in 760 ms of which 2 ms to minimize.
[2023-03-18 21:31:05] [INFO ] Deduced a trap composed of 35 places in 651 ms of which 1 ms to minimize.
[2023-03-18 21:31:06] [INFO ] Deduced a trap composed of 66 places in 705 ms of which 1 ms to minimize.
[2023-03-18 21:31:07] [INFO ] Deduced a trap composed of 58 places in 715 ms of which 10 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-18 21:31:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:31:07] [INFO ] After 25400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 74 ms.
Support contains 71 out of 695 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 695/695 places, 1799/1799 transitions.
Applied a total of 0 rules in 121 ms. Remains 695 /695 variables (removed 0) and now considering 1799/1799 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 695/695 places, 1799/1799 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 695/695 places, 1799/1799 transitions.
Applied a total of 0 rules in 109 ms. Remains 695 /695 variables (removed 0) and now considering 1799/1799 (removed 0) transitions.
[2023-03-18 21:31:07] [INFO ] Flow matrix only has 1463 transitions (discarded 336 similar events)
[2023-03-18 21:31:07] [INFO ] Invariant cache hit.
[2023-03-18 21:31:08] [INFO ] Implicit Places using invariants in 1006 ms returned [679, 680, 681, 682, 683, 692, 693, 694]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1013 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 687/695 places, 1799/1799 transitions.
Applied a total of 0 rules in 62 ms. Remains 687 /687 variables (removed 0) and now considering 1799/1799 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1185 ms. Remains : 687/695 places, 1799/1799 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 536 ms. (steps per millisecond=18 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 321795 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 321795 steps, saw 55470 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-18 21:31:12] [INFO ] Flow matrix only has 1463 transitions (discarded 336 similar events)
// Phase 1: matrix 1463 rows 687 cols
[2023-03-18 21:31:12] [INFO ] Computed 23 place invariants in 6 ms
[2023-03-18 21:31:12] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 21:31:12] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2023-03-18 21:31:14] [INFO ] After 1082ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-18 21:31:14] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:31:15] [INFO ] After 817ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-18 21:31:15] [INFO ] Deduced a trap composed of 27 places in 788 ms of which 1 ms to minimize.
[2023-03-18 21:31:16] [INFO ] Deduced a trap composed of 30 places in 794 ms of which 1 ms to minimize.
[2023-03-18 21:31:17] [INFO ] Deduced a trap composed of 29 places in 797 ms of which 1 ms to minimize.
[2023-03-18 21:31:18] [INFO ] Deduced a trap composed of 22 places in 799 ms of which 1 ms to minimize.
[2023-03-18 21:31:19] [INFO ] Deduced a trap composed of 12 places in 783 ms of which 2 ms to minimize.
[2023-03-18 21:31:20] [INFO ] Deduced a trap composed of 41 places in 858 ms of which 2 ms to minimize.
[2023-03-18 21:31:21] [INFO ] Deduced a trap composed of 13 places in 835 ms of which 1 ms to minimize.
[2023-03-18 21:31:22] [INFO ] Deduced a trap composed of 16 places in 824 ms of which 1 ms to minimize.
[2023-03-18 21:31:22] [INFO ] Deduced a trap composed of 13 places in 770 ms of which 2 ms to minimize.
[2023-03-18 21:31:23] [INFO ] Deduced a trap composed of 11 places in 944 ms of which 1 ms to minimize.
[2023-03-18 21:31:24] [INFO ] Deduced a trap composed of 49 places in 836 ms of which 1 ms to minimize.
[2023-03-18 21:31:25] [INFO ] Deduced a trap composed of 55 places in 742 ms of which 2 ms to minimize.
[2023-03-18 21:31:26] [INFO ] Deduced a trap composed of 36 places in 869 ms of which 1 ms to minimize.
[2023-03-18 21:31:27] [INFO ] Deduced a trap composed of 33 places in 823 ms of which 1 ms to minimize.
[2023-03-18 21:31:28] [INFO ] Deduced a trap composed of 27 places in 837 ms of which 2 ms to minimize.
[2023-03-18 21:31:29] [INFO ] Deduced a trap composed of 60 places in 839 ms of which 2 ms to minimize.
[2023-03-18 21:31:30] [INFO ] Deduced a trap composed of 54 places in 838 ms of which 2 ms to minimize.
[2023-03-18 21:31:31] [INFO ] Deduced a trap composed of 26 places in 827 ms of which 1 ms to minimize.
[2023-03-18 21:31:32] [INFO ] Deduced a trap composed of 11 places in 866 ms of which 1 ms to minimize.
[2023-03-18 21:31:33] [INFO ] Deduced a trap composed of 22 places in 868 ms of which 2 ms to minimize.
[2023-03-18 21:31:34] [INFO ] Deduced a trap composed of 22 places in 830 ms of which 1 ms to minimize.
[2023-03-18 21:31:34] [INFO ] Deduced a trap composed of 38 places in 795 ms of which 4 ms to minimize.
[2023-03-18 21:31:35] [INFO ] Deduced a trap composed of 43 places in 749 ms of which 1 ms to minimize.
[2023-03-18 21:31:36] [INFO ] Deduced a trap composed of 11 places in 568 ms of which 1 ms to minimize.
[2023-03-18 21:31:37] [INFO ] Deduced a trap composed of 34 places in 734 ms of which 2 ms to minimize.
[2023-03-18 21:31:38] [INFO ] Deduced a trap composed of 68 places in 880 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:31:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:31:38] [INFO ] After 25463ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 68 ms.
Support contains 71 out of 687 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 687/687 places, 1799/1799 transitions.
Applied a total of 0 rules in 56 ms. Remains 687 /687 variables (removed 0) and now considering 1799/1799 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 687/687 places, 1799/1799 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 687/687 places, 1799/1799 transitions.
Applied a total of 0 rules in 59 ms. Remains 687 /687 variables (removed 0) and now considering 1799/1799 (removed 0) transitions.
[2023-03-18 21:31:38] [INFO ] Flow matrix only has 1463 transitions (discarded 336 similar events)
[2023-03-18 21:31:38] [INFO ] Invariant cache hit.
[2023-03-18 21:31:39] [INFO ] Implicit Places using invariants in 893 ms returned []
[2023-03-18 21:31:39] [INFO ] Flow matrix only has 1463 transitions (discarded 336 similar events)
[2023-03-18 21:31:39] [INFO ] Invariant cache hit.
[2023-03-18 21:31:40] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:31:45] [INFO ] Implicit Places using invariants and state equation in 5924 ms returned []
Implicit Place search using SMT with State Equation took 6820 ms to find 0 implicit places.
[2023-03-18 21:31:45] [INFO ] Redundant transitions in 176 ms returned []
[2023-03-18 21:31:45] [INFO ] Flow matrix only has 1463 transitions (discarded 336 similar events)
[2023-03-18 21:31:45] [INFO ] Invariant cache hit.
[2023-03-18 21:31:46] [INFO ] Dead Transitions using invariants and state equation in 1644 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8712 ms. Remains : 687/687 places, 1799/1799 transitions.
Graph (trivial) has 1176 edges and 687 vertex of which 270 / 687 are part of one of the 49 SCC in 6 ms
Free SCC test removed 221 places
Drop transitions removed 442 transitions
Ensure Unique test removed 348 transitions
Reduce isomorphic transitions removed 790 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 1 place count 466 transition count 997
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 25 place count 454 transition count 997
Performed 135 Post agglomeration using F-continuation condition with reduction of 74 identical transitions.
Deduced a syphon composed of 135 places in 1 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 0 with 270 rules applied. Total rules applied 295 place count 319 transition count 788
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 314 place count 319 transition count 769
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -225
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 1 with 86 rules applied. Total rules applied 400 place count 272 transition count 994
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Graph (trivial) has 126 edges and 272 vertex of which 36 / 272 are part of one of the 4 SCC in 0 ms
Free SCC test removed 32 places
Iterating post reduction 1 with 32 rules applied. Total rules applied 432 place count 240 transition count 963
Drop transitions removed 36 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 472 place count 240 transition count 923
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 480 place count 236 transition count 919
Drop transitions removed 164 transitions
Redundant transition composition rules discarded 164 transitions
Iterating global reduction 3 with 164 rules applied. Total rules applied 644 place count 236 transition count 755
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 9 rules applied. Total rules applied 653 place count 236 transition count 746
Reduce places removed 9 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 12 rules applied. Total rules applied 665 place count 227 transition count 743
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 668 place count 224 transition count 743
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 668 place count 224 transition count 741
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 672 place count 222 transition count 741
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 676 place count 222 transition count 737
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 677 place count 222 transition count 736
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 7 with 4 rules applied. Total rules applied 681 place count 221 transition count 733
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 684 place count 218 transition count 733
Free-agglomeration rule applied 18 times.
Iterating global reduction 9 with 18 rules applied. Total rules applied 702 place count 218 transition count 715
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 720 place count 200 transition count 715
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 10 with 18 rules applied. Total rules applied 738 place count 200 transition count 715
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 10 with 10 rules applied. Total rules applied 748 place count 200 transition count 705
Applied a total of 748 rules in 246 ms. Remains 200 /687 variables (removed 487) and now considering 705/1799 (removed 1094) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 705 rows 200 cols
[2023-03-18 21:31:47] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-18 21:31:47] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 21:31:47] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-18 21:31:47] [INFO ] After 377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-18 21:31:48] [INFO ] After 642ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 215 ms.
[2023-03-18 21:31:48] [INFO ] After 1007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-18 21:31:48] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-18 21:31:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 687 places, 1799 transitions and 6974 arcs took 20 ms.
[2023-03-18 21:31:49] [INFO ] Flatten gal took : 376 ms
Total runtime 117065 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/701/inv_0_ --invariant=/tmp/701/inv_1_ --invariant=/tmp/701/inv_2_ --invariant=/tmp/701/inv_3_ --invariant=/tmp/701/inv_4_ --invariant=/tmp/701/inv_5_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14476512 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16087928 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
mcc2023

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="Peterson-PT-7"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Peterson-PT-7, 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 r265-smll-167863540300646"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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