fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r178-tajo-162089415300115
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for QuasiCertifProtocol-PT-32

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1220.716 257249.00 291329.00 1327.00 1 1 33 33 33 33 1 1089 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089415300115.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 QuasiCertifProtocol-PT-32, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415300115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.7M
-rw-r--r-- 1 mcc users 863K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.0M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 86K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 507K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 24K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Mar 27 10:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K Mar 27 10:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 25 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 25 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 41K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 QuasiCertifProtocol-PT-32-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621236583360

Running Version 0
[2021-05-17 07:29:45] [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-17 07:29:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 07:29:45] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2021-05-17 07:29:45] [INFO ] Transformed 3806 places.
[2021-05-17 07:29:45] [INFO ] Transformed 506 transitions.
[2021-05-17 07:29:45] [INFO ] Parsed PT model containing 3806 places and 506 transitions in 237 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 30 ms.
// Phase 1: matrix 506 rows 3806 cols
[2021-05-17 07:29:45] [INFO ] Computed 3301 place invariants in 197 ms
Incomplete random walk after 10000 steps, including 268 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 16) seen :23
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :20
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :23
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :18
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :28
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :21
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 16) seen :24
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :20
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 16) seen :19
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :20
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :21
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :18
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :19
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :19
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :17
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 16) seen :19
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 16) seen :20
// Phase 1: matrix 506 rows 3806 cols
[2021-05-17 07:29:47] [INFO ] Computed 3301 place invariants in 192 ms
[2021-05-17 07:29:47] [INFO ] [Real]Absence check using 3 positive place invariants in 64 ms returned sat
[2021-05-17 07:29:48] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 758 ms returned sat
[2021-05-17 07:29:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:29:49] [INFO ] [Real]Absence check using state equation in 1102 ms returned sat
[2021-05-17 07:29:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:29:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 62 ms returned sat
[2021-05-17 07:29:51] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 645 ms returned sat
[2021-05-17 07:29:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:29:52] [INFO ] [Nat]Absence check using state equation in 1066 ms returned sat
[2021-05-17 07:29:52] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 84 ms.
[2021-05-17 07:29:54] [INFO ] Added : 95 causal constraints over 19 iterations in 2530 ms. Result :unknown
[2021-05-17 07:29:55] [INFO ] [Real]Absence check using 3 positive place invariants in 53 ms returned sat
[2021-05-17 07:29:56] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 749 ms returned sat
[2021-05-17 07:29:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:29:57] [INFO ] [Real]Absence check using state equation in 1085 ms returned sat
[2021-05-17 07:29:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:29:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 34 ms returned sat
[2021-05-17 07:29:58] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 647 ms returned sat
[2021-05-17 07:29:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:29:59] [INFO ] [Nat]Absence check using state equation in 1075 ms returned sat
[2021-05-17 07:29:59] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 87 ms.
[2021-05-17 07:30:01] [INFO ] Added : 67 causal constraints over 14 iterations in 2064 ms. Result :sat
Minimization took 281 ms.
[2021-05-17 07:30:02] [INFO ] [Real]Absence check using 3 positive place invariants in 39 ms returned sat
[2021-05-17 07:30:03] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 870 ms returned sat
[2021-05-17 07:30:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:30:04] [INFO ] [Real]Absence check using state equation in 1157 ms returned sat
[2021-05-17 07:30:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:30:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 43 ms returned sat
[2021-05-17 07:30:05] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 653 ms returned sat
[2021-05-17 07:30:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:30:07] [INFO ] [Nat]Absence check using state equation in 1185 ms returned sat
[2021-05-17 07:30:07] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 70 ms.
[2021-05-17 07:30:08] [INFO ] Added : 36 causal constraints over 8 iterations in 1337 ms. Result :sat
Minimization took 308 ms.
[2021-05-17 07:30:09] [INFO ] [Real]Absence check using 3 positive place invariants in 40 ms returned sat
[2021-05-17 07:30:10] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 851 ms returned sat
[2021-05-17 07:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:30:11] [INFO ] [Real]Absence check using state equation in 1041 ms returned sat
[2021-05-17 07:30:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:30:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 27 ms returned sat
[2021-05-17 07:30:12] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 800 ms returned sat
[2021-05-17 07:30:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:30:13] [INFO ] [Nat]Absence check using state equation in 1178 ms returned sat
[2021-05-17 07:30:13] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 85 ms.
[2021-05-17 07:30:14] [INFO ] Added : 34 causal constraints over 7 iterations in 1101 ms. Result :sat
Minimization took 395 ms.
[2021-05-17 07:30:15] [INFO ] [Real]Absence check using 3 positive place invariants in 73 ms returned sat
[2021-05-17 07:30:16] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 762 ms returned sat
[2021-05-17 07:30:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:30:17] [INFO ] [Real]Absence check using state equation in 1277 ms returned sat
[2021-05-17 07:30:18] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 58 ms.
[2021-05-17 07:30:24] [INFO ] Deduced a trap composed of 5 places in 4094 ms of which 7 ms to minimize.
[2021-05-17 07:30:24] [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:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-17 07:30:24] [INFO ] [Real]Absence check using 3 positive place invariants in 64 ms returned sat
[2021-05-17 07:30:25] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 976 ms returned sat
[2021-05-17 07:30:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:30:27] [INFO ] [Real]Absence check using state equation in 1384 ms returned sat
[2021-05-17 07:30:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:30:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 31 ms returned sat
[2021-05-17 07:30:28] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 823 ms returned sat
[2021-05-17 07:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:30:29] [INFO ] [Nat]Absence check using state equation in 1266 ms returned sat
[2021-05-17 07:30:30] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 43 ms.
[2021-05-17 07:30:36] [INFO ] Deduced a trap composed of 5 places in 3670 ms of which 4 ms to minimize.
[2021-05-17 07:30:36] [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.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-17 07:30:36] [INFO ] [Real]Absence check using 3 positive place invariants in 37 ms returned sat
[2021-05-17 07:30:37] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 824 ms returned sat
[2021-05-17 07:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:30:38] [INFO ] [Real]Absence check using state equation in 1094 ms returned sat
[2021-05-17 07:30:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:30:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 39 ms returned sat
[2021-05-17 07:30:39] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 822 ms returned sat
[2021-05-17 07:30:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:30:40] [INFO ] [Nat]Absence check using state equation in 1119 ms returned sat
[2021-05-17 07:30:41] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 49 ms.
[2021-05-17 07:30:42] [INFO ] Added : 67 causal constraints over 14 iterations in 1158 ms. Result :sat
Minimization took 167 ms.
[2021-05-17 07:30:42] [INFO ] [Real]Absence check using 3 positive place invariants in 42 ms returned sat
[2021-05-17 07:30:43] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 939 ms returned sat
[2021-05-17 07:30:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:30:46] [INFO ] [Real]Absence check using state equation in 2237 ms returned sat
[2021-05-17 07:30:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:30:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 28 ms returned sat
[2021-05-17 07:30:47] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 773 ms returned sat
[2021-05-17 07:30:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:30:49] [INFO ] [Nat]Absence check using state equation in 2300 ms returned sat
[2021-05-17 07:30:49] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 95 ms.
[2021-05-17 07:30:54] [INFO ] Deduced a trap composed of 5 places in 3767 ms of which 12 ms to minimize.
[2021-05-17 07:30:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-17 07:30:55] [INFO ] [Real]Absence check using 3 positive place invariants in 25 ms returned sat
[2021-05-17 07:30:55] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 637 ms returned sat
[2021-05-17 07:30:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:30:56] [INFO ] [Real]Absence check using state equation in 1078 ms returned sat
[2021-05-17 07:30:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:30:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 29 ms returned sat
[2021-05-17 07:30:58] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 631 ms returned sat
[2021-05-17 07:30:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:30:59] [INFO ] [Nat]Absence check using state equation in 1044 ms returned sat
[2021-05-17 07:30:59] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 33 ms.
[2021-05-17 07:31:01] [INFO ] Added : 102 causal constraints over 21 iterations in 2230 ms. Result :sat
Minimization took 246 ms.
[2021-05-17 07:31:02] [INFO ] [Real]Absence check using 3 positive place invariants in 36 ms returned sat
[2021-05-17 07:31:02] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 803 ms returned sat
[2021-05-17 07:31:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:03] [INFO ] [Real]Absence check using state equation in 1030 ms returned sat
[2021-05-17 07:31:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:31:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 28 ms returned sat
[2021-05-17 07:31:04] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 577 ms returned sat
[2021-05-17 07:31:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:06] [INFO ] [Nat]Absence check using state equation in 1031 ms returned sat
[2021-05-17 07:31:06] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 50 ms.
[2021-05-17 07:31:09] [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 9
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-17 07:31:09] [INFO ] [Real]Absence check using 3 positive place invariants in 39 ms returned sat
[2021-05-17 07:31:10] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 836 ms returned sat
[2021-05-17 07:31:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:11] [INFO ] [Real]Absence check using state equation in 1043 ms returned sat
[2021-05-17 07:31:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:31:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 26 ms returned sat
[2021-05-17 07:31:12] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 602 ms returned sat
[2021-05-17 07:31:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:13] [INFO ] [Nat]Absence check using state equation in 1033 ms returned sat
[2021-05-17 07:31:13] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 39 ms.
[2021-05-17 07:31:16] [INFO ] Added : 102 causal constraints over 21 iterations in 2594 ms. Result :sat
Minimization took 267 ms.
[2021-05-17 07:31:16] [INFO ] [Real]Absence check using 3 positive place invariants in 39 ms returned sat
[2021-05-17 07:31:17] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 775 ms returned sat
[2021-05-17 07:31:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:18] [INFO ] [Real]Absence check using state equation in 1019 ms returned sat
[2021-05-17 07:31:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:31:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 27 ms returned sat
[2021-05-17 07:31:19] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 599 ms returned sat
[2021-05-17 07:31:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:20] [INFO ] [Nat]Absence check using state equation in 1016 ms returned sat
[2021-05-17 07:31:20] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 34 ms.
[2021-05-17 07:31:27] [INFO ] Deduced a trap composed of 5 places in 3615 ms of which 2 ms to minimize.
[2021-05-17 07:31:27] [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 11
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-17 07:31:27] [INFO ] [Real]Absence check using 3 positive place invariants in 32 ms returned sat
[2021-05-17 07:31:28] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 587 ms returned sat
[2021-05-17 07:31:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:29] [INFO ] [Real]Absence check using state equation in 1023 ms returned sat
[2021-05-17 07:31:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:31:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 28 ms returned sat
[2021-05-17 07:31:30] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 594 ms returned sat
[2021-05-17 07:31:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:31] [INFO ] [Nat]Absence check using state equation in 1005 ms returned sat
[2021-05-17 07:31:31] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 43 ms.
[2021-05-17 07:31:34] [INFO ] Added : 101 causal constraints over 21 iterations in 2823 ms. Result :sat
Minimization took 205 ms.
[2021-05-17 07:31:35] [INFO ] [Real]Absence check using 3 positive place invariants in 66 ms returned sat
[2021-05-17 07:31:35] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 812 ms returned sat
[2021-05-17 07:31:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:37] [INFO ] [Real]Absence check using state equation in 1056 ms returned sat
[2021-05-17 07:31:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:31:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 26 ms returned sat
[2021-05-17 07:31:37] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 568 ms returned sat
[2021-05-17 07:31:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:38] [INFO ] [Nat]Absence check using state equation in 1016 ms returned sat
[2021-05-17 07:31:39] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 36 ms.
[2021-05-17 07:31:45] [INFO ] Deduced a trap composed of 5 places in 3571 ms of which 3 ms to minimize.
[2021-05-17 07: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 13
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-17 07:31:46] [INFO ] [Real]Absence check using 3 positive place invariants in 35 ms returned sat
[2021-05-17 07:31:46] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 601 ms returned sat
[2021-05-17 07:31:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:47] [INFO ] [Real]Absence check using state equation in 1008 ms returned sat
[2021-05-17 07:31:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:31:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 26 ms returned sat
[2021-05-17 07:31:48] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 596 ms returned sat
[2021-05-17 07:31:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:49] [INFO ] [Nat]Absence check using state equation in 1041 ms returned sat
[2021-05-17 07:31:49] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 33 ms.
[2021-05-17 07:31:56] [INFO ] Deduced a trap composed of 5 places in 3627 ms of which 7 ms to minimize.
[2021-05-17 07:31: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 14
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-17 07:31:56] [INFO ] [Real]Absence check using 3 positive place invariants in 38 ms returned sat
[2021-05-17 07:31:57] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 774 ms returned sat
[2021-05-17 07:31:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:31:58] [INFO ] [Real]Absence check using state equation in 1085 ms returned sat
[2021-05-17 07:31:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:31:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 38 ms returned sat
[2021-05-17 07:31:59] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 641 ms returned sat
[2021-05-17 07:31:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:32:00] [INFO ] [Nat]Absence check using state equation in 1084 ms returned sat
[2021-05-17 07:32:01] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 48 ms.
[2021-05-17 07:32:07] [INFO ] Deduced a trap composed of 5 places in 3660 ms of which 3 ms to minimize.
[2021-05-17 07:32:07] [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 15
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)
Current structural bounds on expressions (after SMT) : [1, 1, -1, -1, 1089, 1089, 1, -1, -1, -1, -1, -1, 33, -1, -1, 33] Max seen :[0, 0, 0, 28, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 10500 steps, including 119 resets, run finished after 218 ms. (steps per millisecond=48 ) properties (out of 16) seen :70 could not realise parikh vector
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 10500 steps, including 118 resets, run finished after 352 ms. (steps per millisecond=29 ) properties (out of 14) seen :70 could not realise parikh vector
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 7000 steps, including 100 resets, run finished after 217 ms. (steps per millisecond=32 ) properties (out of 13) seen :66 could not realise parikh vector
Incomplete Parikh walk after 3500 steps, including 95 resets, run finished after 107 ms. (steps per millisecond=32 ) properties (out of 13) seen :33 could not realise parikh vector
Incomplete Parikh walk after 3600 steps, including 95 resets, run finished after 143 ms. (steps per millisecond=25 ) properties (out of 13) seen :66 could not realise parikh vector
Incomplete Parikh walk after 7000 steps, including 100 resets, run finished after 208 ms. (steps per millisecond=33 ) properties (out of 13) seen :66 could not realise parikh vector
Incomplete Parikh walk after 10500 steps, including 109 resets, run finished after 310 ms. (steps per millisecond=33 ) properties (out of 13) seen :70 could not realise parikh vector
Support contains 1226 out of 3806 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3735 are kept as prefixes of interest. Removing 71 places using SCC suffix rule.45 ms
Discarding 71 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 297 rules applied. Total rules applied 298 place count 3669 transition count 273
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 328 place count 3639 transition count 273
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 328 place count 3639 transition count 270
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 334 place count 3636 transition count 270
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 2 ms
Ensure Unique test removed 924 places
Reduce places removed 953 places and 0 transitions.
Iterating global reduction 2 with 982 rules applied. Total rules applied 1316 place count 2683 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1317 place count 2682 transition count 240
Ensure Unique test removed 33 places
Iterating post reduction 2 with 33 rules applied. Total rules applied 1350 place count 2649 transition count 240
Applied a total of 1350 rules in 800 ms. Remains 2649 /3806 variables (removed 1157) and now considering 240/506 (removed 266) transitions.
Finished structural reductions, in 1 iterations. Remains : 2649/3806 places, 240/506 transitions.
// Phase 1: matrix 240 rows 2649 cols
[2021-05-17 07:32:09] [INFO ] Computed 2409 place invariants in 34 ms
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Interrupted random walk after 777570 steps, including 6241 resets, run timeout after 30001 ms. (steps per millisecond=25 ) properties seen :{0=33, 1=33, 2=20, 4=1089, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1}
Interrupted Best-First random walk after 647843 steps, including 280 resets, run timeout after 5001 ms. (steps per millisecond=129 ) properties seen :{0=33, 1=33, 2=15, 4=1089, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1}
Interrupted Best-First random walk after 612596 steps, including 240 resets, run timeout after 5001 ms. (steps per millisecond=122 ) properties seen :{0=33, 1=33, 2=17, 4=1089, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1}
Interrupted Best-First random walk after 812929 steps, including 279 resets, run timeout after 5001 ms. (steps per millisecond=162 ) properties seen :{0=33, 1=33, 2=33, 4=1089, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1}
Interrupted Best-First random walk after 653512 steps, including 277 resets, run timeout after 5001 ms. (steps per millisecond=130 ) properties seen :{0=33, 1=33, 2=16, 4=1089, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1}
Interrupted Best-First random walk after 154545 steps, including 74 resets, run timeout after 5001 ms. (steps per millisecond=30 ) properties seen :{0=33, 1=33, 2=1, 4=1089, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1}
Interrupted Best-First random walk after 739210 steps, including 319 resets, run timeout after 5001 ms. (steps per millisecond=147 ) properties seen :{0=33, 1=33, 2=16, 4=1089, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1}
Interrupted Best-First random walk after 730376 steps, including 314 resets, run timeout after 5001 ms. (steps per millisecond=146 ) properties seen :{0=33, 1=33, 2=17, 4=1089, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1}
Interrupted Best-First random walk after 735296 steps, including 318 resets, run timeout after 5001 ms. (steps per millisecond=147 ) properties seen :{0=33, 1=33, 2=17, 4=1089, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1}
Interrupted Best-First random walk after 725176 steps, including 303 resets, run timeout after 5001 ms. (steps per millisecond=145 ) properties seen :{0=33, 1=33, 2=16, 4=1089, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1}
Interrupted Best-First random walk after 702447 steps, including 285 resets, run timeout after 5001 ms. (steps per millisecond=140 ) properties seen :{0=33, 1=33, 2=18, 4=1089, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1}
Interrupted Best-First random walk after 681192 steps, including 291 resets, run timeout after 5001 ms. (steps per millisecond=136 ) properties seen :{0=33, 1=33, 2=18, 4=1089, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1}
Interrupted Best-First random walk after 723005 steps, including 311 resets, run timeout after 5001 ms. (steps per millisecond=144 ) properties seen :{0=33, 1=33, 2=16, 4=1089, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1}
// Phase 1: matrix 240 rows 2649 cols
[2021-05-17 07:33:39] [INFO ] Computed 2409 place invariants in 38 ms
[2021-05-17 07:33:40] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2021-05-17 07:33:40] [INFO ] [Real]Absence check using 1 positive and 2408 generalized place invariants in 510 ms returned unsat
[2021-05-17 07:33:41] [INFO ] [Real]Absence check using 1 positive place invariants in 55 ms returned sat
[2021-05-17 07:33:41] [INFO ] [Real]Absence check using 1 positive and 2408 generalized place invariants in 569 ms returned unsat
[2021-05-17 07:33:41] [INFO ] [Real]Absence check using 1 positive place invariants in 24 ms returned sat
[2021-05-17 07:33:42] [INFO ] [Real]Absence check using 1 positive and 2408 generalized place invariants in 376 ms returned sat
[2021-05-17 07:33:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:33:42] [INFO ] [Real]Absence check using state equation in 298 ms returned unsat
[2021-05-17 07:33:42] [INFO ] [Real]Absence check using 1 positive place invariants in 26 ms returned sat
[2021-05-17 07:33:43] [INFO ] [Real]Absence check using 1 positive and 2408 generalized place invariants in 697 ms returned sat
[2021-05-17 07:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:33:44] [INFO ] [Real]Absence check using state equation in 766 ms returned sat
[2021-05-17 07:33:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:33:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 26 ms returned sat
[2021-05-17 07:33:45] [INFO ] [Nat]Absence check using 1 positive and 2408 generalized place invariants in 669 ms returned sat
[2021-05-17 07:33:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:33:46] [INFO ] [Nat]Absence check using state equation in 693 ms returned sat
[2021-05-17 07:33:46] [INFO ] Computed and/alt/rep : 139/271/139 causal constraints (skipped 68 transitions) in 21 ms.
[2021-05-17 07:33:47] [INFO ] Added : 105 causal constraints over 21 iterations in 1394 ms. Result :sat
Minimization took 449 ms.
[2021-05-17 07:33:48] [INFO ] [Real]Absence check using 1 positive place invariants in 25 ms returned sat
[2021-05-17 07:33:48] [INFO ] [Real]Absence check using 1 positive and 2408 generalized place invariants in 575 ms returned sat
[2021-05-17 07:33:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:33:49] [INFO ] [Real]Absence check using state equation in 675 ms returned unsat
[2021-05-17 07:33:50] [INFO ] [Real]Absence check using 1 positive place invariants in 24 ms returned sat
[2021-05-17 07:33:50] [INFO ] [Real]Absence check using 1 positive and 2408 generalized place invariants in 255 ms returned unsat
[2021-05-17 07:33:50] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2021-05-17 07:33:50] [INFO ] [Real]Absence check using 1 positive and 2408 generalized place invariants in 388 ms returned sat
[2021-05-17 07:33:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:33:50] [INFO ] [Real]Absence check using state equation in 57 ms returned unsat
[2021-05-17 07:33:51] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2021-05-17 07:33:51] [INFO ] [Real]Absence check using 1 positive and 2408 generalized place invariants in 407 ms returned sat
[2021-05-17 07:33:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:33:51] [INFO ] [Real]Absence check using state equation in 66 ms returned unsat
[2021-05-17 07:33:51] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2021-05-17 07:33:52] [INFO ] [Real]Absence check using 1 positive and 2408 generalized place invariants in 393 ms returned sat
[2021-05-17 07:33:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:33:53] [INFO ] [Real]Absence check using state equation in 955 ms returned unsat
[2021-05-17 07:33:53] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2021-05-17 07:33:53] [INFO ] [Real]Absence check using 1 positive and 2408 generalized place invariants in 254 ms returned unsat
[2021-05-17 07:33:54] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2021-05-17 07:33:54] [INFO ] [Real]Absence check using 1 positive and 2408 generalized place invariants in 415 ms returned sat
[2021-05-17 07:33:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:33:54] [INFO ] [Real]Absence check using state equation in 52 ms returned unsat
[2021-05-17 07:33:54] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2021-05-17 07:33:55] [INFO ] [Real]Absence check using 1 positive and 2408 generalized place invariants in 387 ms returned sat
[2021-05-17 07:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:33:55] [INFO ] [Real]Absence check using state equation in 325 ms returned unsat
Current structural bounds on expressions (after SMT) : [33, 33, 33, 1089, 1089, 1, 1, 1, 1, 1, 1, 1] Max seen :[33, 33, 33, 0, 1089, 1, 1, 1, 1, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-07 1089 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-04 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-03 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-02 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 20600 steps, including 104 resets, run finished after 366 ms. (steps per millisecond=56 ) properties (out of 1) seen :33 could not realise parikh vector
Support contains 33 out of 2649 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2649/2649 places, 240/240 transitions.
Graph (complete) has 12580 edges and 2649 vertex of which 2648 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 2648 transition count 171
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 105 place count 2613 transition count 171
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 105 place count 2613 transition count 105
Deduced a syphon composed of 66 places in 1 ms
Ensure Unique test removed 66 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 303 place count 2481 transition count 105
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 304 place count 2481 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 305 place count 2480 transition count 104
Renaming transitions due to excessive name length > 1024 char.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 132 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 445 place count 2344 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 446 place count 2343 transition count 99
Ensure Unique test removed 33 places
Iterating post reduction 4 with 33 rules applied. Total rules applied 479 place count 2310 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 480 place count 2309 transition count 98
Ensure Unique test removed 33 places
Iterating post reduction 5 with 33 rules applied. Total rules applied 513 place count 2276 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 514 place count 2275 transition count 97
Ensure Unique test removed 33 places
Iterating post reduction 6 with 33 rules applied. Total rules applied 547 place count 2242 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 548 place count 2241 transition count 96
Ensure Unique test removed 33 places
Iterating post reduction 7 with 33 rules applied. Total rules applied 581 place count 2208 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 582 place count 2207 transition count 95
Ensure Unique test removed 33 places
Iterating post reduction 8 with 33 rules applied. Total rules applied 615 place count 2174 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 616 place count 2173 transition count 94
Ensure Unique test removed 33 places
Iterating post reduction 9 with 33 rules applied. Total rules applied 649 place count 2140 transition count 94
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 650 place count 2139 transition count 93
Ensure Unique test removed 33 places
Iterating post reduction 10 with 33 rules applied. Total rules applied 683 place count 2106 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 684 place count 2105 transition count 92
Ensure Unique test removed 33 places
Iterating post reduction 11 with 33 rules applied. Total rules applied 717 place count 2072 transition count 92
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 718 place count 2071 transition count 91
Ensure Unique test removed 33 places
Iterating post reduction 12 with 33 rules applied. Total rules applied 751 place count 2038 transition count 91
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 752 place count 2037 transition count 90
Ensure Unique test removed 33 places
Iterating post reduction 13 with 33 rules applied. Total rules applied 785 place count 2004 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 786 place count 2003 transition count 89
Ensure Unique test removed 33 places
Iterating post reduction 14 with 33 rules applied. Total rules applied 819 place count 1970 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 820 place count 1969 transition count 88
Ensure Unique test removed 33 places
Iterating post reduction 15 with 33 rules applied. Total rules applied 853 place count 1936 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 854 place count 1935 transition count 87
Ensure Unique test removed 33 places
Iterating post reduction 16 with 33 rules applied. Total rules applied 887 place count 1902 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 888 place count 1901 transition count 86
Ensure Unique test removed 33 places
Iterating post reduction 17 with 33 rules applied. Total rules applied 921 place count 1868 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 922 place count 1867 transition count 85
Ensure Unique test removed 33 places
Iterating post reduction 18 with 33 rules applied. Total rules applied 955 place count 1834 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 956 place count 1833 transition count 84
Ensure Unique test removed 33 places
Iterating post reduction 19 with 33 rules applied. Total rules applied 989 place count 1800 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 990 place count 1799 transition count 83
Ensure Unique test removed 33 places
Iterating post reduction 20 with 33 rules applied. Total rules applied 1023 place count 1766 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 1024 place count 1765 transition count 82
Ensure Unique test removed 33 places
Iterating post reduction 21 with 33 rules applied. Total rules applied 1057 place count 1732 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 22 with 1 rules applied. Total rules applied 1058 place count 1731 transition count 81
Ensure Unique test removed 33 places
Iterating post reduction 22 with 33 rules applied. Total rules applied 1091 place count 1698 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 1092 place count 1697 transition count 80
Ensure Unique test removed 33 places
Iterating post reduction 23 with 33 rules applied. Total rules applied 1125 place count 1664 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 24 with 1 rules applied. Total rules applied 1126 place count 1663 transition count 79
Ensure Unique test removed 33 places
Iterating post reduction 24 with 33 rules applied. Total rules applied 1159 place count 1630 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 25 with 1 rules applied. Total rules applied 1160 place count 1629 transition count 78
Ensure Unique test removed 33 places
Iterating post reduction 25 with 33 rules applied. Total rules applied 1193 place count 1596 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 26 with 1 rules applied. Total rules applied 1194 place count 1595 transition count 77
Ensure Unique test removed 33 places
Iterating post reduction 26 with 33 rules applied. Total rules applied 1227 place count 1562 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 27 with 1 rules applied. Total rules applied 1228 place count 1561 transition count 76
Ensure Unique test removed 33 places
Iterating post reduction 27 with 33 rules applied. Total rules applied 1261 place count 1528 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 28 with 1 rules applied. Total rules applied 1262 place count 1527 transition count 75
Ensure Unique test removed 33 places
Iterating post reduction 28 with 33 rules applied. Total rules applied 1295 place count 1494 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 29 with 1 rules applied. Total rules applied 1296 place count 1493 transition count 74
Ensure Unique test removed 33 places
Iterating post reduction 29 with 33 rules applied. Total rules applied 1329 place count 1460 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 30 with 1 rules applied. Total rules applied 1330 place count 1459 transition count 73
Ensure Unique test removed 33 places
Iterating post reduction 30 with 33 rules applied. Total rules applied 1363 place count 1426 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 31 with 1 rules applied. Total rules applied 1364 place count 1425 transition count 72
Ensure Unique test removed 33 places
Iterating post reduction 31 with 33 rules applied. Total rules applied 1397 place count 1392 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 32 with 1 rules applied. Total rules applied 1398 place count 1391 transition count 71
Ensure Unique test removed 33 places
Iterating post reduction 32 with 33 rules applied. Total rules applied 1431 place count 1358 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 33 with 1 rules applied. Total rules applied 1432 place count 1357 transition count 70
Ensure Unique test removed 33 places
Iterating post reduction 33 with 33 rules applied. Total rules applied 1465 place count 1324 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 34 with 1 rules applied. Total rules applied 1466 place count 1323 transition count 69
Ensure Unique test removed 33 places
Iterating post reduction 34 with 33 rules applied. Total rules applied 1499 place count 1290 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 35 with 1 rules applied. Total rules applied 1500 place count 1289 transition count 68
Ensure Unique test removed 33 places
Iterating post reduction 35 with 33 rules applied. Total rules applied 1533 place count 1256 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 36 with 1 rules applied. Total rules applied 1534 place count 1255 transition count 67
Ensure Unique test removed 33 places
Iterating post reduction 36 with 33 rules applied. Total rules applied 1567 place count 1222 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 37 with 1 rules applied. Total rules applied 1568 place count 1221 transition count 66
Ensure Unique test removed 33 places
Iterating post reduction 37 with 33 rules applied. Total rules applied 1601 place count 1188 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 38 with 1 rules applied. Total rules applied 1602 place count 1187 transition count 65
Ensure Unique test removed 33 places
Iterating post reduction 38 with 33 rules applied. Total rules applied 1635 place count 1154 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 39 with 1 rules applied. Total rules applied 1636 place count 1153 transition count 64
Ensure Unique test removed 33 places
Iterating post reduction 39 with 33 rules applied. Total rules applied 1669 place count 1120 transition count 64
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 40 with 1 rules applied. Total rules applied 1670 place count 1119 transition count 63
Ensure Unique test removed 33 places
Iterating post reduction 40 with 33 rules applied. Total rules applied 1703 place count 1086 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 41 with 1 rules applied. Total rules applied 1704 place count 1085 transition count 62
Ensure Unique test removed 33 places
Iterating post reduction 41 with 33 rules applied. Total rules applied 1737 place count 1052 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 42 with 1 rules applied. Total rules applied 1738 place count 1051 transition count 61
Ensure Unique test removed 33 places
Iterating post reduction 42 with 33 rules applied. Total rules applied 1771 place count 1018 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 43 with 1 rules applied. Total rules applied 1772 place count 1017 transition count 60
Ensure Unique test removed 33 places
Iterating post reduction 43 with 33 rules applied. Total rules applied 1805 place count 984 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 44 with 1 rules applied. Total rules applied 1806 place count 983 transition count 59
Ensure Unique test removed 33 places
Iterating post reduction 44 with 33 rules applied. Total rules applied 1839 place count 950 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 45 with 1 rules applied. Total rules applied 1840 place count 949 transition count 58
Ensure Unique test removed 33 places
Iterating post reduction 45 with 33 rules applied. Total rules applied 1873 place count 916 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 46 with 1 rules applied. Total rules applied 1874 place count 915 transition count 57
Ensure Unique test removed 33 places
Iterating post reduction 46 with 33 rules applied. Total rules applied 1907 place count 882 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 47 with 1 rules applied. Total rules applied 1908 place count 881 transition count 56
Ensure Unique test removed 33 places
Iterating post reduction 47 with 33 rules applied. Total rules applied 1941 place count 848 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 48 with 1 rules applied. Total rules applied 1942 place count 847 transition count 55
Ensure Unique test removed 33 places
Iterating post reduction 48 with 33 rules applied. Total rules applied 1975 place count 814 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 49 with 1 rules applied. Total rules applied 1976 place count 813 transition count 54
Ensure Unique test removed 33 places
Iterating post reduction 49 with 33 rules applied. Total rules applied 2009 place count 780 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 50 with 1 rules applied. Total rules applied 2010 place count 779 transition count 53
Ensure Unique test removed 33 places
Iterating post reduction 50 with 33 rules applied. Total rules applied 2043 place count 746 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 51 with 1 rules applied. Total rules applied 2044 place count 745 transition count 52
Ensure Unique test removed 33 places
Iterating post reduction 51 with 33 rules applied. Total rules applied 2077 place count 712 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 52 with 1 rules applied. Total rules applied 2078 place count 711 transition count 51
Ensure Unique test removed 33 places
Iterating post reduction 52 with 33 rules applied. Total rules applied 2111 place count 678 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 53 with 1 rules applied. Total rules applied 2112 place count 677 transition count 50
Ensure Unique test removed 33 places
Iterating post reduction 53 with 33 rules applied. Total rules applied 2145 place count 644 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 54 with 1 rules applied. Total rules applied 2146 place count 643 transition count 49
Ensure Unique test removed 33 places
Iterating post reduction 54 with 33 rules applied. Total rules applied 2179 place count 610 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 55 with 1 rules applied. Total rules applied 2180 place count 609 transition count 48
Ensure Unique test removed 33 places
Iterating post reduction 55 with 33 rules applied. Total rules applied 2213 place count 576 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 56 with 1 rules applied. Total rules applied 2214 place count 575 transition count 47
Ensure Unique test removed 33 places
Iterating post reduction 56 with 33 rules applied. Total rules applied 2247 place count 542 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 57 with 1 rules applied. Total rules applied 2248 place count 541 transition count 46
Ensure Unique test removed 33 places
Iterating post reduction 57 with 33 rules applied. Total rules applied 2281 place count 508 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 58 with 1 rules applied. Total rules applied 2282 place count 507 transition count 45
Ensure Unique test removed 33 places
Iterating post reduction 58 with 33 rules applied. Total rules applied 2315 place count 474 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 59 with 1 rules applied. Total rules applied 2316 place count 473 transition count 44
Ensure Unique test removed 33 places
Iterating post reduction 59 with 33 rules applied. Total rules applied 2349 place count 440 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 60 with 1 rules applied. Total rules applied 2350 place count 439 transition count 43
Ensure Unique test removed 33 places
Iterating post reduction 60 with 33 rules applied. Total rules applied 2383 place count 406 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 61 with 1 rules applied. Total rules applied 2384 place count 405 transition count 42
Ensure Unique test removed 33 places
Iterating post reduction 61 with 33 rules applied. Total rules applied 2417 place count 372 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 62 with 1 rules applied. Total rules applied 2418 place count 371 transition count 41
Ensure Unique test removed 33 places
Iterating post reduction 62 with 33 rules applied. Total rules applied 2451 place count 338 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 63 with 1 rules applied. Total rules applied 2452 place count 337 transition count 40
Ensure Unique test removed 33 places
Iterating post reduction 63 with 33 rules applied. Total rules applied 2485 place count 304 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 64 with 1 rules applied. Total rules applied 2486 place count 303 transition count 39
Ensure Unique test removed 33 places
Iterating post reduction 64 with 33 rules applied. Total rules applied 2519 place count 270 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 65 with 1 rules applied. Total rules applied 2520 place count 269 transition count 38
Ensure Unique test removed 33 places
Iterating post reduction 65 with 33 rules applied. Total rules applied 2553 place count 236 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 66 with 1 rules applied. Total rules applied 2554 place count 235 transition count 37
Ensure Unique test removed 33 places
Iterating post reduction 66 with 33 rules applied. Total rules applied 2587 place count 202 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 67 with 1 rules applied. Total rules applied 2588 place count 201 transition count 36
Ensure Unique test removed 33 places
Iterating post reduction 67 with 33 rules applied. Total rules applied 2621 place count 168 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 68 with 1 rules applied. Total rules applied 2622 place count 167 transition count 35
Ensure Unique test removed 33 places
Iterating post reduction 68 with 33 rules applied. Total rules applied 2655 place count 134 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 69 with 1 rules applied. Total rules applied 2656 place count 133 transition count 34
Ensure Unique test removed 33 places
Iterating post reduction 69 with 33 rules applied. Total rules applied 2689 place count 100 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 70 with 1 rules applied. Total rules applied 2690 place count 99 transition count 33
Ensure Unique test removed 33 places
Iterating post reduction 70 with 33 rules applied. Total rules applied 2723 place count 66 transition count 33
Applied a total of 2723 rules in 2981 ms. Remains 66 /2649 variables (removed 2583) and now considering 33/240 (removed 207) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/2649 places, 33/240 transitions.
// Phase 1: matrix 33 rows 66 cols
[2021-05-17 07:33:58] [INFO ] Computed 33 place invariants in 0 ms
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-05 33 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000000 steps, including 29411 resets, run finished after 1332 ms. (steps per millisecond=750 ) properties (out of 0) seen :0
All properties solved without resorting to model-checking.

BK_STOP 1621236840609

--------------------
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="QuasiCertifProtocol-PT-32"
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 QuasiCertifProtocol-PT-32, 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 r178-tajo-162089415300115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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