Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r273-smll-162123879800211.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 itstools
Input is Vasy2003-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r273-smll-162123879800211
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 14:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 14:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 05:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 26 05:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 207K May 5 16:52 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Vasy2003-PT-none-UpperBounds-00
FORMULA_NAME Vasy2003-PT-none-UpperBounds-01
FORMULA_NAME Vasy2003-PT-none-UpperBounds-02
FORMULA_NAME Vasy2003-PT-none-UpperBounds-03
FORMULA_NAME Vasy2003-PT-none-UpperBounds-04
FORMULA_NAME Vasy2003-PT-none-UpperBounds-05
FORMULA_NAME Vasy2003-PT-none-UpperBounds-06
FORMULA_NAME Vasy2003-PT-none-UpperBounds-07
FORMULA_NAME Vasy2003-PT-none-UpperBounds-08
FORMULA_NAME Vasy2003-PT-none-UpperBounds-09
FORMULA_NAME Vasy2003-PT-none-UpperBounds-10
FORMULA_NAME Vasy2003-PT-none-UpperBounds-11
FORMULA_NAME Vasy2003-PT-none-UpperBounds-12
FORMULA_NAME Vasy2003-PT-none-UpperBounds-13
FORMULA_NAME Vasy2003-PT-none-UpperBounds-14
FORMULA_NAME Vasy2003-PT-none-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621477899994

