Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r089-tall-165260117900271.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
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 r089-tall-165260117900271
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 33K Apr 30 08:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 218K Apr 30 08:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 53K Apr 30 08:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 207K Apr 30 08:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 16K May 9 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 9 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 30K May 9 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 9 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 9 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K May 9 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.3M May 10 09:33 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 1652733384982

Running Version 0
[2022-05-16 20:36:26] [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]
[2022-05-16 20:36:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 20:36:26] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2022-05-16 20:36:26] [INFO ] Transformed 3271 places.
[2022-05-16 20:36:26] [INFO ] Transformed 2753 transitions.
[2022-05-16 20:36:26] [INFO ] Parsed PT model containing 3271 places and 2753 transitions in 218 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduce places removed 11 places and 0 transitions.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2753 rows 3260 cols
[2022-05-16 20:36:27] [INFO ] Computed 748 place invariants in 429 ms
Incomplete random walk after 10000 steps, including 8 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 15) seen :68
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-09 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 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :30
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 :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :41
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :40
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 :34
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 :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :32
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 :30
// Phase 1: matrix 2753 rows 3260 cols
[2022-05-16 20:36:28] [INFO ] Computed 748 place invariants in 148 ms
[2022-05-16 20:36:28] [INFO ] [Real]Absence check using 61 positive place invariants in 62 ms returned sat
[2022-05-16 20:36:28] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 163 ms returned unsat
[2022-05-16 20:36:29] [INFO ] [Real]Absence check using 61 positive place invariants in 59 ms returned sat
[2022-05-16 20:36:29] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 171 ms returned sat
[2022-05-16 20:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:36:30] [INFO ] [Real]Absence check using state equation in 1330 ms returned sat
[2022-05-16 20:36:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 20:36:37] [INFO ] [Nat]Absence check using 61 positive place invariants in 57 ms returned sat
[2022-05-16 20:36:37] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 170 ms returned sat
[2022-05-16 20:36:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 20:36:38] [INFO ] [Nat]Absence check using state equation in 1402 ms returned sat
[2022-05-16 20:36:39] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 167 ms.
[2022-05-16 20:36:41] [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 1
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
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)
[2022-05-16 20:36:42] [INFO ] [Real]Absence check using 61 positive place invariants in 46 ms returned sat
[2022-05-16 20:36:42] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 94 ms returned unsat
[2022-05-16 20:36:42] [INFO ] [Real]Absence check using 61 positive place invariants in 52 ms returned sat
[2022-05-16 20:36:42] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 191 ms returned unsat
[2022-05-16 20:36:43] [INFO ] [Real]Absence check using 61 positive place invariants in 54 ms returned sat
[2022-05-16 20:36:43] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 181 ms returned sat
[2022-05-16 20:36:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:36:44] [INFO ] [Real]Absence check using state equation in 1219 ms returned sat
[2022-05-16 20:36:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 20:36:44] [INFO ] [Nat]Absence check using 61 positive place invariants in 48 ms returned sat
[2022-05-16 20:36:45] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 199 ms returned sat
[2022-05-16 20:36:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 20:36:46] [INFO ] [Nat]Absence check using state equation in 1240 ms returned sat
[2022-05-16 20:36:46] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 125 ms.
[2022-05-16 20:36:49] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
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)
[2022-05-16 20:36:50] [INFO ] [Real]Absence check using 61 positive place invariants in 53 ms returned sat
[2022-05-16 20:36:50] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 76 ms returned unsat
[2022-05-16 20:36:50] [INFO ] [Real]Absence check using 61 positive place invariants in 47 ms returned sat
[2022-05-16 20:36:50] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 165 ms returned sat
[2022-05-16 20:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:36:51] [INFO ] [Real]Absence check using state equation in 1342 ms returned sat
[2022-05-16 20:36:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 20:36:52] [INFO ] [Nat]Absence check using 61 positive place invariants in 63 ms returned sat
[2022-05-16 20:36:52] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 192 ms returned sat
[2022-05-16 20:36:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 20:36:53] [INFO ] [Nat]Absence check using state equation in 1345 ms returned sat
[2022-05-16 20:36:54] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 149 ms.
[2022-05-16 20:36:59] [INFO ] Deduced a trap composed of 45 places in 2105 ms of which 10 ms to minimize.
[2022-05-16 20:36:59] [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 6
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
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)
[2022-05-16 20:36:59] [INFO ] [Real]Absence check using 61 positive place invariants in 48 ms returned sat
[2022-05-16 20:36:59] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 175 ms returned sat
[2022-05-16 20:36:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:37:00] [INFO ] [Real]Absence check using state equation in 1291 ms returned sat
[2022-05-16 20:37:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 20:37:01] [INFO ] [Nat]Absence check using 61 positive place invariants in 52 ms returned sat
[2022-05-16 20:37:01] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 177 ms returned sat
[2022-05-16 20:37:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 20:37:02] [INFO ] [Nat]Absence check using state equation in 1317 ms returned sat
[2022-05-16 20:37:03] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 140 ms.
[2022-05-16 20:37:08] [INFO ] Deduced a trap composed of 45 places in 2154 ms of which 5 ms to minimize.
[2022-05-16 20:37:08] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
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)
[2022-05-16 20:37:08] [INFO ] [Real]Absence check using 61 positive place invariants in 45 ms returned sat
[2022-05-16 20:37:08] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 14 ms returned unsat
[2022-05-16 20:37:08] [INFO ] [Real]Absence check using 61 positive place invariants in 48 ms returned sat
[2022-05-16 20:37:09] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 118 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 361, 21, 21, 722, 21, 361, 722, 1, 1] Max seen :[2, 5, 21, 21, 5, 21, 8, 4, 1, 1]
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-05 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-02 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 126 out of 3260 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3260/3260 places, 2753/2753 transitions.
Graph (complete) has 4960 edges and 3260 vertex of which 2842 are kept as prefixes of interest. Removing 418 places using SCC suffix rule.13 ms
Discarding 418 places :
Also discarding 380 output transitions
Drop transitions removed 380 transitions
Discarding 378 places :
Implicit places reduction removed 378 places
Drop transitions removed 1113 transitions
Trivial Post-agglo rules discarded 1113 transitions
Performed 1113 trivial Post agglomeration. Transition count delta: 1113
Iterating post reduction 0 with 1491 rules applied. Total rules applied 1492 place count 2464 transition count 1260
Reduce places removed 1113 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 1134 rules applied. Total rules applied 2626 place count 1351 transition count 1239
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 2647 place count 1330 transition count 1239
Performed 189 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 189 Pre rules applied. Total rules applied 2647 place count 1330 transition count 1050
Deduced a syphon composed of 189 places in 3 ms
Ensure Unique test removed 84 places
Reduce places removed 273 places and 0 transitions.
Iterating global reduction 3 with 462 rules applied. Total rules applied 3109 place count 1057 transition count 1050
Discarding 21 places :
Implicit places reduction removed 21 places
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 63 rules applied. Total rules applied 3172 place count 1036 transition count 1008
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 3214 place count 994 transition count 1008
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 3214 place count 994 transition count 987
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 3256 place count 973 transition count 987
Discarding 168 places :
Symmetric choice reduction at 5 with 168 rule applications. Total rules 3424 place count 805 transition count 819
Iterating global reduction 5 with 168 rules applied. Total rules applied 3592 place count 805 transition count 819
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 5 with 105 rules applied. Total rules applied 3697 place count 784 transition count 735
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 6 with 84 rules applied. Total rules applied 3781 place count 700 transition count 735
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 42 Pre rules applied. Total rules applied 3781 place count 700 transition count 693
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 7 with 84 rules applied. Total rules applied 3865 place count 658 transition count 693
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 3868 place count 655 transition count 630
Iterating global reduction 7 with 3 rules applied. Total rules applied 3871 place count 655 transition count 630
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 63 places :
Implicit places reduction removed 63 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 7 with 105 rules applied. Total rules applied 3976 place count 592 transition count 588
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 3997 place count 571 transition count 588
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 42 Pre rules applied. Total rules applied 3997 place count 571 transition count 546
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 9 with 84 rules applied. Total rules applied 4081 place count 529 transition count 546
Discarding 42 places :
Symmetric choice reduction at 9 with 42 rule applications. Total rules 4123 place count 487 transition count 504
Iterating global reduction 9 with 42 rules applied. Total rules applied 4165 place count 487 transition count 504
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 9 with 105 rules applied. Total rules applied 4270 place count 466 transition count 420
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 10 with 42 rules applied. Total rules applied 4312 place count 424 transition count 420
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 11 with 63 rules applied. Total rules applied 4375 place count 382 transition count 399
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 11 with 42 rules applied. Total rules applied 4417 place count 361 transition count 378
Free-agglomeration rule (complex) applied 84 times.
Iterating global reduction 11 with 84 rules applied. Total rules applied 4501 place count 361 transition count 294
Ensure Unique test removed 21 places
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 11 with 105 rules applied. Total rules applied 4606 place count 256 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4607 place count 255 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4608 place count 254 transition count 292
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4609 place count 253 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4610 place count 252 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4611 place count 251 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4612 place count 250 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4613 place count 249 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4614 place count 248 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4615 place count 247 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4616 place count 246 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4617 place count 245 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4618 place count 244 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4619 place count 243 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4620 place count 242 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4621 place count 241 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4622 place count 240 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4623 place count 239 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4624 place count 238 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4625 place count 237 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4626 place count 236 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4627 place count 235 transition count 273
Applied a total of 4627 rules in 508 ms. Remains 235 /3260 variables (removed 3025) and now considering 273/2753 (removed 2480) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/3260 places, 273/2753 transitions.
// Phase 1: matrix 273 rows 235 cols
[2022-05-16 20:37:09] [INFO ] Computed 24 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 5917 resets, run finished after 4058 ms. (steps per millisecond=246 ) properties (out of 4) seen :54
Incomplete Best-First random walk after 1000001 steps, including 253 resets, run finished after 822 ms. (steps per millisecond=1216 ) properties (out of 4) seen :24
Incomplete Best-First random walk after 1000001 steps, including 404 resets, run finished after 1175 ms. (steps per millisecond=851 ) properties (out of 4) seen :24
Incomplete Best-First random walk after 1000001 steps, including 216 resets, run finished after 896 ms. (steps per millisecond=1116 ) properties (out of 4) seen :50
Incomplete Best-First random walk after 1000001 steps, including 253 resets, run finished after 1137 ms. (steps per millisecond=879 ) properties (out of 4) seen :57
// Phase 1: matrix 273 rows 235 cols
[2022-05-16 20:37:17] [INFO ] Computed 24 place invariants in 4 ms
[2022-05-16 20:37:17] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned sat
[2022-05-16 20:37:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:37:17] [INFO ] [Real]Absence check using state equation in 56 ms returned unsat
[2022-05-16 20:37:17] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2022-05-16 20:37:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:37:17] [INFO ] [Real]Absence check using state equation in 43 ms returned unsat
[2022-05-16 20:37:17] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned sat
[2022-05-16 20:37:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:37:18] [INFO ] [Real]Absence check using state equation in 55 ms returned unsat
[2022-05-16 20:37:18] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned sat
[2022-05-16 20:37:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:37:18] [INFO ] [Real]Absence check using state equation in 55 ms returned unsat
Current structural bounds on expressions (after SMT) : [21, 21, 21, 21] Max seen :[21, 21, 21, 21]
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-07 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-06 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-01 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652733456382

--------------------
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="FamilyReunion-PT-L00020M0002C001P001G001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
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 r089-tall-165260117900271"
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 ;