fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r216-tall-162098204500059
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for SharedMemory-COL-001000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16245.739 3600000.00 4100576.00 1299630.10 1 1 1000 1 1000 1 1 1 1 ? 1 1000 1 1 1 ? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r216-tall-162098204500059.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SharedMemory-COL-001000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098204500059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 17:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:52 instance
-rw-r--r-- 1 mcc users 5 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 55K May 5 16:52 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 SharedMemory-COL-001000-UpperBounds-00
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-01
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-02
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-03
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-04
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-05
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-06
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-07
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-08
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-09
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-10
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-11
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-12
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-13
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-14
FORMULA_NAME SharedMemory-COL-001000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621027952137

Running Version 0
[2021-05-14 21:32:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 21:32:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 21:32:51] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-14 21:32:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-14 21:32:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 593 ms
[2021-05-14 21:32:51] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 1004001 PT places and 3002000.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2021-05-14 21:32:51] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions in 8 ms.
[2021-05-14 21:32:51] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_2879356507920816919.dot
// Phase 1: matrix 5 rows 6 cols
[2021-05-14 21:32:51] [INFO ] Computed 3 place invariants in 3 ms
FORMULA SharedMemory-COL-001000-UpperBounds-11 1000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-04 1000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-02 1000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-001000-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-05-14 21:32:56] [INFO ] Unfolded HLPN to a Petri net with 1004001 places and 2002000 transitions in 4592 ms.
[2021-05-14 21:32:56] [INFO ] Unfolded HLPN properties in 120 ms.
// Phase 1: matrix 5 rows 6 cols
[2021-05-14 21:32:56] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 21:32:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 21:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:32:56] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-14 21:32:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:32:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 21:32:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:32:56] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-14 21:32:56] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 21:32:56] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 2 ms.
[2021-05-14 21:32:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 21:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:32:56] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-14 21:32:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:32:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 21:32:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:32:56] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-14 21:32:56] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 21:32:56] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2021-05-14 21:32:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 21:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:32:56] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-14 21:32:56] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 21:32:56] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 2 ms.
[2021-05-14 21:32:56] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-14 21:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:32:56] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-14 21:32:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:32:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 21:32:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:32:56] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-14 21:32:56] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 21:32:56] [INFO ] Added : 1 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 331 ms.
[2021-05-14 21:32:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 21:32:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:32:57] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-14 21:32:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:32:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 21:32:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:32:57] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-14 21:32:57] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 21:32:57] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 1 ms.
[2021-05-14 21:32:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 21:32:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:32:57] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-14 21:32:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:32:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 21:32:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:32:57] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-14 21:32:57] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 21:32:57] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 1 ms.
[2021-05-14 21:32:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 21:32:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 21:32:57] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-14 21:32:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 21:32:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-14 21:32:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 21:32:57] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-14 21:32:57] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-14 21:32:57] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1000, 1, 1, 1, 1000]
[2021-05-14 21:33:00] [INFO ] Unfolded HLPN to a Petri net with 1004001 places and 2002000 transitions in 3594 ms.
[2021-05-14 21:33:01] [INFO ] Unfolded HLPN properties in 116 ms.
Successfully produced net in file /tmp/petri1001_9459525352160127952.dot
Deduced a syphon composed of 1000 places in 982 ms
Reduce places removed 1000 places and 1000 transitions.
Interrupted random walk after 291 steps, including 0 resets, run timeout after 30041 ms. (steps per millisecond=0 ) properties seen :{0=1, 1=1, 2=130, 3=1, 4=1, 5=1, 6=137}
FORMULA SharedMemory-COL-001000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-COL-001000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-COL-001000-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-COL-001000-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-COL-001000-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 628 ms. (steps per millisecond=15 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 925 ms. (steps per millisecond=10 ) properties (out of 2) seen :2
// Phase 1: matrix 2001000 rows 1003001 cols
[2021-05-14 21:35:59] [WARNING] Invariant computation timed out after 120 seconds.
[2021-05-14 21:36:21] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:546)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-14 21:36:34] [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: Broken pipe ... while checking expression at index 1
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:546)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1000, 1000] Max seen :[130, 137]
Support contains 2000 out of 1003001 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1003001/1003001 places, 2001000/2001000 transitions.
Performed 145 Post agglomeration using F-continuation condition.
Performed 333 Post agglomeration using F-continuation condition.
Performed 614 Post agglomeration using F-continuation condition.
Performed 727 Post agglomeration using F-continuation condition.
Performed 990 Post agglomeration using F-continuation condition.
Performed 1166 Post agglomeration using F-continuation condition.
Performed 1821 Post agglomeration using F-continuation condition.
Performed 1963 Post agglomeration using F-continuation condition.
Performed 2240 Post agglomeration using F-continuation condition.
Performed 2269 Post agglomeration using F-continuation condition.
Performed 2540 Post agglomeration using F-continuation condition.
Performed 2784 Post agglomeration using F-continuation condition.
Performed 3055 Post agglomeration using F-continuation condition.
Performed 3570 Post agglomeration using F-continuation condition.
Performed 4014 Post agglomeration using F-continuation condition.
Performed 4641 Post agglomeration using F-continuation condition.
Performed 5106 Post agglomeration using F-continuation condition.
Performed 5603 Post agglomeration using F-continuation condition.
Performed 5931 Post agglomeration using F-continuation condition.
Performed 6401 Post agglomeration using F-continuation condition.
Performed 6940 Post agglomeration using F-continuation condition.
Performed 7108 Post agglomeration using F-continuation condition.
Performed 7345 Post agglomeration using F-continuation condition.
Performed 7517 Post agglomeration using F-continuation condition.
Performed 7618 Post agglomeration using F-continuation condition.
Performed 7993 Post agglomeration using F-continuation condition.
Performed 8765 Post agglomeration using F-continuation condition.
Performed 8892 Post agglomeration using F-continuation condition.
Performed 8992 Post agglomeration using F-continuation condition.
Performed 9180 Post agglomeration using F-continuation condition.
Performed 9248 Post agglomeration using F-continuation condition.
Performed 9499 Post agglomeration using F-continuation condition.
Performed 9931 Post agglomeration using F-continuation condition.
Performed 10272 Post agglomeration using F-continuation condition.
Performed 10614 Post agglomeration using F-continuation condition.
Performed 10985 Post agglomeration using F-continuation condition.
Performed 11276 Post agglomeration using F-continuation condition.
Performed 11488 Post agglomeration using F-continuation condition.
Performed 11941 Post agglomeration using F-continuation condition.
Performed 12485 Post agglomeration using F-continuation condition.
Performed 12897 Post agglomeration using F-continuation condition.
Performed 13501 Post agglomeration using F-continuation condition.
Performed 13650 Post agglomeration using F-continuation condition.
Performed 13762 Post agglomeration using F-continuation condition.
Performed 14257 Post agglomeration using F-continuation condition.
Performed 14621 Post agglomeration using F-continuation condition.
Performed 14841 Post agglomeration using F-continuation condition.
Performed 15051 Post agglomeration using F-continuation condition.
Performed 15725 Post agglomeration using F-continuation condition.
Performed 16146 Post agglomeration using F-continuation condition.
Performed 16544 Post agglomeration using F-continuation condition.
Performed 16775 Post agglomeration using F-continuation condition.
Performed 17128 Post agglomeration using F-continuation condition.
Performed 17250 Post agglomeration using F-continuation condition.
Performed 17324 Post agglomeration using F-continuation condition.
Performed 17584 Post agglomeration using F-continuation condition.
Performed 18014 Post agglomeration using F-continuation condition.
Performed 18156 Post agglomeration using F-continuation condition.
Performed 18349 Post agglomeration using F-continuation condition.
Performed 18982 Post agglomeration using F-continuation condition.
Performed 19148 Post agglomeration using F-continuation condition.
Performed 19887 Post agglomeration using F-continuation condition.
Performed 20601 Post agglomeration using F-continuation condition.
Performed 21194 Post agglomeration using F-continuation condition.
Performed 21867 Post agglomeration using F-continuation condition.
Performed 22758 Post agglomeration using F-continuation condition.
Performed 23260 Post agglomeration using F-continuation condition.
Performed 23511 Post agglomeration using F-continuation condition.
Performed 23654 Post agglomeration using F-continuation condition.
Performed 24086 Post agglomeration using F-continuation condition.
Performed 24976 Post agglomeration using F-continuation condition.
Performed 25720 Post agglomeration using F-continuation condition.
Performed 26363 Post agglomeration using F-continuation condition.
Performed 26974 Post agglomeration using F-continuation condition.
Performed 27709 Post agglomeration using F-continuation condition.
Performed 28241 Post agglomeration using F-continuation condition.
Performed 28967 Post agglomeration using F-continuation condition.
Performed 29363 Post agglomeration using F-continuation condition.
Performed 30154 Post agglomeration using F-continuation condition.
Performed 30624 Post agglomeration using F-continuation condition.
Performed 31710 Post agglomeration using F-continuation condition.
Performed 32013 Post agglomeration using F-continuation condition.
Performed 32875 Post agglomeration using F-continuation condition.
Performed 33545 Post agglomeration using F-continuation condition.
Performed 34144 Post agglomeration using F-continuation condition.
Performed 35033 Post agglomeration using F-continuation condition.
Performed 35881 Post agglomeration using F-continuation condition.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="SharedMemory-COL-001000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is SharedMemory-COL-001000, 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 r216-tall-162098204500059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-COL-001000.tgz
mv SharedMemory-COL-001000 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 ;