Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r011-oct2-167813600200461.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is AutoFlight-PT-06b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813600200461
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.2K Feb 25 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 134K Mar 5 18:22 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 AutoFlight-PT-06b-UpperBounds-00
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-01
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-02
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-03
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-04
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-05
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-06
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-07
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-08
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-09
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-10
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-11
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-12
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-13
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-14
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678735864897

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-06b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 19:31:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 19:31:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:31:07] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2023-03-13 19:31:07] [INFO ] Transformed 574 places.
[2023-03-13 19:31:07] [INFO ] Transformed 572 transitions.
[2023-03-13 19:31:07] [INFO ] Found NUPN structural information;
[2023-03-13 19:31:07] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
// Phase 1: matrix 572 rows 574 cols
[2023-03-13 19:31:07] [INFO ] Computed 40 place invariants in 26 ms
Incomplete random walk after 10000 steps, including 34 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :10
FORMULA AutoFlight-PT-06b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :1
FORMULA AutoFlight-PT-06b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 5) seen :0
[2023-03-13 19:31:08] [INFO ] Invariant cache hit.
[2023-03-13 19:31:08] [INFO ] [Real]Absence check using 39 positive place invariants in 40 ms returned sat
[2023-03-13 19:31:08] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-13 19:31:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 19:31:08] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2023-03-13 19:31:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 19:31:08] [INFO ] [Nat]Absence check using 39 positive place invariants in 33 ms returned sat
[2023-03-13 19:31:08] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-13 19:31:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 19:31:09] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2023-03-13 19:31:09] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 4 ms to minimize.
[2023-03-13 19:31:09] [INFO ] Deduced a trap composed of 70 places in 160 ms of which 0 ms to minimize.
[2023-03-13 19:31:09] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 2 ms to minimize.
[2023-03-13 19:31:10] [INFO ] Deduced a trap composed of 24 places in 230 ms of which 1 ms to minimize.
[2023-03-13 19:31:10] [INFO ] Deduced a trap composed of 55 places in 174 ms of which 18 ms to minimize.
[2023-03-13 19:31:10] [INFO ] Deduced a trap composed of 54 places in 148 ms of which 1 ms to minimize.
[2023-03-13 19:31:10] [INFO ] Deduced a trap composed of 81 places in 443 ms of which 14 ms to minimize.
[2023-03-13 19:31:11] [INFO ] Deduced a trap composed of 84 places in 179 ms of which 2 ms to minimize.
[2023-03-13 19:31:11] [INFO ] Deduced a trap composed of 87 places in 217 ms of which 0 ms to minimize.
[2023-03-13 19:31:11] [INFO ] Deduced a trap composed of 88 places in 173 ms of which 1 ms to minimize.
[2023-03-13 19:31:11] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 1 ms to minimize.
[2023-03-13 19:31:11] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 1 ms to minimize.
[2023-03-13 19:31:12] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 0 ms to minimize.
[2023-03-13 19:31:12] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 0 ms to minimize.
[2023-03-13 19:31:12] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 1 ms to minimize.
[2023-03-13 19:31:12] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3162 ms
[2023-03-13 19:31:12] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 51 ms.
[2023-03-13 19:31:14] [INFO ] Deduced a trap composed of 8 places in 413 ms of which 26 ms to minimize.
[2023-03-13 19:31:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-13 19:31:14] [INFO ] [Real]Absence check using 39 positive place invariants in 15 ms returned sat
[2023-03-13 19:31:14] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-13 19:31:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 19:31:14] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2023-03-13 19:31:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 19:31:14] [INFO ] [Nat]Absence check using 39 positive place invariants in 76 ms returned sat
[2023-03-13 19:31:14] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-13 19:31:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 19:31:15] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2023-03-13 19:31:15] [INFO ] Deduced a trap composed of 53 places in 242 ms of which 1 ms to minimize.
[2023-03-13 19:31:15] [INFO ] Deduced a trap composed of 54 places in 151 ms of which 1 ms to minimize.
[2023-03-13 19:31:15] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 1 ms to minimize.
[2023-03-13 19:31:15] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 0 ms to minimize.
[2023-03-13 19:31:15] [INFO ] Deduced a trap composed of 46 places in 153 ms of which 1 ms to minimize.
[2023-03-13 19:31:16] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 4 ms to minimize.
[2023-03-13 19:31:16] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 1 ms to minimize.
[2023-03-13 19:31:16] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 1 ms to minimize.
[2023-03-13 19:31:16] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 0 ms to minimize.
[2023-03-13 19:31:16] [INFO ] Deduced a trap composed of 68 places in 210 ms of which 1 ms to minimize.
[2023-03-13 19:31:17] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 0 ms to minimize.
[2023-03-13 19:31:17] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 1 ms to minimize.
[2023-03-13 19:31:17] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 1 ms to minimize.
[2023-03-13 19:31:17] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 0 ms to minimize.
[2023-03-13 19:31:17] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 0 ms to minimize.
[2023-03-13 19:31:17] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 0 ms to minimize.
[2023-03-13 19:31:17] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 0 ms to minimize.
[2023-03-13 19:31:18] [INFO ] Deduced a trap composed of 92 places in 174 ms of which 13 ms to minimize.
[2023-03-13 19:31:18] [INFO ] Deduced a trap composed of 89 places in 165 ms of which 1 ms to minimize.
[2023-03-13 19:31:18] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 2 ms to minimize.
[2023-03-13 19:31:18] [INFO ] Deduced a trap composed of 91 places in 240 ms of which 1 ms to minimize.
[2023-03-13 19:31:18] [INFO ] Deduced a trap composed of 86 places in 151 ms of which 0 ms to minimize.
[2023-03-13 19:31:19] [INFO ] Deduced a trap composed of 83 places in 234 ms of which 0 ms to minimize.
[2023-03-13 19:31:19] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4206 ms
[2023-03-13 19:31:19] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 52 ms.
[2023-03-13 19:31:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-13 19:31:19] [INFO ] [Real]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-13 19:31:19] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-13 19:31:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 19:31:20] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2023-03-13 19:31:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 19:31:20] [INFO ] [Nat]Absence check using 39 positive place invariants in 15 ms returned sat
[2023-03-13 19:31:20] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 27 ms returned sat
[2023-03-13 19:31:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 19:31:20] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2023-03-13 19:31:20] [INFO ] Deduced a trap composed of 50 places in 173 ms of which 1 ms to minimize.
[2023-03-13 19:31:20] [INFO ] Deduced a trap composed of 66 places in 170 ms of which 1 ms to minimize.
[2023-03-13 19:31:21] [INFO ] Deduced a trap composed of 60 places in 220 ms of which 1 ms to minimize.
[2023-03-13 19:31:21] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 0 ms to minimize.
[2023-03-13 19:31:21] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 1 ms to minimize.
[2023-03-13 19:31:21] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 0 ms to minimize.
[2023-03-13 19:31:21] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 0 ms to minimize.
[2023-03-13 19:31:21] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 1 ms to minimize.
[2023-03-13 19:31:21] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 0 ms to minimize.
[2023-03-13 19:31:21] [INFO ] Deduced a trap composed of 61 places in 179 ms of which 1 ms to minimize.
[2023-03-13 19:31:22] [INFO ] Deduced a trap composed of 74 places in 223 ms of which 1 ms to minimize.
[2023-03-13 19:31:22] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1836 ms
[2023-03-13 19:31:22] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 35 ms.
[2023-03-13 19:31:25] [INFO ] Deduced a trap composed of 8 places in 362 ms of which 1 ms to minimize.
[2023-03-13 19:31: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 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-13 19:31:25] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2023-03-13 19:31:25] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-13 19:31:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 19:31:25] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2023-03-13 19:31:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 19:31:26] [INFO ] [Nat]Absence check using 39 positive place invariants in 65 ms returned sat
[2023-03-13 19:31:26] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 39 ms returned sat
[2023-03-13 19:31:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 19:31:26] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2023-03-13 19:31:26] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 0 ms to minimize.
[2023-03-13 19:31:26] [INFO ] Deduced a trap composed of 25 places in 243 ms of which 1 ms to minimize.
[2023-03-13 19:31:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 449 ms
[2023-03-13 19:31:26] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 51 ms.
[2023-03-13 19:31:30] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-13 19:31:31] [INFO ] [Real]Absence check using 39 positive place invariants in 25 ms returned sat
[2023-03-13 19:31:31] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-13 19:31:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 19:31:31] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2023-03-13 19:31:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 19:31:31] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2023-03-13 19:31:31] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-13 19:31:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 19:31:31] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-13 19:31:31] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 1 ms to minimize.
[2023-03-13 19:31:32] [INFO ] Deduced a trap composed of 57 places in 196 ms of which 0 ms to minimize.
[2023-03-13 19:31:32] [INFO ] Deduced a trap composed of 75 places in 155 ms of which 1 ms to minimize.
[2023-03-13 19:31:32] [INFO ] Deduced a trap composed of 75 places in 171 ms of which 0 ms to minimize.
[2023-03-13 19:31:32] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 1 ms to minimize.
[2023-03-13 19:31:32] [INFO ] Deduced a trap composed of 85 places in 264 ms of which 1 ms to minimize.
[2023-03-13 19:31:33] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 0 ms to minimize.
[2023-03-13 19:31:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1287 ms
[2023-03-13 19:31:33] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 34 ms.
[2023-03-13 19:31:36] [INFO ] Added : 390 causal constraints over 78 iterations in 3435 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA AutoFlight-PT-06b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 572/572 transitions.
Drop transitions removed 225 transitions
Trivial Post-agglo rules discarded 225 transitions
Performed 225 trivial Post agglomeration. Transition count delta: 225
Iterating post reduction 0 with 225 rules applied. Total rules applied 225 place count 574 transition count 347
Reduce places removed 225 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 267 rules applied. Total rules applied 492 place count 349 transition count 305
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 505 place count 337 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 506 place count 336 transition count 304
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 77 Pre rules applied. Total rules applied 506 place count 336 transition count 227
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 660 place count 259 transition count 227
Discarding 52 places :
Symmetric choice reduction at 4 with 52 rule applications. Total rules 712 place count 207 transition count 175
Iterating global reduction 4 with 52 rules applied. Total rules applied 764 place count 207 transition count 175
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 764 place count 207 transition count 157
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 800 place count 189 transition count 157
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 892 place count 143 transition count 111
Free-agglomeration rule applied 24 times.
Iterating global reduction 4 with 24 rules applied. Total rules applied 916 place count 143 transition count 87
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 940 place count 119 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 941 place count 118 transition count 86
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 5 with 55 rules applied. Total rules applied 996 place count 95 transition count 54
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1028 place count 63 transition count 54
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 18 Pre rules applied. Total rules applied 1028 place count 63 transition count 36
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 1064 place count 45 transition count 36
Applied a total of 1064 rules in 86 ms. Remains 45 /574 variables (removed 529) and now considering 36/572 (removed 536) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 45/574 places, 36/572 transitions.
// Phase 1: matrix 36 rows 45 cols
[2023-03-13 19:31:36] [INFO ] Computed 17 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 952 ms. (steps per millisecond=1050 ) properties (out of 4) seen :4
FORMULA AutoFlight-PT-06b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 30226 ms.
ITS solved all properties within timeout

BK_STOP 1678735898014

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="AutoFlight-PT-06b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is AutoFlight-PT-06b, 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 r011-oct2-167813600200461"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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