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.r083-tall-162048876000939.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 FamilyReunion-PT-L00010M0001C001P001G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048876000939
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 77K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 526K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 157K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 591K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.2K Mar 28 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Mar 28 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 28 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 28 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Mar 23 10:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 40K Mar 23 10:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 22 18:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 22 18:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 24 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 552K May 5 16:51 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-L00010M0001C001P001G001-UpperBounds-00
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-01
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-02
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-03
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-04
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-05
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-06
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-07
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-08
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-09
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-10
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-11
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-12
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-13
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-14
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620709367953

Running Version 0
[2021-05-11 05:02:49] [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-11 05:02:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 05:02:49] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2021-05-11 05:02:49] [INFO ] Transformed 1475 places.
[2021-05-11 05:02:49] [INFO ] Transformed 1234 transitions.
[2021-05-11 05:02:49] [INFO ] Parsed PT model containing 1475 places and 1234 transitions in 143 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduce places removed 10 places and 0 transitions.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1234 rows 1465 cols
[2021-05-11 05:02:49] [INFO ] Computed 332 place invariants in 140 ms
Incomplete random walk after 10000 steps, including 15 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 15) seen :43
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) 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 11) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) 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 11) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :19
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :21
// Phase 1: matrix 1234 rows 1465 cols
[2021-05-11 05:02:50] [INFO ] Computed 332 place invariants in 23 ms
[2021-05-11 05:02:50] [INFO ] [Real]Absence check using 30 positive place invariants in 30 ms returned sat
[2021-05-11 05:02:50] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 60 ms returned unsat
[2021-05-11 05:02:50] [INFO ] [Real]Absence check using 30 positive place invariants in 22 ms returned sat
[2021-05-11 05:02:50] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 77 ms returned sat
[2021-05-11 05:02:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 05:02:51] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2021-05-11 05:02:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 05:02:51] [INFO ] [Nat]Absence check using 30 positive place invariants in 25 ms returned sat
[2021-05-11 05:02:51] [INFO ] [Nat]Absence check using 30 positive and 302 generalized place invariants in 77 ms returned sat
[2021-05-11 05:02:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 05:02:52] [INFO ] [Nat]Absence check using state equation in 500 ms returned sat
[2021-05-11 05:02:52] [INFO ] Computed and/alt/rep : 1133/1650/1133 causal constraints (skipped 90 transitions) in 87 ms.
[2021-05-11 05:02:56] [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)
[2021-05-11 05:02:56] [INFO ] [Real]Absence check using 30 positive place invariants in 24 ms returned sat
[2021-05-11 05:02:56] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 74 ms returned sat
[2021-05-11 05:02:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 05:02:57] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2021-05-11 05:02:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 05:02:57] [INFO ] [Nat]Absence check using 30 positive place invariants in 21 ms returned sat
[2021-05-11 05:02:57] [INFO ] [Nat]Absence check using 30 positive and 302 generalized place invariants in 72 ms returned sat
[2021-05-11 05:02:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 05:02:57] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2021-05-11 05:02:57] [INFO ] Computed and/alt/rep : 1133/1650/1133 causal constraints (skipped 90 transitions) in 66 ms.
[2021-05-11 05:03:02] [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 2
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)
[2021-05-11 05:03:02] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2021-05-11 05:03:02] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 32 ms returned unsat
[2021-05-11 05:03:02] [INFO ] [Real]Absence check using 30 positive place invariants in 22 ms returned sat
[2021-05-11 05:03:02] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 77 ms returned sat
[2021-05-11 05:03:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 05:03:03] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2021-05-11 05:03:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 05:03:03] [INFO ] [Nat]Absence check using 30 positive place invariants in 22 ms returned sat
[2021-05-11 05:03:03] [INFO ] [Nat]Absence check using 30 positive and 302 generalized place invariants in 76 ms returned sat
[2021-05-11 05:03:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 05:03:03] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2021-05-11 05:03:04] [INFO ] Computed and/alt/rep : 1133/1650/1133 causal constraints (skipped 90 transitions) in 78 ms.
[2021-05-11 05:03:08] [INFO ] Deduced a trap composed of 31 places in 647 ms of which 14 ms to minimize.
[2021-05-11 05:03: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 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.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)
[2021-05-11 05:03:09] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2021-05-11 05:03:09] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 36 ms returned unsat
[2021-05-11 05:03:09] [INFO ] [Real]Absence check using 30 positive place invariants in 22 ms returned sat
[2021-05-11 05:03:09] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 75 ms returned sat
[2021-05-11 05:03:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 05:03:09] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2021-05-11 05:03:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 05:03:09] [INFO ] [Nat]Absence check using 30 positive place invariants in 22 ms returned sat
[2021-05-11 05:03:10] [INFO ] [Nat]Absence check using 30 positive and 302 generalized place invariants in 78 ms returned sat
[2021-05-11 05:03:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 05:03:10] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2021-05-11 05:03:10] [INFO ] Computed and/alt/rep : 1133/1650/1133 causal constraints (skipped 90 transitions) in 80 ms.
[2021-05-11 05:03:14] [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.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)
[2021-05-11 05:03:15] [INFO ] [Real]Absence check using 30 positive place invariants in 20 ms returned sat
[2021-05-11 05:03:15] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 70 ms returned unsat
[2021-05-11 05:03:15] [INFO ] [Real]Absence check using 30 positive place invariants in 20 ms returned sat
[2021-05-11 05:03:15] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 3 ms returned unsat
[2021-05-11 05:03:15] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2021-05-11 05:03:15] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 32 ms returned unsat
[2021-05-11 05:03:15] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2021-05-11 05:03:15] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 66 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 148082, 1882, 11, -1, 11, 941, 1, 1, 1, 1] Max seen :[2, 5, 4, 11, 6, 11, 3, 1, 1, 1, 1]
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-06 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-04 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 57 out of 1465 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1465/1465 places, 1234/1234 transitions.
Graph (complete) has 2215 edges and 1465 vertex of which 1115 are kept as prefixes of interest. Removing 350 places using SCC suffix rule.8 ms
Discarding 350 places :
Also discarding 310 output transitions
Drop transitions removed 310 transitions
Discarding 132 places :
Implicit places reduction removed 132 places
Drop transitions removed 396 transitions
Trivial Post-agglo rules discarded 396 transitions
Performed 396 trivial Post agglomeration. Transition count delta: 396
Iterating post reduction 0 with 528 rules applied. Total rules applied 529 place count 983 transition count 528
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 925 place count 587 transition count 528
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 925 place count 587 transition count 418
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 55 places
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 2 with 275 rules applied. Total rules applied 1200 place count 422 transition count 418
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 1200 place count 422 transition count 407
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 1222 place count 411 transition count 407
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 1277 place count 356 transition count 352
Iterating global reduction 2 with 55 rules applied. Total rules applied 1332 place count 356 transition count 352
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 2 with 88 rules applied. Total rules applied 1420 place count 334 transition count 286
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 3 with 55 rules applied. Total rules applied 1475 place count 279 transition count 286
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 1475 place count 279 transition count 264
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 1519 place count 257 transition count 264
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1520 place count 256 transition count 253
Iterating global reduction 4 with 1 rules applied. Total rules applied 1521 place count 256 transition count 253
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 22 rules applied. Total rules applied 1543 place count 245 transition count 242
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1554 place count 234 transition count 242
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1554 place count 234 transition count 231
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1576 place count 223 transition count 231
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1587 place count 212 transition count 220
Iterating global reduction 6 with 11 rules applied. Total rules applied 1598 place count 212 transition count 220
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 6 with 44 rules applied. Total rules applied 1642 place count 201 transition count 187
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 1664 place count 179 transition count 187
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1686 place count 168 transition count 176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1687 place count 167 transition count 175
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1688 place count 166 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1689 place count 165 transition count 173
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1690 place count 164 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1691 place count 163 transition count 171
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1692 place count 162 transition count 170
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1693 place count 161 transition count 169
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1694 place count 160 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1695 place count 159 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1696 place count 158 transition count 166
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1697 place count 157 transition count 165
Applied a total of 1697 rules in 183 ms. Remains 157 /1465 variables (removed 1308) and now considering 165/1234 (removed 1069) transitions.
Finished structural reductions, in 1 iterations. Remains : 157/1465 places, 165/1234 transitions.
// Phase 1: matrix 165 rows 157 cols
[2021-05-11 05:03:15] [INFO ] Computed 24 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 11235 resets, run finished after 3476 ms. (steps per millisecond=287 ) properties (out of 4) seen :35
Incomplete Best-First random walk after 1000001 steps, including 878 resets, run finished after 896 ms. (steps per millisecond=1116 ) properties (out of 4) seen :37
Incomplete Best-First random walk after 1000001 steps, including 1170 resets, run finished after 887 ms. (steps per millisecond=1127 ) properties (out of 4) seen :14
Incomplete Best-First random walk after 1000001 steps, including 778 resets, run finished after 659 ms. (steps per millisecond=1517 ) properties (out of 4) seen :32
Incomplete Best-First random walk after 1000001 steps, including 776 resets, run finished after 772 ms. (steps per millisecond=1295 ) properties (out of 4) seen :32
// Phase 1: matrix 165 rows 157 cols
[2021-05-11 05:03:22] [INFO ] Computed 24 place invariants in 1 ms
[2021-05-11 05:03:22] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-11 05:03:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 05:03:22] [INFO ] [Real]Absence check using state equation in 39 ms returned unsat
[2021-05-11 05:03:22] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-11 05:03:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 05:03:22] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
[2021-05-11 05:03:22] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-11 05:03:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 05:03:22] [INFO ] [Real]Absence check using state equation in 32 ms returned unsat
[2021-05-11 05:03:22] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned sat
[2021-05-11 05:03:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 05:03:22] [INFO ] [Real]Absence check using state equation in 34 ms returned unsat
Current structural bounds on expressions (after SMT) : [11, 11, 11, 11] Max seen :[11, 11, 11, 11]
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-07 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-05 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-03 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-02 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620709403833

--------------------
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-L00010M0001C001P001G001"
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 FamilyReunion-PT-L00010M0001C001P001G001, 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 r083-tall-162048876000939"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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