Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r087-tall-171620521300021.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CANConstruction-PT-040, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521300021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 18:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 18:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 12 18:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.5M May 18 16:42 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 CANConstruction-PT-040-UpperBounds-00
FORMULA_NAME CANConstruction-PT-040-UpperBounds-01
FORMULA_NAME CANConstruction-PT-040-UpperBounds-02
FORMULA_NAME CANConstruction-PT-040-UpperBounds-03
FORMULA_NAME CANConstruction-PT-040-UpperBounds-04
FORMULA_NAME CANConstruction-PT-040-UpperBounds-05
FORMULA_NAME CANConstruction-PT-040-UpperBounds-06
FORMULA_NAME CANConstruction-PT-040-UpperBounds-07
FORMULA_NAME CANConstruction-PT-040-UpperBounds-08
FORMULA_NAME CANConstruction-PT-040-UpperBounds-09
FORMULA_NAME CANConstruction-PT-040-UpperBounds-10
FORMULA_NAME CANConstruction-PT-040-UpperBounds-11
FORMULA_NAME CANConstruction-PT-040-UpperBounds-12
FORMULA_NAME CANConstruction-PT-040-UpperBounds-13
FORMULA_NAME CANConstruction-PT-040-UpperBounds-14
FORMULA_NAME CANConstruction-PT-040-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716215921076

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-040
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-20 14:38:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 14:38:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 14:38:42] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2024-05-20 14:38:42] [INFO ] Transformed 3682 places.
[2024-05-20 14:38:42] [INFO ] Transformed 6720 transitions.
[2024-05-20 14:38:43] [INFO ] Parsed PT model containing 3682 places and 6720 transitions and 20000 arcs in 477 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 6720 rows 3682 cols
[2024-05-20 14:38:43] [INFO ] Computed 81 invariants in 92 ms
Incomplete random walk after 10000 steps, including 14 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 16) seen :7
FORMULA CANConstruction-PT-040-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
[2024-05-20 14:38:43] [INFO ] Invariant cache hit.
[2024-05-20 14:38:44] [INFO ] [Real]Absence check using 41 positive place invariants in 94 ms returned sat
[2024-05-20 14:38:44] [INFO ] [Real]Absence check using 41 positive and 40 generalized place invariants in 29 ms returned sat
[2024-05-20 14:38:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 14:38:46] [INFO ] [Real]Absence check using state equation in 2005 ms returned sat
[2024-05-20 14:38:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 14:38:46] [INFO ] [Nat]Absence check using 41 positive place invariants in 74 ms returned sat
[2024-05-20 14:38:46] [INFO ] [Nat]Absence check using 41 positive and 40 generalized place invariants in 23 ms returned sat
[2024-05-20 14:38:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 14:38:49] [INFO ] [Nat]Absence check using state equation in 2202 ms returned sat
[2024-05-20 14:38:49] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 14:38:49] [INFO ] [Nat]Added 3160 Read/Feed constraints in 303 ms returned sat
[2024-05-20 14:38:50] [INFO ] Computed and/alt/rep : 6560/12840/6560 causal constraints (skipped 120 transitions) in 369 ms.
[2024-05-20 14:38:51] [INFO ] Added : 11 causal constraints over 3 iterations in 1765 ms. Result :unknown
[2024-05-20 14:38:51] [INFO ] [Real]Absence check using 41 positive place invariants in 75 ms returned sat
[2024-05-20 14:38:51] [INFO ] [Real]Absence check using 41 positive and 40 generalized place invariants in 20 ms returned sat
[2024-05-20 14:38:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 14:38:54] [INFO ] [Real]Absence check using state equation in 2234 ms returned sat
[2024-05-20 14:38:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 14:38:54] [INFO ] [Nat]Absence check using 41 positive place invariants in 78 ms returned sat
[2024-05-20 14:38:54] [INFO ] [Nat]Absence check using 41 positive and 40 generalized place invariants in 22 ms returned sat
[2024-05-20 14:38:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 14:38:56] [INFO ] [Nat]Absence check using state equation in 2161 ms returned sat
[2024-05-20 14:38:57] [INFO ] [Nat]Added 3160 Read/Feed constraints in 266 ms returned sat
[2024-05-20 14:38:57] [INFO ] Computed and/alt/rep : 6560/12840/6560 causal constraints (skipped 120 transitions) in 337 ms.
[2024-05-20 14:38:59] [INFO ] Added : 11 causal constraints over 3 iterations in 1662 ms. Result :sat
[2024-05-20 14:38:59] [INFO ] [Real]Absence check using 41 positive place invariants in 74 ms returned sat
[2024-05-20 14:38:59] [INFO ] [Real]Absence check using 41 positive and 40 generalized place invariants in 17 ms returned sat
[2024-05-20 14:38:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 14:39:01] [INFO ] [Real]Absence check using state equation in 2172 ms returned sat
[2024-05-20 14:39:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 14:39:02] [INFO ] [Nat]Absence check using 41 positive place invariants in 80 ms returned sat
[2024-05-20 14:39:02] [INFO ] [Nat]Absence check using 41 positive and 40 generalized place invariants in 17 ms returned sat
[2024-05-20 14:39:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 14:39:04] [INFO ] [Nat]Absence check using state equation in 2229 ms returned sat
[2024-05-20 14:39:04] [INFO ] [Nat]Added 3160 Read/Feed constraints in 233 ms returned sat
[2024-05-20 14:39:05] [INFO ] Computed and/alt/rep : 6560/12840/6560 causal constraints (skipped 120 transitions) in 297 ms.
[2024-05-20 14:39:06] [INFO ] Added : 8 causal constraints over 2 iterations in 1192 ms. Result :sat
[2024-05-20 14:39:06] [INFO ] [Real]Absence check using 41 positive place invariants in 77 ms returned sat
[2024-05-20 14:39:06] [INFO ] [Real]Absence check using 41 positive and 40 generalized place invariants in 18 ms returned sat
[2024-05-20 14:39:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 14:39:08] [INFO ] [Real]Absence check using state equation in 2136 ms returned sat
[2024-05-20 14:39:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 14:39:09] [INFO ] [Nat]Absence check using 41 positive place invariants in 73 ms returned sat
[2024-05-20 14:39:09] [INFO ] [Nat]Absence check using 41 positive and 40 generalized place invariants in 16 ms returned sat
[2024-05-20 14:39:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 14:39:11] [INFO ] [Nat]Absence check using state equation in 2170 ms returned sat
[2024-05-20 14:39:11] [INFO ] [Nat]Added 3160 Read/Feed constraints in 240 ms returned sat
[2024-05-20 14:39:12] [INFO ] Computed and/alt/rep : 6560/12840/6560 causal constraints (skipped 120 transitions) in 283 ms.
[2024-05-20 14:39:13] [INFO ] Added : 11 causal constraints over 3 iterations in 1552 ms. Result :sat
[2024-05-20 14:39:14] [INFO ] [Real]Absence check using 41 positive place invariants in 72 ms returned sat
[2024-05-20 14:39:14] [INFO ] [Real]Absence check using 41 positive and 40 generalized place invariants in 17 ms returned sat
[2024-05-20 14:39:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 14:39:16] [INFO ] [Real]Absence check using state equation in 2091 ms returned sat
[2024-05-20 14:39:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 14:39:16] [INFO ] [Nat]Absence check using 41 positive place invariants in 68 ms returned sat
[2024-05-20 14:39:16] [INFO ] [Nat]Absence check using 41 positive and 40 generalized place invariants in 20 ms returned sat
[2024-05-20 14:39:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 14:39:19] [INFO ] [Nat]Absence check using state equation in 2148 ms returned sat
[2024-05-20 14:39:19] [INFO ] [Nat]Added 3160 Read/Feed constraints in 241 ms returned sat
[2024-05-20 14:39:19] [INFO ] Computed and/alt/rep : 6560/12840/6560 causal constraints (skipped 120 transitions) in 282 ms.
[2024-05-20 14:39:20] [INFO ] Added : 11 causal constraints over 3 iterations in 1400 ms. Result :sat
[2024-05-20 14:39:21] [INFO ] [Real]Absence check using 41 positive place invariants in 68 ms returned sat
[2024-05-20 14:39:21] [INFO ] [Real]Absence check using 41 positive and 40 generalized place invariants in 17 ms returned sat
[2024-05-20 14:39:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 14:39:23] [INFO ] [Real]Absence check using state equation in 2109 ms returned sat
[2024-05-20 14:39:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 14:39:24] [INFO ] [Nat]Absence check using 41 positive place invariants in 70 ms returned sat
[2024-05-20 14:39:24] [INFO ] [Nat]Absence check using 41 positive and 40 generalized place invariants in 17 ms returned sat
[2024-05-20 14:39:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 14:39:26] [INFO ] [Nat]Absence check using state equation in 2113 ms returned sat
[2024-05-20 14:39:26] [INFO ] [Nat]Added 3160 Read/Feed constraints in 213 ms returned sat
[2024-05-20 14:39:26] [INFO ] Computed and/alt/rep : 6560/12840/6560 causal constraints (skipped 120 transitions) in 308 ms.
[2024-05-20 14:39:32] [INFO ] Deduced a trap composed of 5 places in 3931 ms of which 12 ms to minimize.
[2024-05-20 14:39:32] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 14:39:33] [INFO ] [Real]Absence check using 41 positive place invariants in 70 ms returned sat
[2024-05-20 14:39:33] [INFO ] [Real]Absence check using 41 positive and 40 generalized place invariants in 17 ms returned sat
[2024-05-20 14:39:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 14:39:35] [INFO ] [Real]Absence check using state equation in 2152 ms returned sat
[2024-05-20 14:39:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 14:39:35] [INFO ] [Nat]Absence check using 41 positive place invariants in 79 ms returned sat
[2024-05-20 14:39:35] [INFO ] [Nat]Absence check using 41 positive and 40 generalized place invariants in 17 ms returned sat
[2024-05-20 14:39:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 14:39:38] [INFO ] [Nat]Absence check using state equation in 2180 ms returned sat
[2024-05-20 14:39:38] [INFO ] [Nat]Added 3160 Read/Feed constraints in 218 ms returned sat
[2024-05-20 14:39:38] [INFO ] Computed and/alt/rep : 6560/12840/6560 causal constraints (skipped 120 transitions) in 291 ms.
[2024-05-20 14:39:40] [INFO ] Added : 11 causal constraints over 3 iterations in 1575 ms. Result :sat
[2024-05-20 14:39:40] [INFO ] [Real]Absence check using 41 positive place invariants in 78 ms returned sat
[2024-05-20 14:39:40] [INFO ] [Real]Absence check using 41 positive and 40 generalized place invariants in 17 ms returned sat
[2024-05-20 14:39:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 14:39:42] [INFO ] [Real]Absence check using state equation in 2087 ms returned sat
[2024-05-20 14:39:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 14:39:43] [INFO ] [Nat]Absence check using 41 positive place invariants in 71 ms returned sat
[2024-05-20 14:39:43] [INFO ] [Nat]Absence check using 41 positive and 40 generalized place invariants in 19 ms returned sat
[2024-05-20 14:39:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 14:39:45] [INFO ] [Nat]Absence check using state equation in 2175 ms returned sat
[2024-05-20 14:39:45] [INFO ] [Nat]Added 3160 Read/Feed constraints in 225 ms returned sat
[2024-05-20 14:39:46] [INFO ] Computed and/alt/rep : 6560/12840/6560 causal constraints (skipped 120 transitions) in 291 ms.
[2024-05-20 14:39:47] [INFO ] Added : 8 causal constraints over 2 iterations in 1173 ms. Result :sat
[2024-05-20 14:39:47] [INFO ] [Real]Absence check using 41 positive place invariants in 69 ms returned sat
[2024-05-20 14:39:47] [INFO ] [Real]Absence check using 41 positive and 40 generalized place invariants in 17 ms returned sat
[2024-05-20 14:39:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 14:39:49] [INFO ] [Real]Absence check using state equation in 2158 ms returned sat
[2024-05-20 14:39:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 14:39:50] [INFO ] [Nat]Absence check using 41 positive place invariants in 69 ms returned sat
[2024-05-20 14:39:50] [INFO ] [Nat]Absence check using 41 positive and 40 generalized place invariants in 23 ms returned sat
[2024-05-20 14:39:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 14:39:52] [INFO ] [Nat]Absence check using state equation in 2150 ms returned sat
[2024-05-20 14:39:52] [INFO ] [Nat]Added 3160 Read/Feed constraints in 224 ms returned sat
[2024-05-20 14:39:53] [INFO ] Computed and/alt/rep : 6560/12840/6560 causal constraints (skipped 120 transitions) in 301 ms.
[2024-05-20 14:39:59] [INFO ] Deduced a trap composed of 5 places in 3952 ms of which 4 ms to minimize.
[2024-05-20 14:39:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
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]
FORMULA CANConstruction-PT-040-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-040-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-040-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-040-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-040-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-040-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-040-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CANConstruction-PT-040-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 3682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3682/3682 places, 6720/6720 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3682 transition count 6440
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3402 transition count 6440
Discarding 1520 places :
Symmetric choice reduction at 2 with 1520 rule applications. Total rules 2080 place count 1882 transition count 3400
Iterating global reduction 2 with 1520 rules applied. Total rules applied 3600 place count 1882 transition count 3400
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 3680 place count 1842 transition count 3360
Free-agglomeration rule applied 80 times.
Iterating global reduction 2 with 80 rules applied. Total rules applied 3760 place count 1842 transition count 3280
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 3840 place count 1762 transition count 3280
Applied a total of 3840 rules in 1071 ms. Remains 1762 /3682 variables (removed 1920) and now considering 3280/6720 (removed 3440) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1072 ms. Remains : 1762/3682 places, 3280/6720 transitions.
// Phase 1: matrix 3280 rows 1762 cols
[2024-05-20 14:40:00] [INFO ] Computed 81 invariants in 30 ms
Incomplete random walk after 1000000 steps, including 3642 resets, run finished after 8729 ms. (steps per millisecond=114 ) properties (out of 1) seen :1
FORMULA CANConstruction-PT-040-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 86504 ms.

BK_STOP 1716216009883

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="CANConstruction-PT-040"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is CANConstruction-PT-040, 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 r087-tall-171620521300021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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