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.r170-tall-167838857200405.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is FamilyReunion-PT-L00020M0002C001P001G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857200405
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 29K Feb 26 11:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 214K Feb 26 11:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 74K Feb 26 11:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 290K Feb 26 11:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 16K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 62K Feb 26 11:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 423K Feb 26 11:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113K Feb 26 11:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 417K Feb 26 11:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.3K 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 1.3M 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678537405911

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00020M0002C001P001G001
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 12:23:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 12:23:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 12:23:27] [INFO ] Load time of PNML (sax parser for PT used): 230 ms
[2023-03-11 12:23:27] [INFO ] Transformed 3271 places.
[2023-03-11 12:23:27] [INFO ] Transformed 2753 transitions.
[2023-03-11 12:23:27] [INFO ] Parsed PT model containing 3271 places and 2753 transitions and 8446 arcs in 379 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduce places removed 11 places and 0 transitions.
// Phase 1: matrix 2753 rows 3260 cols
[2023-03-11 12:23:28] [INFO ] Computed 748 place invariants in 181 ms
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 8 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 15) seen :68
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :17
[2023-03-11 12:23:28] [INFO ] Invariant cache hit.
[2023-03-11 12:23:29] [INFO ] [Real]Absence check using 61 positive place invariants in 61 ms returned sat
[2023-03-11 12:23:29] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 179 ms returned sat
[2023-03-11 12:23:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:23:30] [INFO ] [Real]Absence check using state equation in 1433 ms returned sat
[2023-03-11 12:23:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:23:31] [INFO ] [Nat]Absence check using 61 positive place invariants in 54 ms returned sat
[2023-03-11 12:23:31] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 184 ms returned sat
[2023-03-11 12:23:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:23:32] [INFO ] [Nat]Absence check using state equation in 1356 ms returned sat
[2023-03-11 12:23:33] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 184 ms.
[2023-03-11 12:23:38] [INFO ] Deduced a trap composed of 45 places in 2119 ms of which 12 ms to minimize.
[2023-03-11 12:23:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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 12:23:38] [INFO ] [Real]Absence check using 61 positive place invariants in 63 ms returned sat
[2023-03-11 12:23:38] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 142 ms returned unsat
[2023-03-11 12:23:38] [INFO ] [Real]Absence check using 61 positive place invariants in 50 ms returned sat
[2023-03-11 12:23:39] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 134 ms returned unsat
[2023-03-11 12:23:39] [INFO ] [Real]Absence check using 61 positive place invariants in 50 ms returned sat
[2023-03-11 12:23:39] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 191 ms returned sat
[2023-03-11 12:23:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:23:41] [INFO ] [Real]Absence check using state equation in 1473 ms returned sat
[2023-03-11 12:23:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:23:41] [INFO ] [Nat]Absence check using 61 positive place invariants in 55 ms returned sat
[2023-03-11 12:23:41] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 189 ms returned sat
[2023-03-11 12:23:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:23:43] [INFO ] [Nat]Absence check using state equation in 1485 ms returned sat
[2023-03-11 12:23:43] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 159 ms.
[2023-03-11 12:23:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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 12:23:46] [INFO ] [Real]Absence check using 61 positive place invariants in 50 ms returned sat
[2023-03-11 12:23:46] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 181 ms returned sat
[2023-03-11 12:23:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:23:48] [INFO ] [Real]Absence check using state equation in 1489 ms returned sat
[2023-03-11 12:23:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:23:48] [INFO ] [Nat]Absence check using 61 positive place invariants in 52 ms returned sat
[2023-03-11 12:23:48] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 185 ms returned sat
[2023-03-11 12:23:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:23:50] [INFO ] [Nat]Absence check using state equation in 1403 ms returned sat
[2023-03-11 12:23:50] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 143 ms.
[2023-03-11 12:23:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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 12:23:53] [INFO ] [Real]Absence check using 61 positive place invariants in 51 ms returned sat
[2023-03-11 12:23:54] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 183 ms returned sat
[2023-03-11 12:23:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:23:55] [INFO ] [Real]Absence check using state equation in 1476 ms returned sat
[2023-03-11 12:23:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:23:55] [INFO ] [Nat]Absence check using 61 positive place invariants in 51 ms returned sat
[2023-03-11 12:23:56] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 185 ms returned sat
[2023-03-11 12:23:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:23:57] [INFO ] [Nat]Absence check using state equation in 1487 ms returned sat
[2023-03-11 12:23:57] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 132 ms.
[2023-03-11 12:24:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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 12:24:01] [INFO ] [Real]Absence check using 61 positive place invariants in 50 ms returned sat
[2023-03-11 12:24:01] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 179 ms returned unsat
[2023-03-11 12:24:01] [INFO ] [Real]Absence check using 61 positive place invariants in 50 ms returned sat
[2023-03-11 12:24:01] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 184 ms returned sat
[2023-03-11 12:24:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:24:03] [INFO ] [Real]Absence check using state equation in 1324 ms returned sat
[2023-03-11 12:24:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:24:03] [INFO ] [Nat]Absence check using 61 positive place invariants in 50 ms returned sat
[2023-03-11 12:24:03] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 191 ms returned sat
[2023-03-11 12:24:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:24:05] [INFO ] [Nat]Absence check using state equation in 1364 ms returned sat
[2023-03-11 12:24:05] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 134 ms.
[2023-03-11 12:24:10] [INFO ] Deduced a trap composed of 45 places in 2082 ms of which 3 ms to minimize.
[2023-03-11 12:24:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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 12:24:10] [INFO ] [Real]Absence check using 61 positive place invariants in 48 ms returned sat
[2023-03-11 12:24:10] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 188 ms returned sat
[2023-03-11 12:24:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:24:12] [INFO ] [Real]Absence check using state equation in 1408 ms returned sat
[2023-03-11 12:24:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:24:12] [INFO ] [Nat]Absence check using 61 positive place invariants in 50 ms returned sat
[2023-03-11 12:24:12] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 176 ms returned sat
[2023-03-11 12:24:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:24:14] [INFO ] [Nat]Absence check using state equation in 1313 ms returned sat
[2023-03-11 12:24:14] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 115 ms.
[2023-03-11 12:24:19] [INFO ] Deduced a trap composed of 45 places in 2046 ms of which 4 ms to minimize.
[2023-03-11 12:24:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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 12:24:19] [INFO ] [Real]Absence check using 61 positive place invariants in 50 ms returned sat
[2023-03-11 12:24:19] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 113 ms returned unsat
Current structural bounds on expressions (after SMT) : [361, 21, 2, 1065, 722, 722, 2, 4537, 1, 1] Max seen :[5, 21, 2, 6, 6, 7, 2, 14, 0, 1]
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-01 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 106 out of 3260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3260/3260 places, 2753/2753 transitions.
Graph (complete) has 4960 edges and 3260 vertex of which 2525 are kept as prefixes of interest. Removing 735 places using SCC suffix rule.9 ms
Discarding 735 places :
Also discarding 695 output transitions
Drop transitions removed 695 transitions
Discarding 378 places :
Implicit places reduction removed 378 places
Drop transitions removed 1047 transitions
Trivial Post-agglo rules discarded 1047 transitions
Performed 1047 trivial Post agglomeration. Transition count delta: 1047
Iterating post reduction 0 with 1425 rules applied. Total rules applied 1426 place count 2147 transition count 1011
Reduce places removed 1047 places and 0 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Iterating post reduction 1 with 1090 rules applied. Total rules applied 2516 place count 1100 transition count 968
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 2559 place count 1057 transition count 968
Performed 168 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 168 Pre rules applied. Total rules applied 2559 place count 1057 transition count 800
Deduced a syphon composed of 168 places in 1 ms
Ensure Unique test removed 63 places
Reduce places removed 231 places and 0 transitions.
Iterating global reduction 3 with 399 rules applied. Total rules applied 2958 place count 826 transition count 800
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 3 with 42 rules applied. Total rules applied 3000 place count 826 transition count 758
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 3042 place count 784 transition count 758
Discarding 147 places :
Symmetric choice reduction at 5 with 147 rule applications. Total rules 3189 place count 637 transition count 611
Iterating global reduction 5 with 147 rules applied. Total rules applied 3336 place count 637 transition count 611
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 5 with 84 rules applied. Total rules applied 3420 place count 595 transition count 569
Reduce places removed 21 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 6 with 63 rules applied. Total rules applied 3483 place count 574 transition count 527
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 7 with 42 rules applied. Total rules applied 3525 place count 532 transition count 527
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 21 Pre rules applied. Total rules applied 3525 place count 532 transition count 506
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 8 with 42 rules applied. Total rules applied 3567 place count 511 transition count 506
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 3570 place count 508 transition count 443
Iterating global reduction 8 with 3 rules applied. Total rules applied 3573 place count 508 transition count 443
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 8 with 42 rules applied. Total rules applied 3615 place count 487 transition count 422
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 21 Pre rules applied. Total rules applied 3615 place count 487 transition count 401
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 9 with 42 rules applied. Total rules applied 3657 place count 466 transition count 401
Discarding 41 places :
Symmetric choice reduction at 9 with 41 rule applications. Total rules 3698 place count 425 transition count 360
Iterating global reduction 9 with 41 rules applied. Total rules applied 3739 place count 425 transition count 360
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 9 with 101 rules applied. Total rules applied 3840 place count 405 transition count 279
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 10 with 40 rules applied. Total rules applied 3880 place count 365 transition count 279
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 11 with 65 rules applied. Total rules applied 3945 place count 322 transition count 257
Free-agglomeration rule (complex) applied 43 times.
Iterating global reduction 11 with 43 rules applied. Total rules applied 3988 place count 322 transition count 214
Ensure Unique test removed 21 places
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 11 with 64 rules applied. Total rules applied 4052 place count 258 transition count 214
Reduce places removed 20 places and 20 transitions.
Iterating global reduction 12 with 20 rules applied. Total rules applied 4072 place count 238 transition count 194
Applied a total of 4072 rules in 475 ms. Remains 238 /3260 variables (removed 3022) and now considering 194/2753 (removed 2559) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 475 ms. Remains : 238/3260 places, 194/2753 transitions.
// Phase 1: matrix 194 rows 238 cols
[2023-03-11 12:24:20] [INFO ] Computed 45 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 5194 resets, run finished after 4456 ms. (steps per millisecond=224 ) properties (out of 6) seen :71
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 389 resets, run finished after 814 ms. (steps per millisecond=1228 ) properties (out of 5) seen :25
Incomplete Best-First random walk after 1000001 steps, including 293 resets, run finished after 903 ms. (steps per millisecond=1107 ) properties (out of 5) seen :51
Incomplete Best-First random walk after 1000001 steps, including 247 resets, run finished after 1095 ms. (steps per millisecond=913 ) properties (out of 5) seen :80
Incomplete Best-First random walk after 1000001 steps, including 247 resets, run finished after 1114 ms. (steps per millisecond=897 ) properties (out of 5) seen :77
Incomplete Best-First random walk after 1000001 steps, including 335 resets, run finished after 829 ms. (steps per millisecond=1206 ) properties (out of 5) seen :39
[2023-03-11 12:24:29] [INFO ] Invariant cache hit.
[2023-03-11 12:24:29] [INFO ] [Real]Absence check using 0 positive and 45 generalized place invariants in 6 ms returned sat
[2023-03-11 12:24:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:24:29] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
[2023-03-11 12:24:29] [INFO ] [Real]Absence check using 0 positive and 45 generalized place invariants in 6 ms returned sat
[2023-03-11 12:24:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:24:29] [INFO ] [Real]Absence check using state equation in 37 ms returned unsat
[2023-03-11 12:24:29] [INFO ] [Real]Absence check using 0 positive and 45 generalized place invariants in 6 ms returned sat
[2023-03-11 12:24:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:24:29] [INFO ] [Real]Absence check using state equation in 41 ms returned unsat
[2023-03-11 12:24:29] [INFO ] [Real]Absence check using 0 positive and 45 generalized place invariants in 6 ms returned sat
[2023-03-11 12:24:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:24:29] [INFO ] [Real]Absence check using state equation in 43 ms returned unsat
[2023-03-11 12:24:29] [INFO ] [Real]Absence check using 0 positive and 45 generalized place invariants in 6 ms returned sat
[2023-03-11 12:24:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:24:29] [INFO ] [Real]Absence check using state equation in 30 ms returned unsat
Current structural bounds on expressions (after SMT) : [21, 21, 21, 21, 21] Max seen :[21, 21, 21, 21, 21]
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-07 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-05 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-04 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-03 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-00 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 62564 ms.
ITS solved all properties within timeout

BK_STOP 1678537470997

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-L00020M0002C001P001G001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is FamilyReunion-PT-L00020M0002C001P001G001, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838857200405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00020M0002C001P001G001.tgz
mv FamilyReunion-PT-L00020M0002C001P001G001 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;