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.r169-tall-167838855800422.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 FamilyReunion-PT-L00100M0010C005P005G002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855800422
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 42M
-rw-r--r-- 1 mcc users 290K Feb 26 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.8M Feb 26 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Feb 26 12:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Feb 26 12:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 170K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 700K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 327K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 869K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.3M Feb 26 15:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.3M Feb 26 15:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Feb 26 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.8M Feb 26 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 27K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 17M 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 FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-00
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-01
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-02
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-03
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-04
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-05
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-06
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-07
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-08
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-09
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-10
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-11
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-12
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-13
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-14
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678542284726

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=FamilyReunion-PT-L00100M0010C005P005G002
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 13:44:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 13:44:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 13:44:47] [INFO ] Load time of PNML (sax parser for PT used): 776 ms
[2023-03-11 13:44:47] [INFO ] Transformed 40605 places.
[2023-03-11 13:44:47] [INFO ] Transformed 36871 transitions.
[2023-03-11 13:44:47] [INFO ] Parsed PT model containing 40605 places and 36871 transitions and 112728 arcs in 1048 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18066 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 31 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1804 ms. (steps per millisecond=5 ) properties (out of 16) seen :4
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3160 ms. (steps per millisecond=3 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2704 ms. (steps per millisecond=3 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1428 ms. (steps per millisecond=7 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3180 ms. (steps per millisecond=3 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 675 ms. (steps per millisecond=14 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) 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 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 36871 rows 40574 cols
[2023-03-11 13:45:25] [INFO ] Computed 8805 place invariants in 5317 ms
[2023-03-11 13:45:38] [INFO ] After 13207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-11 13:45:51] [INFO ] [Nat]Absence check using 300 positive place invariants in 1034 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2347)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:618)
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-11 13:46:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 13:46:03] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 35730 out of 40574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40574/40574 places, 36871/36871 transitions.
Graph (complete) has 65258 edges and 40574 vertex of which 40568 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.78 ms
Discarding 6 places :
Also discarding 0 output transitions
Discarding 1110 places :
Implicit places reduction removed 1110 places
Iterating post reduction 0 with 1110 rules applied. Total rules applied 1111 place count 39458 transition count 36871
Discarding 1511 places :
Symmetric choice reduction at 1 with 1511 rule applications. Total rules 2622 place count 37947 transition count 35360
Iterating global reduction 1 with 1511 rules applied. Total rules applied 4133 place count 37947 transition count 35360
Applied a total of 4133 rules in 1838 ms. Remains 37947 /40574 variables (removed 2627) and now considering 35360/36871 (removed 1511) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1844 ms. Remains : 37947/40574 places, 35360/36871 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1610 ms. (steps per millisecond=6 ) properties (out of 12) seen :1
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3221 ms. (steps per millisecond=3 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2699 ms. (steps per millisecond=3 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1432 ms. (steps per millisecond=6 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3193 ms. (steps per millisecond=3 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 650 ms. (steps per millisecond=15 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 282766 steps, run timeout after 39008 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 282766 steps, saw 280000 distinct states, run finished after 39010 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 35360 rows 37947 cols
[2023-03-11 13:47:01] [INFO ] Computed 7689 place invariants in 3688 ms
[2023-03-11 13:47:12] [INFO ] After 11444ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-11 13:47:24] [INFO ] [Nat]Absence check using 297 positive place invariants in 638 ms returned sat
[2023-03-11 13:47:34] [INFO ] [Nat]Absence check using 297 positive and 7392 generalized place invariants in 9456 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
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-11 13:47:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 13:47:37] [INFO ] After 25129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 35723 out of 37947 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37947/37947 places, 35360/35360 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 37946 transition count 35360
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 37943 transition count 35357
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 37943 transition count 35357
Applied a total of 7 rules in 747 ms. Remains 37943 /37947 variables (removed 4) and now considering 35357/35360 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 747 ms. Remains : 37943/37947 places, 35357/35360 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1754 ms. (steps per millisecond=5 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3192 ms. (steps per millisecond=3 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2744 ms. (steps per millisecond=3 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1455 ms. (steps per millisecond=6 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3235 ms. (steps per millisecond=3 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 671 ms. (steps per millisecond=14 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 314978 steps, run timeout after 39007 ms. (steps per millisecond=8 ) properties seen :{1=1, 3=1}
Probabilistic random walk after 314978 steps, saw 311890 distinct states, run finished after 39007 ms. (steps per millisecond=8 ) properties seen :2
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 9 properties.
// Phase 1: matrix 35357 rows 37943 cols
[2023-03-11 13:48:35] [INFO ] Computed 7688 place invariants in 3876 ms
[2023-03-11 13:48:45] [INFO ] After 10157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 13:48:55] [INFO ] [Nat]Absence check using 296 positive place invariants in 647 ms returned sat
[2023-03-11 13:49:05] [INFO ] [Nat]Absence check using 296 positive and 7392 generalized place invariants in 9399 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
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-11 13:49:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 13:49:10] [INFO ] After 25117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26846 out of 37943 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37943/37943 places, 35357/35357 transitions.
Graph (complete) has 61516 edges and 37943 vertex of which 37836 are kept as prefixes of interest. Removing 107 places using SCC suffix rule.23 ms
Discarding 107 places :
Also discarding 0 output transitions
Discarding 1110 places :
Implicit places reduction removed 1110 places
Drop transitions removed 602 transitions
Trivial Post-agglo rules discarded 602 transitions
Performed 602 trivial Post agglomeration. Transition count delta: 602
Iterating post reduction 0 with 1712 rules applied. Total rules applied 1713 place count 36726 transition count 34755
Reduce places removed 602 places and 0 transitions.
Performed 1108 Post agglomeration using F-continuation condition.Transition count delta: 1108
Iterating post reduction 1 with 1710 rules applied. Total rules applied 3423 place count 36124 transition count 33647
Reduce places removed 1108 places and 0 transitions.
Iterating post reduction 2 with 1108 rules applied. Total rules applied 4531 place count 35016 transition count 33647
Performed 604 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 604 Pre rules applied. Total rules applied 4531 place count 35016 transition count 33043
Deduced a syphon composed of 604 places in 44 ms
Reduce places removed 604 places and 0 transitions.
Iterating global reduction 3 with 1208 rules applied. Total rules applied 5739 place count 34412 transition count 33043
Discarding 603 places :
Implicit places reduction removed 603 places
Iterating post reduction 3 with 603 rules applied. Total rules applied 6342 place count 33809 transition count 33043
Discarding 705 places :
Symmetric choice reduction at 4 with 705 rule applications. Total rules 7047 place count 33104 transition count 32338
Iterating global reduction 4 with 705 rules applied. Total rules applied 7752 place count 33104 transition count 32338
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 100 Pre rules applied. Total rules applied 7752 place count 33104 transition count 32238
Deduced a syphon composed of 100 places in 37 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 4 with 200 rules applied. Total rules applied 7952 place count 33004 transition count 32238
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 38 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 4 with 200 rules applied. Total rules applied 8152 place count 32904 transition count 32138
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 8157 place count 32904 transition count 32133
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 8162 place count 32899 transition count 32133
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 8163 place count 32899 transition count 32133
Applied a total of 8163 rules in 9459 ms. Remains 32899 /37943 variables (removed 5044) and now considering 32133/35357 (removed 3224) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9459 ms. Remains : 32899/37943 places, 32133/35357 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1060 ms. (steps per millisecond=9 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3214 ms. (steps per millisecond=3 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1454 ms. (steps per millisecond=6 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 662 ms. (steps per millisecond=15 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) 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 9) seen :0
Interrupted probabilistic random walk after 243784 steps, run timeout after 18001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 243784 steps, saw 241401 distinct states, run finished after 18002 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 32133 rows 32899 cols
[2023-03-11 13:49:47] [INFO ] Computed 5873 place invariants in 2413 ms
[2023-03-11 13:49:55] [INFO ] After 8493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 13:50:04] [INFO ] [Nat]Absence check using 300 positive place invariants in 640 ms returned sat
[2023-03-11 13:50:10] [INFO ] [Nat]Absence check using 300 positive and 5573 generalized place invariants in 5978 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
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-11 13:50:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 13:50:20] [INFO ] After 25114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26846 out of 32899 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32899/32899 places, 32133/32133 transitions.
Applied a total of 0 rules in 1332 ms. Remains 32899 /32899 variables (removed 0) and now considering 32133/32133 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1332 ms. Remains : 32899/32899 places, 32133/32133 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32899/32899 places, 32133/32133 transitions.
Applied a total of 0 rules in 1257 ms. Remains 32899 /32899 variables (removed 0) and now considering 32133/32133 (removed 0) transitions.
[2023-03-11 13:50:23] [INFO ] Invariant cache hit.
[2023-03-11 13:50:26] [INFO ] Implicit Places using invariants in 2857 ms returned []
Implicit Place search using SMT only with invariants took 2858 ms to find 0 implicit places.
[2023-03-11 13:50:26] [INFO ] Invariant cache hit.
[2023-03-11 13:50:29] [INFO ] Dead Transitions using invariants and state equation in 2735 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6861 ms. Remains : 32899/32899 places, 32133/32133 transitions.
Applied a total of 0 rules in 1261 ms. Remains 32899 /32899 variables (removed 0) and now considering 32133/32133 (removed 0) transitions.
Running SMT prover for 9 properties.
[2023-03-11 13:50:30] [INFO ] Invariant cache hit.
[2023-03-11 13:50:38] [INFO ] After 8469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 13:50:47] [INFO ] [Nat]Absence check using 300 positive place invariants in 661 ms returned sat
[2023-03-11 13:50:53] [INFO ] [Nat]Absence check using 300 positive and 5573 generalized place invariants in 6171 ms returned sat
[2023-03-11 13:53:43] [INFO ] After 147389ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-11 13:54:08] [INFO ] After 172915ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 6926 ms.
[2023-03-11 13:54:15] [INFO ] After 216618ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
[2023-03-11 13:54:15] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 19 ms.
[2023-03-11 13:54:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32899 places, 32133 transitions and 88103 arcs took 119 ms.
[2023-03-11 13:54:18] [INFO ] Flatten gal took : 1479 ms
Total runtime 571815 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/579/inv_0_ --invariant=/tmp/579/inv_1_ --invariant=/tmp/579/inv_2_ --invariant=/tmp/579/inv_3_ --invariant=/tmp/579/inv_4_ --invariant=/tmp/579/inv_5_ --invariant=/tmp/579/inv_6_ --invariant=/tmp/579/inv_7_ --inv-par
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-00
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-02
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-05
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-10
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-12
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-13
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-14
Could not compute solution for formula : FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-15

BK_STOP 1678544322572

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/579/inv_0_
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-02
rfs formula type EF
rfs formula formula --invariant=/tmp/579/inv_1_
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/579/inv_2_
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/579/inv_3_
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-12
rfs formula type EF
rfs formula formula --invariant=/tmp/579/inv_4_
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/579/inv_5_
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/579/inv_6_
rfs formula name FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/579/inv_7_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 32899 places, 32133 transitions and 88103 arcs
pnml2lts-sym: Petri net FamilyReunion_PT_L00100M0010C005P005G002 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.900 real 0.300 user 0.610 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 32133->32026 groups
pnml2lts-sym: Regrouping took 1461.410 real 1458.270 user 2.930 sys
pnml2lts-sym: state vector length is 32899; there are 32026 groups

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="FamilyReunion-PT-L00100M0010C005P005G002"
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 FamilyReunion-PT-L00100M0010C005P005G002, 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 r169-tall-167838855800422"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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