Running Version 0
[2021-05-20 02:31:43] [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-20 02:31:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-20 02:31:43] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2021-05-20 02:31:43] [INFO ] Transformed 485 places.
[2021-05-20 02:31:43] [INFO ] Transformed 776 transitions.
[2021-05-20 02:31:43] [INFO ] Found NUPN structural information;
[2021-05-20 02:31:43] [INFO ] Parsed PT model containing 485 places and 776 transitions in 324 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
Normalized transition count is 696 out of 752 initially.
// Phase 1: matrix 696 rows 485 cols
[2021-05-20 02:31:43] [INFO ] Computed 66 place invariants in 52 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 16) seen :7
FORMULA Vasy2003-PT-none-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
[2021-05-20 02:31:44] [INFO ] Flow matrix only has 696 transitions (discarded 56 similar events)
// Phase 1: matrix 696 rows 485 cols
[2021-05-20 02:31:44] [INFO ] Computed 66 place invariants in 15 ms
[2021-05-20 02:31:44] [INFO ] [Real]Absence check using 59 positive place invariants in 49 ms returned sat
[2021-05-20 02:31:44] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2021-05-20 02:31:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 02:31:45] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2021-05-20 02:31:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 02:31:45] [INFO ] [Nat]Absence check using 59 positive place invariants in 43 ms returned sat
[2021-05-20 02:31:45] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 12 ms returned sat
[2021-05-20 02:31:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 02:31:45] [INFO ] [Nat]Absence check using state equation in 417 ms returned sat
[2021-05-20 02:31:45] [INFO ] State equation strengthened by 73 read => feed constraints.
[2021-05-20 02:31:46] [INFO ] [Nat]Added 73 Read/Feed constraints in 38 ms returned sat
[2021-05-20 02:31:46] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 132 ms.
[2021-05-20 02:31:49] [INFO ] Deduced a trap composed of 125 places in 412 ms of which 6 ms to minimize.
[2021-05-20 02:31:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 529 ms
[2021-05-20 02:31:49] [INFO ] Added : 185 causal constraints over 37 iterations in 3089 ms. Result :sat
Minimization took 310 ms.
[2021-05-20 02:31:49] [INFO ] [Real]Absence check using 59 positive place invariants in 32 ms returned sat
[2021-05-20 02:31:49] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 7 ms returned sat
[2021-05-20 02:31:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 02:31:50] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2021-05-20 02:31:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 02:31:50] [INFO ] [Nat]Absence check using 59 positive place invariants in 41 ms returned sat
[2021-05-20 02:31:50] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 14 ms returned sat
[2021-05-20 02:31:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 02:31:50] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2021-05-20 02:31:50] [INFO ] [Nat]Added 73 Read/Feed constraints in 23 ms returned sat
[2021-05-20 02:31:50] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 106 ms.
[2021-05-20 02:31:52] [INFO ] Added : 119 causal constraints over 24 iterations in 1434 ms. Result :sat
Minimization took 212 ms.
[2021-05-20 02:31:52] [INFO ] [Real]Absence check using 59 positive place invariants in 25 ms returned sat
[2021-05-20 02:31:52] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 7 ms returned sat
[2021-05-20 02:31:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 02:31:52] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2021-05-20 02:31:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 02:31:53] [INFO ] [Nat]Absence check using 59 positive place invariants in 38 ms returned sat
[2021-05-20 02:31:53] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2021-05-20 02:31:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 02:31:53] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2021-05-20 02:31:53] [INFO ] [Nat]Added 73 Read/Feed constraints in 51 ms returned sat
[2021-05-20 02:31:53] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 78 ms.
[2021-05-20 02:31:56] [INFO ] Added : 188 causal constraints over 38 iterations in 3387 ms. Result :sat
Minimization took 316 ms.
[2021-05-20 02:31:57] [INFO ] [Real]Absence check using 59 positive place invariants in 28 ms returned sat
[2021-05-20 02:31:57] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 9 ms returned sat
[2021-05-20 02:31:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 02:31:57] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2021-05-20 02:31:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 02:31:58] [INFO ] [Nat]Absence check using 59 positive place invariants in 40 ms returned sat
[2021-05-20 02:31:58] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2021-05-20 02:31:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 02:31:58] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2021-05-20 02:31:58] [INFO ] [Nat]Added 73 Read/Feed constraints in 36 ms returned sat
[2021-05-20 02:31:58] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 80 ms.
[2021-05-20 02:32:02] [INFO ] Deduced a trap composed of 222 places in 287 ms of which 3 ms to minimize.
[2021-05-20 02:32:03] [INFO ] Deduced a trap composed of 129 places in 301 ms of which 2 ms to minimize.
[2021-05-20 02:32: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 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.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-20 02:32:03] [INFO ] [Real]Absence check using 59 positive place invariants in 39 ms returned sat
[2021-05-20 02:32:03] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 11 ms returned sat
[2021-05-20 02:32:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 02:32:03] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2021-05-20 02:32:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 02:32:03] [INFO ] [Nat]Absence check using 59 positive place invariants in 40 ms returned sat
[2021-05-20 02:32:03] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 13 ms returned sat
[2021-05-20 02:32:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 02:32:04] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2021-05-20 02:32:04] [INFO ] [Nat]Added 73 Read/Feed constraints in 32 ms returned sat
[2021-05-20 02:32:04] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 59 ms.
[2021-05-20 02:32:07] [INFO ] Added : 193 causal constraints over 39 iterations in 3302 ms. Result :sat
Minimization took 207 ms.
[2021-05-20 02:32:08] [INFO ] [Real]Absence check using 59 positive place invariants in 36 ms returned sat
[2021-05-20 02:32:08] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 11 ms returned sat
[2021-05-20 02:32:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 02:32:08] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2021-05-20 02:32:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 02:32:08] [INFO ] [Nat]Absence check using 59 positive place invariants in 39 ms returned sat
[2021-05-20 02:32:08] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2021-05-20 02:32:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 02:32:08] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2021-05-20 02:32:09] [INFO ] [Nat]Added 73 Read/Feed constraints in 38 ms returned sat
[2021-05-20 02:32:09] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 42 ms.
[2021-05-20 02:32:12] [INFO ] Added : 211 causal constraints over 43 iterations in 3003 ms. Result :sat
Minimization took 243 ms.
[2021-05-20 02:32:12] [INFO ] [Real]Absence check using 59 positive place invariants in 38 ms returned sat
[2021-05-20 02:32:12] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 11 ms returned sat
[2021-05-20 02:32:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 02:32:12] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2021-05-20 02:32:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 02:32:13] [INFO ] [Nat]Absence check using 59 positive place invariants in 30 ms returned sat
[2021-05-20 02:32:13] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 7 ms returned sat
[2021-05-20 02:32:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 02:32:13] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2021-05-20 02:32:13] [INFO ] [Nat]Added 73 Read/Feed constraints in 22 ms returned sat
[2021-05-20 02:32:13] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 58 ms.
[2021-05-20 02:32:15] [INFO ] Added : 114 causal constraints over 26 iterations in 1503 ms. Result :sat
Minimization took 315 ms.
[2021-05-20 02:32:15] [INFO ] [Real]Absence check using 59 positive place invariants in 27 ms returned sat
[2021-05-20 02:32:15] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 7 ms returned sat
[2021-05-20 02:32:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 02:32:15] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2021-05-20 02:32:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 02:32:15] [INFO ] [Nat]Absence check using 59 positive place invariants in 27 ms returned sat
[2021-05-20 02:32:15] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 7 ms returned sat
[2021-05-20 02:32:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 02:32:16] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2021-05-20 02:32:16] [INFO ] [Nat]Added 73 Read/Feed constraints in 49 ms returned sat
[2021-05-20 02:32:16] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 58 ms.
[2021-05-20 02:32:19] [INFO ] Added : 189 causal constraints over 38 iterations in 3334 ms. Result :sat
Minimization took 287 ms.
[2021-05-20 02:32:20] [INFO ] [Real]Absence check using 59 positive place invariants in 28 ms returned sat
[2021-05-20 02:32:20] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 8 ms returned sat
[2021-05-20 02:32:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-20 02:32:20] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2021-05-20 02:32:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-20 02:32:20] [INFO ] [Nat]Absence check using 59 positive place invariants in 40 ms returned sat
[2021-05-20 02:32:20] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 10 ms returned sat
[2021-05-20 02:32:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-20 02:32:21] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2021-05-20 02:32:21] [INFO ] [Nat]Added 73 Read/Feed constraints in 45 ms returned sat
[2021-05-20 02:32:21] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 75 ms.
[2021-05-20 02:32:25] [INFO ] Deduced a trap composed of 3 places in 402 ms of which 4 ms to minimize.
[2021-05-20 02:32:25] [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 8
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, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 41300 steps, including 377 resets, run finished after 334 ms. (steps per millisecond=123 ) properties (out of 9) seen :2 could not realise parikh vector
FORMULA Vasy2003-PT-none-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Vasy2003-PT-none-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 18600 steps, including 195 resets, run finished after 154 ms. (steps per millisecond=120 ) properties (out of 7) seen :2 could not realise parikh vector
FORMULA Vasy2003-PT-none-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Vasy2003-PT-none-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 97000 steps, including 835 resets, run finished after 557 ms. (steps per millisecond=174 ) properties (out of 5) seen :1 could not realise parikh vector
FORMULA Vasy2003-PT-none-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 43000 steps, including 431 resets, run finished after 161 ms. (steps per millisecond=267 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 54200 steps, including 648 resets, run finished after 245 ms. (steps per millisecond=221 ) properties (out of 4) seen :2 could not realise parikh vector
FORMULA Vasy2003-PT-none-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Vasy2003-PT-none-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 16200 steps, including 167 resets, run finished after 107 ms. (steps per millisecond=151 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 76800 steps, including 876 resets, run finished after 411 ms. (steps per millisecond=186 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA Vasy2003-PT-none-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 485 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 485/485 places, 751/751 transitions.
Graph (trivial) has 166 edges and 485 vertex of which 4 / 485 are part of one of the 2 SCC in 8 ms
Free SCC test removed 2 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1554 edges and 483 vertex of which 413 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.9 ms
Discarding 70 places :
Also discarding 55 output transitions
Drop transitions removed 55 transitions
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 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 20 rules applied. Total rules applied 22 place count 413 transition count 668
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 412 transition count 668
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 23 place count 412 transition count 650
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 59 place count 394 transition count 650
Discarding 134 places :
Symmetric choice reduction at 2 with 134 rule applications. Total rules 193 place count 260 transition count 516
Ensure Unique test removed 1 places
Iterating global reduction 2 with 135 rules applied. Total rules applied 328 place count 259 transition count 516
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 359 place count 259 transition count 485
Discarding 100 places :
Symmetric choice reduction at 3 with 100 rule applications. Total rules 459 place count 159 transition count 359
Iterating global reduction 3 with 100 rules applied. Total rules applied 559 place count 159 transition count 359
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 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 3 with 71 rules applied. Total rules applied 630 place count 159 transition count 288
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 631 place count 158 transition count 288
Discarding 43 places :
Symmetric choice reduction at 5 with 43 rule applications. Total rules 674 place count 115 transition count 211
Iterating global reduction 5 with 43 rules applied. Total rules applied 717 place count 115 transition count 211
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 757 place count 115 transition count 171
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 759 place count 113 transition count 159
Iterating global reduction 6 with 2 rules applied. Total rules applied 761 place count 113 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 762 place count 113 transition count 158
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 763 place count 112 transition count 157
Iterating global reduction 7 with 1 rules applied. Total rules applied 764 place count 112 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 766 place count 112 transition count 155
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 778 place count 106 transition count 149
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 784 place count 106 transition count 143
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 785 place count 106 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 786 place count 105 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 787 place count 104 transition count 141
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 17 edges and 96 vertex of which 4 / 96 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 9 with 13 rules applied. Total rules applied 800 place count 94 transition count 137
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 804 place count 94 transition count 133
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 5 Pre rules applied. Total rules applied 804 place count 94 transition count 128
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 15 rules applied. Total rules applied 819 place count 84 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 822 place count 84 transition count 125
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 2 Pre rules applied. Total rules applied 822 place count 84 transition count 123
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 5 rules applied. Total rules applied 827 place count 81 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 827 place count 81 transition count 122
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 830 place count 79 transition count 122
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 831 place count 79 transition count 121
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 837 place count 75 transition count 119
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 838 place count 74 transition count 118
Iterating global reduction 13 with 1 rules applied. Total rules applied 839 place count 74 transition count 118
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 843 place count 72 transition count 116
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 849 place count 72 transition count 110
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 850 place count 71 transition count 108
Iterating global reduction 14 with 1 rules applied. Total rules applied 851 place count 71 transition count 108
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 854 place count 71 transition count 105
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 859 place count 71 transition count 100
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 11 rules applied. Total rules applied 870 place count 64 transition count 96
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 870 place count 64 transition count 95
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 873 place count 62 transition count 95
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 873 place count 62 transition count 94
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 876 place count 60 transition count 94
Graph (trivial) has 10 edges and 60 vertex of which 2 / 60 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 878 place count 58 transition count 94
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 881 place count 58 transition count 91
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 882 place count 58 transition count 90
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 886 place count 56 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 888 place count 55 transition count 87
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 18 with 2 rules applied. Total rules applied 890 place count 55 transition count 90
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 8 rules applied. Total rules applied 898 place count 53 transition count 84
Applied a total of 898 rules in 249 ms. Remains 53 /485 variables (removed 432) and now considering 84/751 (removed 667) transitions.
Finished structural reductions, in 1 iterations. Remains : 53/485 places, 84/751 transitions.
Normalized transition count is 70 out of 84 initially.
// Phase 1: matrix 70 rows 53 cols
[2021-05-20 02:32:28] [INFO ] Computed 13 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 777 ms. (steps per millisecond=1287 ) properties (out of 1) seen :1
FORMULA Vasy2003-PT-none-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621477949904

--------------------
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="Vasy2003-PT-none"
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 Vasy2003-PT-none, 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 r273-smll-162123879800211"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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