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.r233-tall-165286037400256.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 ShieldPPPt-PT-050B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037400256
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.7K Apr 29 13:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 13:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 13:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 13:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 29 13:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 13:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 13:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 29 13:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 955K May 10 09:34 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 ShieldPPPt-PT-050B-UpperBounds-00
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-01
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-02
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-03
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-04
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-05
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-06
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-07
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-08
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-09
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-10
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-11
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-12
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-13
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-14
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654335035146

Running Version 0
[2022-06-04 09:30:38] [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-06-04 09:30:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-04 09:30:38] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2022-06-04 09:30:38] [INFO ] Transformed 3903 places.
[2022-06-04 09:30:38] [INFO ] Transformed 3553 transitions.
[2022-06-04 09:30:38] [INFO ] Found NUPN structural information;
[2022-06-04 09:30:38] [INFO ] Parsed PT model containing 3903 places and 3553 transitions in 369 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 3553 rows 3903 cols
[2022-06-04 09:30:39] [INFO ] Computed 551 place invariants in 57 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 16) seen :8
FORMULA ShieldPPPt-PT-050B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
// Phase 1: matrix 3553 rows 3903 cols
[2022-06-04 09:30:39] [INFO ] Computed 551 place invariants in 21 ms
[2022-06-04 09:30:40] [INFO ] [Real]Absence check using 551 positive place invariants in 248 ms returned sat
[2022-06-04 09:30:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-04 09:30:42] [INFO ] [Real]Absence check using state equation in 1769 ms returned sat
[2022-06-04 09:30:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-04 09:30:43] [INFO ] [Nat]Absence check using 551 positive place invariants in 232 ms returned sat
[2022-06-04 09:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-04 09:30:44] [INFO ] [Nat]Absence check using state equation in 1796 ms returned sat
[2022-06-04 09:30:46] [INFO ] Deduced a trap composed of 23 places in 1220 ms of which 5 ms to minimize.
[2022-06-04 09:30:47] [INFO ] Deduced a trap composed of 19 places in 1124 ms of which 3 ms to minimize.
[2022-06-04 09:30:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
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-06-04 09:30:48] [INFO ] [Real]Absence check using 551 positive place invariants in 255 ms returned sat
[2022-06-04 09:30:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-04 09:30:50] [INFO ] [Real]Absence check using state equation in 1860 ms returned sat
[2022-06-04 09:30:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-04 09:30:50] [INFO ] [Nat]Absence check using 551 positive place invariants in 223 ms returned sat
[2022-06-04 09:30:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-04 09:30:52] [INFO ] [Nat]Absence check using state equation in 1837 ms returned sat
[2022-06-04 09:30:54] [INFO ] Deduced a trap composed of 19 places in 1248 ms of which 10 ms to minimize.
[2022-06-04 09:30:55] [INFO ] Deduced a trap composed of 23 places in 1194 ms of which 3 ms to minimize.
[2022-06-04 09:30:55] [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.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
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-06-04 09:30:56] [INFO ] [Real]Absence check using 551 positive place invariants in 244 ms returned sat
[2022-06-04 09:30:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-04 09:30:58] [INFO ] [Real]Absence check using state equation in 1824 ms returned sat
[2022-06-04 09:30:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-04 09:30:58] [INFO ] [Nat]Absence check using 551 positive place invariants in 241 ms returned sat
[2022-06-04 09:30:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-04 09:31:00] [INFO ] [Nat]Absence check using state equation in 1734 ms returned sat
[2022-06-04 09:31:01] [INFO ] Deduced a trap composed of 23 places in 1269 ms of which 3 ms to minimize.
[2022-06-04 09:31:03] [INFO ] Deduced a trap composed of 18 places in 1162 ms of which 2 ms to minimize.
[2022-06-04 09:31:03] [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.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
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-06-04 09:31:03] [INFO ] [Real]Absence check using 551 positive place invariants in 226 ms returned sat
[2022-06-04 09:31:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-04 09:31:05] [INFO ] [Real]Absence check using state equation in 1797 ms returned sat
[2022-06-04 09:31:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-04 09:31:06] [INFO ] [Nat]Absence check using 551 positive place invariants in 226 ms returned sat
[2022-06-04 09:31:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-04 09:31:08] [INFO ] [Nat]Absence check using state equation in 1801 ms returned sat
[2022-06-04 09:31:09] [INFO ] Deduced a trap composed of 30 places in 1168 ms of which 2 ms to minimize.
[2022-06-04 09:31:10] [INFO ] Deduced a trap composed of 19 places in 1178 ms of which 2 ms to minimize.
[2022-06-04 09:31:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
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-06-04 09:31:11] [INFO ] [Real]Absence check using 551 positive place invariants in 234 ms returned sat
[2022-06-04 09:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-04 09:31:13] [INFO ] [Real]Absence check using state equation in 1841 ms returned sat
[2022-06-04 09:31:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-04 09:31:14] [INFO ] [Nat]Absence check using 551 positive place invariants in 221 ms returned sat
[2022-06-04 09:31:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-04 09:31:16] [INFO ] [Nat]Absence check using state equation in 1856 ms returned sat
[2022-06-04 09:31:17] [INFO ] Deduced a trap composed of 21 places in 1244 ms of which 3 ms to minimize.
[2022-06-04 09:31:18] [INFO ] Deduced a trap composed of 19 places in 1199 ms of which 2 ms to minimize.
[2022-06-04 09:31:18] [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.verifyPossible(DeadlockTester.java:588)
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-06-04 09:31:19] [INFO ] [Real]Absence check using 551 positive place invariants in 230 ms returned sat
[2022-06-04 09:31:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-04 09:31:21] [INFO ] [Real]Absence check using state equation in 1860 ms returned sat
[2022-06-04 09:31:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-04 09:31:22] [INFO ] [Nat]Absence check using 551 positive place invariants in 225 ms returned sat
[2022-06-04 09:31:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-04 09:31:23] [INFO ] [Nat]Absence check using state equation in 1754 ms returned sat
[2022-06-04 09:31:25] [INFO ] Deduced a trap composed of 24 places in 1213 ms of which 2 ms to minimize.
[2022-06-04 09:31:26] [INFO ] Deduced a trap composed of 24 places in 1165 ms of which 2 ms to minimize.
[2022-06-04 09:31:28] [INFO ] Deduced a trap composed of 22 places in 2446 ms of which 8 ms to minimize.
[2022-06-04 09:31:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
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-06-04 09:31:29] [INFO ] [Real]Absence check using 551 positive place invariants in 227 ms returned sat
[2022-06-04 09:31:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-04 09:31:31] [INFO ] [Real]Absence check using state equation in 1779 ms returned sat
[2022-06-04 09:31:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-04 09:31:32] [INFO ] [Nat]Absence check using 551 positive place invariants in 221 ms returned sat
[2022-06-04 09:31:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-04 09:31:33] [INFO ] [Nat]Absence check using state equation in 1727 ms returned sat
[2022-06-04 09:31:35] [INFO ] Deduced a trap composed of 31 places in 1095 ms of which 2 ms to minimize.
[2022-06-04 09:31:36] [INFO ] Deduced a trap composed of 19 places in 1127 ms of which 3 ms to minimize.
[2022-06-04 09:31:37] [INFO ] Deduced a trap composed of 20 places in 1122 ms of which 2 ms to minimize.
[2022-06-04 09:31:37] [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.verifyPossible(DeadlockTester.java:588)
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-06-04 09:31:38] [INFO ] [Real]Absence check using 551 positive place invariants in 215 ms returned sat
[2022-06-04 09:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-04 09:31:39] [INFO ] [Real]Absence check using state equation in 1723 ms returned sat
[2022-06-04 09:31:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-04 09:31:40] [INFO ] [Nat]Absence check using 551 positive place invariants in 228 ms returned sat
[2022-06-04 09:31:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-04 09:31:42] [INFO ] [Nat]Absence check using state equation in 1917 ms returned sat
[2022-06-04 09:31:44] [INFO ] Deduced a trap composed of 18 places in 1542 ms of which 2 ms to minimize.
[2022-06-04 09:31:45] [INFO ] Deduced a trap composed of 27 places in 1573 ms of which 3 ms to minimize.
[2022-06-04 09:31:45] [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.verifyPossible(DeadlockTester.java:588)
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 3903 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Drop transitions removed 950 transitions
Trivial Post-agglo rules discarded 950 transitions
Performed 950 trivial Post agglomeration. Transition count delta: 950
Iterating post reduction 0 with 950 rules applied. Total rules applied 950 place count 3903 transition count 2603
Reduce places removed 950 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 952 rules applied. Total rules applied 1902 place count 2953 transition count 2601
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1903 place count 2952 transition count 2601
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 1903 place count 2952 transition count 2401
Deduced a syphon composed of 200 places in 6 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2303 place count 2752 transition count 2401
Discarding 347 places :
Symmetric choice reduction at 3 with 347 rule applications. Total rules 2650 place count 2405 transition count 2054
Iterating global reduction 3 with 347 rules applied. Total rules applied 2997 place count 2405 transition count 2054
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 149 Pre rules applied. Total rules applied 2997 place count 2405 transition count 1905
Deduced a syphon composed of 149 places in 12 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 298 rules applied. Total rules applied 3295 place count 2256 transition count 1905
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 3 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 3 with 1696 rules applied. Total rules applied 4991 place count 1408 transition count 1057
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5193 place count 1307 transition count 1057
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 5289 place count 1259 transition count 1057
Partial Free-agglomeration rule applied 148 times.
Drop transitions removed 148 transitions
Iterating global reduction 3 with 148 rules applied. Total rules applied 5437 place count 1259 transition count 1057
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 5438 place count 1258 transition count 1056
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5439 place count 1257 transition count 1056
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 5439 place count 1257 transition count 1054
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 5443 place count 1255 transition count 1054
Applied a total of 5443 rules in 1296 ms. Remains 1255 /3903 variables (removed 2648) and now considering 1054/3553 (removed 2499) transitions.
Finished structural reductions, in 1 iterations. Remains : 1255/3903 places, 1054/3553 transitions.
// Phase 1: matrix 1054 rows 1255 cols
[2022-06-04 09:31:47] [INFO ] Computed 550 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7327 ms. (steps per millisecond=136 ) properties (out of 8) seen :2
FORMULA ShieldPPPt-PT-050B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4845 ms. (steps per millisecond=206 ) properties (out of 6) seen :1
FORMULA ShieldPPPt-PT-050B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4705 ms. (steps per millisecond=212 ) properties (out of 5) seen :1
FORMULA ShieldPPPt-PT-050B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 4647 ms. (steps per millisecond=215 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4607 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
// Phase 1: matrix 1054 rows 1255 cols
[2022-06-04 09:32:13] [INFO ] Computed 550 place invariants in 9 ms
[2022-06-04 09:32:13] [INFO ] [Real]Absence check using 550 positive place invariants in 86 ms returned sat
[2022-06-04 09:32:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-04 09:32:13] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2022-06-04 09:32:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-04 09:32:14] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-06-04 09:32:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-04 09:32:14] [INFO ] [Nat]Absence check using 550 positive place invariants in 79 ms returned sat
[2022-06-04 09:32:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-04 09:32:14] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2022-06-04 09:32:14] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2022-06-04 09:32:14] [INFO ] Computed and/alt/rep : 1050/2473/1050 causal constraints (skipped 0 transitions) in 48 ms.
[2022-06-04 09:32:33] [INFO ] Added : 1019 causal constraints over 204 iterations in 19129 ms. Result :sat
Minimization took 2898 ms.
[2022-06-04 09:32:36] [INFO ] [Real]Absence check using 550 positive place invariants in 84 ms returned sat
[2022-06-04 09:32:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-04 09:32:37] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2022-06-04 09:32:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-04 09:32:37] [INFO ] [Nat]Absence check using 550 positive place invariants in 78 ms returned sat
[2022-06-04 09:32:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-04 09:32:37] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2022-06-04 09:32:37] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-06-04 09:32:37] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2022-06-04 09:32:38] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 0 ms to minimize.
[2022-06-04 09:32:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 256 ms
[2022-06-04 09:32:38] [INFO ] Computed and/alt/rep : 1050/2473/1050 causal constraints (skipped 0 transitions) in 53 ms.
[2022-06-04 09:32:58] [INFO ] Added : 1010 causal constraints over 202 iterations in 20430 ms.(timeout) Result :sat
Minimization took 1115 ms.
[2022-06-04 09:32:59] [INFO ] [Real]Absence check using 550 positive place invariants in 80 ms returned sat
[2022-06-04 09:32:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-04 09:33:00] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2022-06-04 09:33:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-04 09:33:00] [INFO ] [Nat]Absence check using 550 positive place invariants in 83 ms returned sat
[2022-06-04 09:33:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-04 09:33:00] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2022-06-04 09:33:00] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-06-04 09:33:00] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2022-06-04 09:33:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2022-06-04 09:33:01] [INFO ] Computed and/alt/rep : 1050/2473/1050 causal constraints (skipped 0 transitions) in 48 ms.
[2022-06-04 09:33:21] [INFO ] Added : 1005 causal constraints over 201 iterations in 20410 ms.(timeout) Result :sat
Minimization took 1472 ms.
[2022-06-04 09:33:23] [INFO ] [Real]Absence check using 550 positive place invariants in 75 ms returned sat
[2022-06-04 09:33:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-04 09:33:23] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2022-06-04 09:33:23] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-06-04 09:33:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-04 09:33:23] [INFO ] [Nat]Absence check using 550 positive place invariants in 75 ms returned sat
[2022-06-04 09:33:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-04 09:33:24] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2022-06-04 09:33:24] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-06-04 09:33:24] [INFO ] Computed and/alt/rep : 1050/2473/1050 causal constraints (skipped 0 transitions) in 48 ms.
[2022-06-04 09:33:45] [INFO ] Added : 1000 causal constraints over 200 iterations in 21243 ms.(timeout) Result :sat
Minimization took 684 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 171400 steps, including 1001 resets, run finished after 1202 ms. (steps per millisecond=142 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 191600 steps, including 1000 resets, run finished after 1240 ms. (steps per millisecond=154 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 163700 steps, including 1000 resets, run finished after 1158 ms. (steps per millisecond=141 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 123700 steps, including 1000 resets, run finished after 813 ms. (steps per millisecond=152 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 1255 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1255/1255 places, 1054/1054 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1255 transition count 1053
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1254 transition count 1053
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 1251 transition count 1050
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 1251 transition count 1049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 1250 transition count 1049
Applied a total of 10 rules in 120 ms. Remains 1250 /1255 variables (removed 5) and now considering 1049/1054 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1255 places, 1049/1054 transitions.
// Phase 1: matrix 1049 rows 1250 cols
[2022-06-04 09:33:50] [INFO ] Computed 550 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7372 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 989939 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=197 ) properties seen :{}
Interrupted Best-First random walk after 987605 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=197 ) properties seen :{}
Interrupted Best-First random walk after 969739 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=193 ) properties seen :{}
Interrupted Best-First random walk after 991986 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=198 ) properties seen :{}
// Phase 1: matrix 1049 rows 1250 cols
[2022-06-04 09:34:17] [INFO ] Computed 550 place invariants in 6 ms
[2022-06-04 09:34:18] [INFO ] [Real]Absence check using 550 positive place invariants in 81 ms returned sat
[2022-06-04 09:34:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-04 09:34:18] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2022-06-04 09:34:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-04 09:34:18] [INFO ] [Nat]Absence check using 550 positive place invariants in 80 ms returned sat
[2022-06-04 09:34:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-04 09:34:19] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2022-06-04 09:34:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-04 09:34:19] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-06-04 09:34:19] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2022-06-04 09:34:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-06-04 09:34:19] [INFO ] Computed and/alt/rep : 1045/2469/1045 causal constraints (skipped 0 transitions) in 46 ms.
[2022-06-04 09:34:38] [INFO ] Added : 1015 causal constraints over 204 iterations in 19440 ms. Result :sat
Minimization took 3001 ms.
[2022-06-04 09:34:41] [INFO ] [Real]Absence check using 550 positive place invariants in 77 ms returned sat
[2022-06-04 09:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-04 09:34:42] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2022-06-04 09:34:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-04 09:34:42] [INFO ] [Nat]Absence check using 550 positive place invariants in 83 ms returned sat
[2022-06-04 09:34:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-04 09:34:42] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2022-06-04 09:34:42] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-06-04 09:34:42] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2022-06-04 09:34:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2022-06-04 09:34:43] [INFO ] Computed and/alt/rep : 1045/2469/1045 causal constraints (skipped 0 transitions) in 61 ms.
[2022-06-04 09:35:05] [INFO ] Added : 1015 causal constraints over 203 iterations in 22500 ms.(timeout) Result :sat
Minimization took 891 ms.
[2022-06-04 09:35:06] [INFO ] [Real]Absence check using 550 positive place invariants in 83 ms returned sat
[2022-06-04 09:35:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-04 09:35:06] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2022-06-04 09:35:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-04 09:35:07] [INFO ] [Nat]Absence check using 550 positive place invariants in 82 ms returned sat
[2022-06-04 09:35:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-04 09:35:07] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2022-06-04 09:35:07] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-06-04 09:35:07] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2022-06-04 09:35:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2022-06-04 09:35:07] [INFO ] Computed and/alt/rep : 1045/2469/1045 causal constraints (skipped 0 transitions) in 53 ms.
[2022-06-04 09:35:25] [INFO ] Added : 1013 causal constraints over 204 iterations in 18016 ms. Result :sat
Minimization took 2264 ms.
[2022-06-04 09:35:28] [INFO ] [Real]Absence check using 550 positive place invariants in 82 ms returned sat
[2022-06-04 09:35:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-04 09:35:28] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2022-06-04 09:35:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-04 09:35:28] [INFO ] [Nat]Absence check using 550 positive place invariants in 77 ms returned sat
[2022-06-04 09:35:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-04 09:35:29] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2022-06-04 09:35:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2022-06-04 09:35:29] [INFO ] Computed and/alt/rep : 1045/2469/1045 causal constraints (skipped 0 transitions) in 48 ms.
[2022-06-04 09:35:47] [INFO ] Added : 1015 causal constraints over 204 iterations in 18473 ms. Result :sat
Minimization took 2006 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 269900 steps, including 1000 resets, run finished after 1716 ms. (steps per millisecond=157 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 195000 steps, including 1000 resets, run finished after 1306 ms. (steps per millisecond=149 ) properties (out of 4) seen :3 could not realise parikh vector
FORMULA ShieldPPPt-PT-050B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 123200 steps, including 1000 resets, run finished after 720 ms. (steps per millisecond=171 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 1250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1250/1250 places, 1049/1049 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1250 transition count 1047
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1248 transition count 1047
Applied a total of 4 rules in 30 ms. Remains 1248 /1250 variables (removed 2) and now considering 1047/1049 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1248/1250 places, 1047/1049 transitions.
// Phase 1: matrix 1047 rows 1248 cols
[2022-06-04 09:35:53] [INFO ] Computed 550 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6877 ms. (steps per millisecond=145 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4695 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
// Phase 1: matrix 1047 rows 1248 cols
[2022-06-04 09:36:05] [INFO ] Computed 550 place invariants in 7 ms
[2022-06-04 09:36:05] [INFO ] [Real]Absence check using 550 positive place invariants in 93 ms returned sat
[2022-06-04 09:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-04 09:36:05] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2022-06-04 09:36:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-04 09:36:05] [INFO ] [Nat]Absence check using 550 positive place invariants in 103 ms returned sat
[2022-06-04 09:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-04 09:36:06] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2022-06-04 09:36:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-04 09:36:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-06-04 09:36:06] [INFO ] Computed and/alt/rep : 1043/2467/1043 causal constraints (skipped 0 transitions) in 53 ms.
[2022-06-04 09:36:24] [INFO ] Added : 1023 causal constraints over 205 iterations in 17902 ms. Result :sat
Minimization took 836 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 218900 steps, including 1000 resets, run finished after 1222 ms. (steps per millisecond=179 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 1248 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1248/1248 places, 1047/1047 transitions.
Applied a total of 0 rules in 23 ms. Remains 1248 /1248 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1248/1248 places, 1047/1047 transitions.
Starting structural reductions, iteration 0 : 1248/1248 places, 1047/1047 transitions.
Applied a total of 0 rules in 22 ms. Remains 1248 /1248 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
// Phase 1: matrix 1047 rows 1248 cols
[2022-06-04 09:36:26] [INFO ] Computed 550 place invariants in 6 ms
[2022-06-04 09:36:26] [INFO ] Implicit Places using invariants in 565 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 567 ms to find 2 implicit places.
[2022-06-04 09:36:27] [INFO ] Redundant transitions in 58 ms returned []
// Phase 1: matrix 1047 rows 1246 cols
[2022-06-04 09:36:27] [INFO ] Computed 548 place invariants in 6 ms
[2022-06-04 09:36:27] [INFO ] Dead Transitions using invariants and state equation in 484 ms returned []
Starting structural reductions, iteration 1 : 1246/1248 places, 1047/1047 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1244 transition count 1045
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1244 transition count 1045
Applied a total of 4 rules in 40 ms. Remains 1244 /1246 variables (removed 2) and now considering 1045/1047 (removed 2) transitions.
// Phase 1: matrix 1045 rows 1244 cols
[2022-06-04 09:36:27] [INFO ] Computed 548 place invariants in 6 ms
[2022-06-04 09:36:28] [INFO ] Implicit Places using invariants in 607 ms returned []
// Phase 1: matrix 1045 rows 1244 cols
[2022-06-04 09:36:28] [INFO ] Computed 548 place invariants in 1 ms
[2022-06-04 09:36:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-04 09:36:29] [INFO ] Implicit Places using invariants and state equation in 1294 ms returned []
Implicit Place search using SMT with State Equation took 1901 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1244/1248 places, 1045/1047 transitions.
// Phase 1: matrix 1045 rows 1244 cols
[2022-06-04 09:36:29] [INFO ] Computed 548 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6679 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 4650 ms. (steps per millisecond=215 ) properties (out of 1) seen :0
// Phase 1: matrix 1045 rows 1244 cols
[2022-06-04 09:36:40] [INFO ] Computed 548 place invariants in 6 ms
[2022-06-04 09:36:40] [INFO ] [Real]Absence check using 548 positive place invariants in 80 ms returned sat
[2022-06-04 09:36:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-04 09:36:41] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2022-06-04 09:36:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-04 09:36:41] [INFO ] [Nat]Absence check using 548 positive place invariants in 82 ms returned sat
[2022-06-04 09:36:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-04 09:36:41] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2022-06-04 09:36:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-04 09:36:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-06-04 09:36:42] [INFO ] Computed and/alt/rep : 1041/2454/1041 causal constraints (skipped 0 transitions) in 48 ms.
[2022-06-04 09:36:59] [INFO ] Added : 1009 causal constraints over 202 iterations in 17428 ms. Result :sat
Minimization took 1917 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 151100 steps, including 1000 resets, run finished after 1037 ms. (steps per millisecond=145 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 1244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1244/1244 places, 1045/1045 transitions.
Applied a total of 0 rules in 25 ms. Remains 1244 /1244 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 1045/1045 transitions.
Starting structural reductions, iteration 0 : 1244/1244 places, 1045/1045 transitions.
Applied a total of 0 rules in 22 ms. Remains 1244 /1244 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
// Phase 1: matrix 1045 rows 1244 cols
[2022-06-04 09:37:02] [INFO ] Computed 548 place invariants in 6 ms
[2022-06-04 09:37:03] [INFO ] Implicit Places using invariants in 592 ms returned []
// Phase 1: matrix 1045 rows 1244 cols
[2022-06-04 09:37:03] [INFO ] Computed 548 place invariants in 1 ms
[2022-06-04 09:37:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-04 09:37:04] [INFO ] Implicit Places using invariants and state equation in 1300 ms returned []
Implicit Place search using SMT with State Equation took 1893 ms to find 0 implicit places.
[2022-06-04 09:37:04] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 1045 rows 1244 cols
[2022-06-04 09:37:04] [INFO ] Computed 548 place invariants in 4 ms
[2022-06-04 09:37:04] [INFO ] Dead Transitions using invariants and state equation in 475 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 1045/1045 transitions.
Starting property specific reduction for ShieldPPPt-PT-050B-UpperBounds-07
// Phase 1: matrix 1045 rows 1244 cols
[2022-06-04 09:37:04] [INFO ] Computed 548 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
// Phase 1: matrix 1045 rows 1244 cols
[2022-06-04 09:37:05] [INFO ] Computed 548 place invariants in 5 ms
[2022-06-04 09:37:05] [INFO ] [Real]Absence check using 548 positive place invariants in 79 ms returned sat
[2022-06-04 09:37:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-04 09:37:05] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2022-06-04 09:37:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-04 09:37:05] [INFO ] [Nat]Absence check using 548 positive place invariants in 76 ms returned sat
[2022-06-04 09:37:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-04 09:37:06] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2022-06-04 09:37:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-04 09:37:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-06-04 09:37:06] [INFO ] Computed and/alt/rep : 1041/2454/1041 causal constraints (skipped 0 transitions) in 43 ms.
[2022-06-04 09:37:10] [INFO ] Added : 410 causal constraints over 82 iterations in 4467 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 85300 steps, including 1001 resets, run finished after 610 ms. (steps per millisecond=139 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 1244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1244/1244 places, 1045/1045 transitions.
Applied a total of 0 rules in 23 ms. Remains 1244 /1244 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 1045/1045 transitions.
// Phase 1: matrix 1045 rows 1244 cols
[2022-06-04 09:37:11] [INFO ] Computed 548 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7381 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4755 ms. (steps per millisecond=210 ) properties (out of 1) seen :0
// Phase 1: matrix 1045 rows 1244 cols
[2022-06-04 09:37:23] [INFO ] Computed 548 place invariants in 5 ms
[2022-06-04 09:37:23] [INFO ] [Real]Absence check using 548 positive place invariants in 79 ms returned sat
[2022-06-04 09:37:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-04 09:37:23] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2022-06-04 09:37:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-04 09:37:24] [INFO ] [Nat]Absence check using 548 positive place invariants in 82 ms returned sat
[2022-06-04 09:37:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-04 09:37:24] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2022-06-04 09:37:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-04 09:37:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-06-04 09:37:24] [INFO ] Computed and/alt/rep : 1041/2454/1041 causal constraints (skipped 0 transitions) in 52 ms.
[2022-06-04 09:37:42] [INFO ] Added : 1009 causal constraints over 202 iterations in 17819 ms. Result :sat
Minimization took 1936 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 151100 steps, including 1000 resets, run finished after 964 ms. (steps per millisecond=156 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 1244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1244/1244 places, 1045/1045 transitions.
Applied a total of 0 rules in 25 ms. Remains 1244 /1244 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 1045/1045 transitions.
Starting structural reductions, iteration 0 : 1244/1244 places, 1045/1045 transitions.
Applied a total of 0 rules in 22 ms. Remains 1244 /1244 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
// Phase 1: matrix 1045 rows 1244 cols
[2022-06-04 09:37:45] [INFO ] Computed 548 place invariants in 4 ms
[2022-06-04 09:37:46] [INFO ] Implicit Places using invariants in 609 ms returned []
// Phase 1: matrix 1045 rows 1244 cols
[2022-06-04 09:37:46] [INFO ] Computed 548 place invariants in 2 ms
[2022-06-04 09:37:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-04 09:37:47] [INFO ] Implicit Places using invariants and state equation in 1295 ms returned []
Implicit Place search using SMT with State Equation took 1910 ms to find 0 implicit places.
[2022-06-04 09:37:47] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 1045 rows 1244 cols
[2022-06-04 09:37:47] [INFO ] Computed 548 place invariants in 3 ms
[2022-06-04 09:37:47] [INFO ] Dead Transitions using invariants and state equation in 513 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 1045/1045 transitions.
Ending property specific reduction for ShieldPPPt-PT-050B-UpperBounds-07 in 43007 ms.
[2022-06-04 09:37:48] [INFO ] Flatten gal took : 145 ms
[2022-06-04 09:37:48] [INFO ] Applying decomposition
[2022-06-04 09:37:48] [INFO ] Flatten gal took : 76 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3145180143170916195.txt, -o, /tmp/graph3145180143170916195.bin, -w, /tmp/graph3145180143170916195.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3145180143170916195.bin, -l, -1, -v, -w, /tmp/graph3145180143170916195.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-04 09:37:48] [INFO ] Decomposing Gal with order
[2022-06-04 09:37:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-04 09:37:48] [INFO ] Removed a total of 734 redundant transitions.
[2022-06-04 09:37:49] [INFO ] Flatten gal took : 189 ms
[2022-06-04 09:37:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 298 labels/synchronizations in 19 ms.
[2022-06-04 09:37:49] [INFO ] Time to serialize gal into /tmp/UpperBounds1252267872952886815.gal : 20 ms
[2022-06-04 09:37:49] [INFO ] Time to serialize properties into /tmp/UpperBounds16547382583156219734.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds1252267872952886815.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds16547382583156219734.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds1252267872952886815.gal -t CGAL -reachable-file /tmp/UpperBounds16547382583156219734.prop --nowitness
Loading property file /tmp/UpperBounds16547382583156219734.prop.
Detected timeout of ITS tools.
[2022-06-04 10:00:20] [INFO ] Applying decomposition
[2022-06-04 10:00:20] [INFO ] Flatten gal took : 417 ms
[2022-06-04 10:00:20] [INFO ] Decomposing Gal with order
[2022-06-04 10:00:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-04 10:00:21] [INFO ] Removed a total of 790 redundant transitions.
[2022-06-04 10:00:22] [INFO ] Flatten gal took : 374 ms
[2022-06-04 10:00:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 1096 labels/synchronizations in 384 ms.
[2022-06-04 10:00:23] [INFO ] Time to serialize gal into /tmp/UpperBounds5336097024340755605.gal : 62 ms
[2022-06-04 10:00:23] [INFO ] Time to serialize properties into /tmp/UpperBounds9151439219542260203.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds5336097024340755605.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds9151439219542260203.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds5336097024340755605.gal -t CGAL -reachable-file /tmp/UpperBounds9151439219542260203.prop --nowitness
Loading property file /tmp/UpperBounds9151439219542260203.prop.
Detected timeout of ITS tools.
[2022-06-04 10:22:50] [INFO ] Flatten gal took : 497 ms
[2022-06-04 10:22:52] [INFO ] Input system was already deterministic with 1045 transitions.
[2022-06-04 10:22:52] [INFO ] Transformed 1244 places.
[2022-06-04 10:22:52] [INFO ] Transformed 1045 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-04 10:22:53] [INFO ] Time to serialize gal into /tmp/UpperBounds10363666857290029123.gal : 14 ms
[2022-06-04 10:22:53] [INFO ] Time to serialize properties into /tmp/UpperBounds3348695312383134632.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds10363666857290029123.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds3348695312383134632.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds10363666857290029123.gal -t CGAL -reachable-file /tmp/UpperBounds3348695312383134632.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds3348695312383134632.prop.

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="ShieldPPPt-PT-050B"
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 ShieldPPPt-PT-050B, 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 r233-tall-165286037400256"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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