Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 18:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 18:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1716325962674

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-21 21:12: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]
[2024-05-21 21:12:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:12:45] [INFO ] Load time of PNML (sax parser for PT used): 454 ms
[2024-05-21 21:12:45] [INFO ] Transformed 425 places.
[2024-05-21 21:12:45] [INFO ] Transformed 2252 transitions.
[2024-05-21 21:12:45] [INFO ] Found NUPN structural information;
[2024-05-21 21:12:45] [INFO ] Parsed PT model containing 425 places and 2252 transitions and 29816 arcs in 590 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 2252 rows 425 cols
[2024-05-21 21:12:46] [INFO ] Computed 15 invariants in 75 ms
Incomplete random walk after 10000 steps, including 78 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 16) seen :12
FORMULA AutonomousCar-PT-10b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-06 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-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
[2024-05-21 21:12:46] [INFO ] Invariant cache hit.
[2024-05-21 21:12:46] [INFO ] [Real]Absence check using 15 positive place invariants in 21 ms returned sat
[2024-05-21 21:12:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:12:48] [INFO ] [Real]Absence check using state equation in 1217 ms returned sat
[2024-05-21 21:12:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:12:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 15 ms returned sat
[2024-05-21 21:12:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:12:49] [INFO ] [Nat]Absence check using state equation in 1102 ms returned sat
[2024-05-21 21:12:51] [INFO ] Deduced a trap composed of 15 places in 1614 ms of which 6 ms to minimize.
[2024-05-21 21:12:52] [INFO ] Deduced a trap composed of 17 places in 1600 ms of which 1 ms to minimize.
[2024-05-21 21:12:54] [INFO ] Deduced a trap composed of 17 places in 1511 ms of which 3 ms to minimize.
[2024-05-21 21:12: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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-21 21:12:54] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2024-05-21 21:12:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:12:55] [INFO ] [Real]Absence check using state equation in 1168 ms returned sat
[2024-05-21 21:12:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:12:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 17 ms returned sat
[2024-05-21 21:12:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:12:57] [INFO ] [Nat]Absence check using state equation in 1092 ms returned sat
[2024-05-21 21:12:58] [INFO ] Deduced a trap composed of 15 places in 1437 ms of which 2 ms to minimize.
[2024-05-21 21:13:00] [INFO ] Deduced a trap composed of 17 places in 1514 ms of which 2 ms to minimize.
[2024-05-21 21:13:01] [INFO ] Deduced a trap composed of 17 places in 1462 ms of which 1 ms to minimize.
[2024-05-21 21:13:01] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-21 21:13:01] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2024-05-21 21:13:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:13:02] [INFO ] [Real]Absence check using state equation in 1050 ms returned sat
[2024-05-21 21:13:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:13:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 16 ms returned sat
[2024-05-21 21:13:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:13:03] [INFO ] [Nat]Absence check using state equation in 1022 ms returned sat
[2024-05-21 21:13:05] [INFO ] Deduced a trap composed of 35 places in 1853 ms of which 1 ms to minimize.
[2024-05-21 21:13:07] [INFO ] Deduced a trap composed of 17 places in 1486 ms of which 1 ms to minimize.
[2024-05-21 21:13:08] [INFO ] Deduced a trap composed of 22 places in 1325 ms of which 1 ms to minimize.
[2024-05-21 21:13:08] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-21 21:13:09] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned sat
[2024-05-21 21:13:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:13:10] [INFO ] [Real]Absence check using state equation in 1143 ms returned sat
[2024-05-21 21:13:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:13:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 15 ms returned sat
[2024-05-21 21:13:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:13:11] [INFO ] [Nat]Absence check using state equation in 1207 ms returned sat
[2024-05-21 21:13:12] [INFO ] Deduced a trap composed of 35 places in 1140 ms of which 1 ms to minimize.
[2024-05-21 21:13:13] [INFO ] Deduced a trap composed of 35 places in 1120 ms of which 1 ms to minimize.
[2024-05-21 21:13:15] [INFO ] Deduced a trap composed of 35 places in 1003 ms of which 0 ms to minimize.
[2024-05-21 21:13:16] [INFO ] Deduced a trap composed of 35 places in 1002 ms of which 1 ms to minimize.
[2024-05-21 21:13:16] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
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 400 edges and 425 vertex of which 4 / 425 are part of one of the 2 SCC in 6 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 421 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.35 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 185 transitions
Trivial Post-agglo rules discarded 185 transitions
Performed 185 trivial Post agglomeration. Transition count delta: 185
Iterating post reduction 0 with 185 rules applied. Total rules applied 187 place count 421 transition count 2063
Reduce places removed 185 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 242 rules applied. Total rules applied 429 place count 236 transition count 2006
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 34 rules applied. Total rules applied 463 place count 203 transition count 2005
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 464 place count 202 transition count 2005
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 464 place count 202 transition count 2001
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 472 place count 198 transition count 2001
Discarding 38 places :
Symmetric choice reduction at 4 with 38 rule applications. Total rules 510 place count 160 transition count 1963
Iterating global reduction 4 with 38 rules applied. Total rules applied 548 place count 160 transition count 1963
Ensure Unique test removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Iterating post reduction 4 with 400 rules applied. Total rules applied 948 place count 160 transition count 1563
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 948 place count 160 transition count 1561
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 952 place count 158 transition count 1561
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 963 place count 147 transition count 1460
Iterating global reduction 5 with 11 rules applied. Total rules applied 974 place count 147 transition count 1460
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 5 with 20 rules applied. Total rules applied 994 place count 147 transition count 1440
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1004 place count 137 transition count 1440
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 7 with 96 rules applied. Total rules applied 1100 place count 89 transition count 1392
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1110 place count 79 transition count 1282
Iterating global reduction 7 with 10 rules applied. Total rules applied 1120 place count 79 transition count 1282
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 1131 place count 79 transition count 1271
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1142 place count 68 transition count 1271
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1143 place count 67 transition count 1270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1144 place count 66 transition count 1270
Applied a total of 1144 rules in 843 ms. Remains 66 /425 variables (removed 359) and now considering 1270/2252 (removed 982) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 844 ms. Remains : 66/425 places, 1270/2252 transitions.
// Phase 1: matrix 1270 rows 66 cols
[2024-05-21 21:13:16] [INFO ] Computed 12 invariants in 16 ms
Incomplete random walk after 1000000 steps, including 4587 resets, run finished after 19884 ms. (steps per millisecond=50 ) properties (out of 4) seen :4
FORMULA AutonomousCar-PT-10b-UpperBounds-12 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-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 51621 ms.

BK_STOP 1716326018125

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-10b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is 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 r043-smll-171620180400231"
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 ;