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.r005-oct2-167813593500685.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 itstools
Input is AutonomousCar-PT-10b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593500685
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.8K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 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 1.6M 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 AutonomousCar-PT-10b-UpperBounds-00
FORMULA_NAME AutonomousCar-PT-10b-UpperBounds-01
FORMULA_NAME AutonomousCar-PT-10b-UpperBounds-02
FORMULA_NAME AutonomousCar-PT-10b-UpperBounds-03
FORMULA_NAME AutonomousCar-PT-10b-UpperBounds-04
FORMULA_NAME AutonomousCar-PT-10b-UpperBounds-05
FORMULA_NAME AutonomousCar-PT-10b-UpperBounds-06
FORMULA_NAME AutonomousCar-PT-10b-UpperBounds-07
FORMULA_NAME AutonomousCar-PT-10b-UpperBounds-08
FORMULA_NAME AutonomousCar-PT-10b-UpperBounds-09
FORMULA_NAME AutonomousCar-PT-10b-UpperBounds-10
FORMULA_NAME AutonomousCar-PT-10b-UpperBounds-11
FORMULA_NAME AutonomousCar-PT-10b-UpperBounds-12
FORMULA_NAME AutonomousCar-PT-10b-UpperBounds-13
FORMULA_NAME AutonomousCar-PT-10b-UpperBounds-14
FORMULA_NAME AutonomousCar-PT-10b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678524582123

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-11 08:49:45] [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]
[2023-03-11 08:49:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 08:49:45] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2023-03-11 08:49:45] [INFO ] Transformed 425 places.
[2023-03-11 08:49:45] [INFO ] Transformed 2252 transitions.
[2023-03-11 08:49:45] [INFO ] Found NUPN structural information;
[2023-03-11 08:49:45] [INFO ] Parsed PT model containing 425 places and 2252 transitions and 29816 arcs in 353 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 2252 rows 425 cols
[2023-03-11 08:49:46] [INFO ] Computed 15 place invariants in 31 ms
Incomplete random walk after 10000 steps, including 76 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 16) seen :10
FORMULA AutonomousCar-PT-10b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 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 10 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :1
FORMULA AutonomousCar-PT-10b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-11 08:49:46] [INFO ] Invariant cache hit.
[2023-03-11 08:49:46] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-03-11 08:49:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:49:47] [INFO ] [Real]Absence check using state equation in 1029 ms returned sat
[2023-03-11 08:49:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:49:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-03-11 08:49:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:49:48] [INFO ] [Nat]Absence check using state equation in 707 ms returned sat
[2023-03-11 08:49:50] [INFO ] Deduced a trap composed of 15 places in 1281 ms of which 18 ms to minimize.
[2023-03-11 08:49:51] [INFO ] Deduced a trap composed of 17 places in 1141 ms of which 1 ms to minimize.
[2023-03-11 08:49:52] [INFO ] Deduced a trap composed of 17 places in 1218 ms of which 39 ms to minimize.
[2023-03-11 08:49:54] [INFO ] Deduced a trap composed of 22 places in 1316 ms of which 4 ms to minimize.
[2023-03-11 08:49:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.verifyPossible(DeadlockTester.java:916)
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-11 08:49:54] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-11 08:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:49:55] [INFO ] [Real]Absence check using state equation in 936 ms returned sat
[2023-03-11 08:49:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:49:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-11 08:49:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:49:56] [INFO ] [Nat]Absence check using state equation in 722 ms returned sat
[2023-03-11 08:49:57] [INFO ] Deduced a trap composed of 15 places in 1125 ms of which 23 ms to minimize.
[2023-03-11 08:49:58] [INFO ] Deduced a trap composed of 17 places in 897 ms of which 1 ms to minimize.
[2023-03-11 08:49:59] [INFO ] Deduced a trap composed of 17 places in 1204 ms of which 1 ms to minimize.
[2023-03-11 08:50:00] [INFO ] Deduced a trap composed of 22 places in 1054 ms of which 0 ms to minimize.
[2023-03-11 08:50:00] [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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
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-11 08:50:00] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-11 08:50:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:50:01] [INFO ] [Real]Absence check using state equation in 566 ms returned sat
[2023-03-11 08:50:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:50:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 21 ms returned sat
[2023-03-11 08:50:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:50:02] [INFO ] [Nat]Absence check using state equation in 616 ms returned sat
[2023-03-11 08:50:03] [INFO ] Deduced a trap composed of 7 places in 973 ms of which 2 ms to minimize.
[2023-03-11 08:50:03] [INFO ] Deduced a trap composed of 21 places in 686 ms of which 1 ms to minimize.
[2023-03-11 08:50:04] [INFO ] Deduced a trap composed of 56 places in 890 ms of which 0 ms to minimize.
[2023-03-11 08:50:05] [INFO ] Deduced a trap composed of 51 places in 637 ms of which 1 ms to minimize.
[2023-03-11 08:50:06] [INFO ] Deduced a trap composed of 51 places in 612 ms of which 1 ms to minimize.
[2023-03-11 08:50:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4140 ms
[2023-03-11 08:50:07] [INFO ] Computed and/alt/rep : 341/390/341 causal constraints (skipped 1910 transitions) in 937 ms.
[2023-03-11 08:50:07] [INFO ] Added : 0 causal constraints over 0 iterations in 939 ms. Result :unknown
[2023-03-11 08:50:07] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-11 08:50:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:50:07] [INFO ] [Real]Absence check using state equation in 711 ms returned sat
[2023-03-11 08:50:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:50:08] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-03-11 08:50:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:50:09] [INFO ] [Nat]Absence check using state equation in 895 ms returned sat
[2023-03-11 08:50:10] [INFO ] Deduced a trap composed of 35 places in 995 ms of which 1 ms to minimize.
[2023-03-11 08:50:11] [INFO ] Deduced a trap composed of 35 places in 961 ms of which 1 ms to minimize.
[2023-03-11 08:50:12] [INFO ] Deduced a trap composed of 35 places in 794 ms of which 0 ms to minimize.
[2023-03-11 08:50:13] [INFO ] Deduced a trap composed of 35 places in 1085 ms of which 1 ms to minimize.
[2023-03-11 08:50:13] [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.verifyPossible(DeadlockTester.java:916)
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-11 08:50:13] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 08:50:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 08:50:13] [INFO ] [Real]Absence check using state equation in 631 ms returned sat
[2023-03-11 08:50:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 08:50:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-03-11 08:50:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 08:50:15] [INFO ] [Nat]Absence check using state equation in 903 ms returned sat
[2023-03-11 08:50:15] [INFO ] Deduced a trap composed of 35 places in 848 ms of which 1 ms to minimize.
[2023-03-11 08:50:16] [INFO ] Deduced a trap composed of 50 places in 883 ms of which 0 ms to minimize.
[2023-03-11 08:50:17] [INFO ] Deduced a trap composed of 51 places in 953 ms of which 0 ms to minimize.
[2023-03-11 08:50:18] [INFO ] Deduced a trap composed of 51 places in 780 ms of which 0 ms to minimize.
[2023-03-11 08:50:19] [INFO ] Deduced a trap composed of 54 places in 962 ms of which 0 ms to minimize.
[2023-03-11 08:50: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 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.verifyPossible(DeadlockTester.java:916)
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA AutonomousCar-PT-10b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 2252/2252 transitions.
Graph (trivial) has 404 edges and 425 vertex of which 4 / 425 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1994 edges and 423 vertex of which 420 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.28 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 0 with 188 rules applied. Total rules applied 190 place count 420 transition count 2059
Reduce places removed 188 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 245 rules applied. Total rules applied 435 place count 232 transition count 2002
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 468 place count 199 transition count 2002
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 468 place count 199 transition count 1997
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 478 place count 194 transition count 1997
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 515 place count 157 transition count 1960
Iterating global reduction 3 with 37 rules applied. Total rules applied 552 place count 157 transition count 1960
Ensure Unique test removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Iterating post reduction 3 with 400 rules applied. Total rules applied 952 place count 157 transition count 1560
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 952 place count 157 transition count 1558
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 956 place count 155 transition count 1558
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 967 place count 144 transition count 1457
Iterating global reduction 4 with 11 rules applied. Total rules applied 978 place count 144 transition count 1457
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 20 rules applied. Total rules applied 998 place count 144 transition count 1437
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1008 place count 134 transition count 1437
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 1104 place count 86 transition count 1389
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1114 place count 76 transition count 1279
Iterating global reduction 6 with 10 rules applied. Total rules applied 1124 place count 76 transition count 1279
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1125 place count 76 transition count 1278
Free-agglomeration rule applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1135 place count 76 transition count 1268
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1145 place count 66 transition count 1268
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1146 place count 66 transition count 1268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1147 place count 65 transition count 1267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1148 place count 64 transition count 1267
Applied a total of 1148 rules in 1089 ms. Remains 64 /425 variables (removed 361) and now considering 1267/2252 (removed 985) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1089 ms. Remains : 64/425 places, 1267/2252 transitions.
// Phase 1: matrix 1267 rows 64 cols
[2023-03-11 08:50:20] [INFO ] Computed 12 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 4852 resets, run finished after 14052 ms. (steps per millisecond=71 ) properties (out of 4) seen :4
FORMULA AutonomousCar-PT-10b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 49505 ms.

BK_STOP 1678524635408

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="AutonomousCar-PT-10b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-10b, 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 r005-oct2-167813593500685"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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