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.r009-oct2-167813598000501.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 ltsminxred
Input is AutoFlight-PT-48a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598000501
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 7.0K Feb 25 19:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 19:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 18:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 18:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 20:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 19:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 19:45 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 309K 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-48a-UpperBounds-00
FORMULA_NAME AutoFlight-PT-48a-UpperBounds-01
FORMULA_NAME AutoFlight-PT-48a-UpperBounds-02
FORMULA_NAME AutoFlight-PT-48a-UpperBounds-03
FORMULA_NAME AutoFlight-PT-48a-UpperBounds-04
FORMULA_NAME AutoFlight-PT-48a-UpperBounds-05
FORMULA_NAME AutoFlight-PT-48a-UpperBounds-06
FORMULA_NAME AutoFlight-PT-48a-UpperBounds-07
FORMULA_NAME AutoFlight-PT-48a-UpperBounds-08
FORMULA_NAME AutoFlight-PT-48a-UpperBounds-09
FORMULA_NAME AutoFlight-PT-48a-UpperBounds-10
FORMULA_NAME AutoFlight-PT-48a-UpperBounds-11
FORMULA_NAME AutoFlight-PT-48a-UpperBounds-12
FORMULA_NAME AutoFlight-PT-48a-UpperBounds-13
FORMULA_NAME AutoFlight-PT-48a-UpperBounds-14
FORMULA_NAME AutoFlight-PT-48a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678633830812

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-48a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 15:10:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 15:10:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:10:33] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2023-03-12 15:10:33] [INFO ] Transformed 1127 places.
[2023-03-12 15:10:33] [INFO ] Transformed 1113 transitions.
[2023-03-12 15:10:33] [INFO ] Found NUPN structural information;
[2023-03-12 15:10:33] [INFO ] Parsed PT model containing 1127 places and 1113 transitions and 3458 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 192 transitions
Reduce redundant transitions removed 192 transitions.
// Phase 1: matrix 921 rows 1127 cols
[2023-03-12 15:10:33] [INFO ] Computed 258 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 72 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 16) seen :9
FORMULA AutoFlight-PT-48a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
[2023-03-12 15:10:34] [INFO ] Invariant cache hit.
[2023-03-12 15:10:34] [INFO ] [Real]Absence check using 257 positive place invariants in 85 ms returned sat
[2023-03-12 15:10:34] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 15 ms returned sat
[2023-03-12 15:10:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:10:35] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2023-03-12 15:10:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:10:35] [INFO ] [Nat]Absence check using 257 positive place invariants in 97 ms returned sat
[2023-03-12 15:10:35] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 15:10:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:10:36] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2023-03-12 15:10:36] [INFO ] State equation strengthened by 192 read => feed constraints.
[2023-03-12 15:10:36] [INFO ] [Nat]Added 192 Read/Feed constraints in 13 ms returned sat
[2023-03-12 15:10:36] [INFO ] Computed and/alt/rep : 816/1536/816 causal constraints (skipped 104 transitions) in 80 ms.
[2023-03-12 15:10:40] [INFO ] Added : 220 causal constraints over 44 iterations in 4169 ms. Result :unknown
[2023-03-12 15:10:40] [INFO ] [Real]Absence check using 257 positive place invariants in 74 ms returned sat
[2023-03-12 15:10:40] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 14 ms returned sat
[2023-03-12 15:10:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:10:41] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2023-03-12 15:10:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:10:41] [INFO ] [Nat]Absence check using 257 positive place invariants in 175 ms returned sat
[2023-03-12 15:10:41] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 15:10:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:10:42] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2023-03-12 15:10:42] [INFO ] [Nat]Added 192 Read/Feed constraints in 28 ms returned sat
[2023-03-12 15:10:42] [INFO ] Computed and/alt/rep : 816/1536/816 causal constraints (skipped 104 transitions) in 64 ms.
[2023-03-12 15:10:46] [INFO ] Added : 205 causal constraints over 41 iterations in 4119 ms. Result :unknown
[2023-03-12 15:10:46] [INFO ] [Real]Absence check using 257 positive place invariants in 101 ms returned sat
[2023-03-12 15:10:46] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 15:10:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:10:47] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2023-03-12 15:10:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:10:47] [INFO ] [Nat]Absence check using 257 positive place invariants in 71 ms returned sat
[2023-03-12 15:10:47] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 15:10:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:10:47] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2023-03-12 15:10:48] [INFO ] [Nat]Added 192 Read/Feed constraints in 40 ms returned sat
[2023-03-12 15:10:48] [INFO ] Computed and/alt/rep : 816/1536/816 causal constraints (skipped 104 transitions) in 60 ms.
[2023-03-12 15:10:52] [INFO ] Added : 250 causal constraints over 50 iterations in 4121 ms. Result :unknown
[2023-03-12 15:10:52] [INFO ] [Real]Absence check using 257 positive place invariants in 57 ms returned sat
[2023-03-12 15:10:52] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 11 ms returned sat
[2023-03-12 15:10:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:10:52] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2023-03-12 15:10:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:10:53] [INFO ] [Nat]Absence check using 257 positive place invariants in 130 ms returned sat
[2023-03-12 15:10:53] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-12 15:10:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:10:53] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2023-03-12 15:10:53] [INFO ] [Nat]Added 192 Read/Feed constraints in 24 ms returned sat
[2023-03-12 15:10:53] [INFO ] Computed and/alt/rep : 816/1536/816 causal constraints (skipped 104 transitions) in 87 ms.
[2023-03-12 15:10:58] [INFO ] Deduced a trap composed of 2 places in 514 ms of which 5 ms to minimize.
[2023-03-12 15:10:58] [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.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-12 15:10:58] [INFO ] [Real]Absence check using 257 positive place invariants in 129 ms returned sat
[2023-03-12 15:10:58] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 15:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:10:59] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2023-03-12 15:10:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:10:59] [INFO ] [Nat]Absence check using 257 positive place invariants in 64 ms returned sat
[2023-03-12 15:10:59] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 17 ms returned sat
[2023-03-12 15:10:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:10:59] [INFO ] [Nat]Absence check using state equation in 501 ms returned sat
[2023-03-12 15:11:00] [INFO ] [Nat]Added 192 Read/Feed constraints in 54 ms returned sat
[2023-03-12 15:11:00] [INFO ] Computed and/alt/rep : 816/1536/816 causal constraints (skipped 104 transitions) in 95 ms.
[2023-03-12 15:11:05] [INFO ] Deduced a trap composed of 2 places in 817 ms of which 14 ms to minimize.
[2023-03-12 15:11:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-12 15:11:05] [INFO ] [Real]Absence check using 257 positive place invariants in 96 ms returned sat
[2023-03-12 15:11:05] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 17 ms returned sat
[2023-03-12 15:11:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:11:05] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2023-03-12 15:11:05] [INFO ] [Real]Added 192 Read/Feed constraints in 27 ms returned sat
[2023-03-12 15:11:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:11:06] [INFO ] [Nat]Absence check using 257 positive place invariants in 315 ms returned sat
[2023-03-12 15:11:06] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 36 ms returned sat
[2023-03-12 15:11:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:11:07] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2023-03-12 15:11:07] [INFO ] [Nat]Added 192 Read/Feed constraints in 28 ms returned sat
[2023-03-12 15:11:07] [INFO ] Computed and/alt/rep : 816/1536/816 causal constraints (skipped 104 transitions) in 80 ms.
[2023-03-12 15:11:11] [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: Broken pipe ... 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: Broken pipe ...
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-12 15:11:11] [INFO ] [Real]Absence check using 257 positive place invariants in 96 ms returned sat
[2023-03-12 15:11:11] [INFO ] [Real]Absence check using 257 positive and 1 generalized place invariants in 15 ms returned sat
[2023-03-12 15:11:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:11:11] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2023-03-12 15:11:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:11:12] [INFO ] [Nat]Absence check using 257 positive place invariants in 88 ms returned sat
[2023-03-12 15:11:12] [INFO ] [Nat]Absence check using 257 positive and 1 generalized place invariants in 14 ms returned sat
[2023-03-12 15:11:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:11:12] [INFO ] [Nat]Absence check using state equation in 523 ms returned sat
[2023-03-12 15:11:12] [INFO ] [Nat]Added 192 Read/Feed constraints in 45 ms returned sat
[2023-03-12 15:11:13] [INFO ] Computed and/alt/rep : 816/1536/816 causal constraints (skipped 104 transitions) in 74 ms.
[2023-03-12 15:11:17] [INFO ] Added : 235 causal constraints over 47 iterations in 4040 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA AutoFlight-PT-48a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-48a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-48a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-48a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-48a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-48a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 1127 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 1127/1127 places, 920/920 transitions.
Drop transitions removed 220 transitions
Trivial Post-agglo rules discarded 220 transitions
Performed 220 trivial Post agglomeration. Transition count delta: 220
Iterating post reduction 0 with 220 rules applied. Total rules applied 220 place count 1127 transition count 700
Reduce places removed 220 places and 0 transitions.
Iterating post reduction 1 with 220 rules applied. Total rules applied 440 place count 907 transition count 700
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 440 place count 907 transition count 632
Deduced a syphon composed of 68 places in 2 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 576 place count 839 transition count 632
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 720 place count 767 transition count 560
Free-agglomeration rule applied 72 times.
Iterating global reduction 2 with 72 rules applied. Total rules applied 792 place count 767 transition count 488
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 864 place count 695 transition count 488
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 865 place count 694 transition count 487
Reduce places removed 204 places and 0 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 3 with 535 rules applied. Total rules applied 1400 place count 490 transition count 156
Reduce places removed 331 places and 0 transitions.
Iterating post reduction 4 with 331 rules applied. Total rules applied 1731 place count 159 transition count 156
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 52 Pre rules applied. Total rules applied 1731 place count 159 transition count 104
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 5 with 104 rules applied. Total rules applied 1835 place count 107 transition count 104
Applied a total of 1835 rules in 397 ms. Remains 107 /1127 variables (removed 1020) and now considering 104/920 (removed 816) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 398 ms. Remains : 107/1127 places, 104/920 transitions.
// Phase 1: matrix 104 rows 107 cols
[2023-03-12 15:11:20] [INFO ] Computed 54 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 9515 resets, run finished after 6923 ms. (steps per millisecond=144 ) properties (out of 1) seen :1
FORMULA AutoFlight-PT-48a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 54139 ms.
ITS solved all properties within timeout

BK_STOP 1678633887643

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-48a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutoFlight-PT-48a, 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 r009-oct2-167813598000501"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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