Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r013-tall-174853743000069.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is AutoFlight-PT-12b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r013-tall-174853743000069
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 266K May 29 14:32 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-00
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-01
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-02
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-03
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-04
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-05
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-06
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-07
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-08
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-09
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-10
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-11
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-12
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-13
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-14
FORMULA_NAME AutoFlight-PT-12b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748540924177

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 17:48: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]
[2025-05-29 17:48:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:48:45] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2025-05-29 17:48:45] [INFO ] Transformed 1126 places.
[2025-05-29 17:48:45] [INFO ] Transformed 1124 transitions.
[2025-05-29 17:48:45] [INFO ] Found NUPN structural information;
[2025-05-29 17:48:45] [INFO ] Parsed PT model containing 1126 places and 1124 transitions and 2618 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1124 rows 1126 cols
[2025-05-29 17:48:45] [INFO ] Computed 76 invariants in 38 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (18 resets) in 48 ms. (204 steps per ms)
FORMULA AutoFlight-PT-12b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (10 resets) in 50 ms. (980 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-05-29 17:48:45] [INFO ] Invariant cache hit.
[2025-05-29 17:48:46] [INFO ] [Real]Absence check using 75 positive place invariants in 40 ms returned sat
[2025-05-29 17:48:46] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 96 ms returned sat
[2025-05-29 17:48:46] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2025-05-29 17:48:47] [INFO ] Deduced a trap composed of 113 places in 398 ms of which 48 ms to minimize.
[2025-05-29 17:48:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:48:47] [INFO ] [Nat]Absence check using 75 positive place invariants in 41 ms returned sat
[2025-05-29 17:48:47] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 17:48:47] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2025-05-29 17:48:48] [INFO ] Deduced a trap composed of 113 places in 292 ms of which 10 ms to minimize.
[2025-05-29 17:48:48] [INFO ] Deduced a trap composed of 43 places in 320 ms of which 5 ms to minimize.
[2025-05-29 17:48:48] [INFO ] Deduced a trap composed of 29 places in 278 ms of which 5 ms to minimize.
[2025-05-29 17:48:49] [INFO ] Deduced a trap composed of 58 places in 275 ms of which 5 ms to minimize.
[2025-05-29 17:48:49] [INFO ] Deduced a trap composed of 73 places in 284 ms of which 14 ms to minimize.
[2025-05-29 17:48:49] [INFO ] Deduced a trap composed of 37 places in 283 ms of which 5 ms to minimize.
[2025-05-29 17:48:50] [INFO ] Deduced a trap composed of 58 places in 251 ms of which 5 ms to minimize.
[2025-05-29 17:48:50] [INFO ] Deduced a trap composed of 63 places in 254 ms of which 5 ms to minimize.
[2025-05-29 17:48:50] [INFO ] Deduced a trap composed of 104 places in 262 ms of which 6 ms to minimize.
[2025-05-29 17:48:51] [INFO ] Deduced a trap composed of 65 places in 254 ms of which 5 ms to minimize.
[2025-05-29 17:48:51] [INFO ] Deduced a trap composed of 90 places in 252 ms of which 5 ms to minimize.
[2025-05-29 17:48:51] [INFO ] Deduced a trap composed of 91 places in 250 ms of which 5 ms to minimize.
[2025-05-29 17:48:52] [INFO ] Deduced a trap composed of 75 places in 235 ms of which 5 ms to minimize.
[2025-05-29 17:48:52] [INFO ] Deduced a trap composed of 79 places in 248 ms of which 5 ms to minimize.
[2025-05-29 17:48:52] [INFO ] Deduced a trap composed of 94 places in 244 ms of which 5 ms to minimize.
[2025-05-29 17:48:52] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 17:48:52] [INFO ] [Real]Absence check using 75 positive place invariants in 37 ms returned sat
[2025-05-29 17:48:52] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 17:48:53] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2025-05-29 17:48:53] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 5 ms to minimize.
[2025-05-29 17:48:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:48:53] [INFO ] [Nat]Absence check using 75 positive place invariants in 38 ms returned sat
[2025-05-29 17:48:53] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 17:48:53] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2025-05-29 17:48:54] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 5 ms to minimize.
[2025-05-29 17:48:54] [INFO ] Deduced a trap composed of 59 places in 207 ms of which 4 ms to minimize.
[2025-05-29 17:48:54] [INFO ] Deduced a trap composed of 62 places in 195 ms of which 5 ms to minimize.
[2025-05-29 17:48:54] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 4 ms to minimize.
[2025-05-29 17:48:55] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 4 ms to minimize.
[2025-05-29 17:48:55] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 4 ms to minimize.
[2025-05-29 17:48:55] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 5 ms to minimize.
[2025-05-29 17:48:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1700 ms
[2025-05-29 17:48:55] [INFO ] Computed and/alt/rep : 1121/1477/1121 causal constraints (skipped 2 transitions) in 62 ms.
Maximisation of solution failed !
Minimization took 7 ms.
[2025-05-29 17:48:58] [INFO ] [Real]Absence check using 75 positive place invariants in 40 ms returned sat
[2025-05-29 17:48:58] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-29 17:48:59] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2025-05-29 17:48:59] [INFO ] Deduced a trap composed of 29 places in 231 ms of which 4 ms to minimize.
[2025-05-29 17:48:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:48:59] [INFO ] [Nat]Absence check using 75 positive place invariants in 39 ms returned sat
[2025-05-29 17:48:59] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-29 17:48:59] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2025-05-29 17:49:00] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 4 ms to minimize.
[2025-05-29 17:49:00] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 5 ms to minimize.
[2025-05-29 17:49:00] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 4 ms to minimize.
[2025-05-29 17:49:00] [INFO ] Deduced a trap composed of 43 places in 217 ms of which 5 ms to minimize.
[2025-05-29 17:49:01] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 5 ms to minimize.
[2025-05-29 17:49:01] [INFO ] Deduced a trap composed of 54 places in 225 ms of which 5 ms to minimize.
[2025-05-29 17:49:01] [INFO ] Deduced a trap composed of 143 places in 226 ms of which 5 ms to minimize.
[2025-05-29 17:49:02] [INFO ] Deduced a trap composed of 39 places in 236 ms of which 5 ms to minimize.
[2025-05-29 17:49:02] [INFO ] Deduced a trap composed of 49 places in 224 ms of which 5 ms to minimize.
[2025-05-29 17:49:02] [INFO ] Deduced a trap composed of 50 places in 236 ms of which 7 ms to minimize.
[2025-05-29 17:49:02] [INFO ] Deduced a trap composed of 133 places in 245 ms of which 5 ms to minimize.
[2025-05-29 17:49:03] [INFO ] Deduced a trap composed of 41 places in 246 ms of which 4 ms to minimize.
[2025-05-29 17:49:03] [INFO ] Deduced a trap composed of 127 places in 234 ms of which 5 ms to minimize.
[2025-05-29 17:49:03] [INFO ] Deduced a trap composed of 137 places in 220 ms of which 4 ms to minimize.
[2025-05-29 17:49:03] [INFO ] Deduced a trap composed of 137 places in 237 ms of which 5 ms to minimize.
[2025-05-29 17:49:04] [INFO ] Deduced a trap composed of 118 places in 219 ms of which 5 ms to minimize.
[2025-05-29 17:49:04] [INFO ] Deduced a trap composed of 80 places in 234 ms of which 5 ms to minimize.
[2025-05-29 17:49:04] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 17:49:04] [INFO ] [Real]Absence check using 75 positive place invariants in 42 ms returned sat
[2025-05-29 17:49:04] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-29 17:49:05] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2025-05-29 17:49:05] [INFO ] Deduced a trap composed of 27 places in 279 ms of which 6 ms to minimize.
[2025-05-29 17:49:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:49:05] [INFO ] [Nat]Absence check using 75 positive place invariants in 38 ms returned sat
[2025-05-29 17:49:05] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 17:49:05] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2025-05-29 17:49:06] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 5 ms to minimize.
[2025-05-29 17:49:06] [INFO ] Deduced a trap composed of 47 places in 231 ms of which 4 ms to minimize.
[2025-05-29 17:49:06] [INFO ] Deduced a trap composed of 57 places in 221 ms of which 5 ms to minimize.
[2025-05-29 17:49:07] [INFO ] Deduced a trap composed of 61 places in 219 ms of which 5 ms to minimize.
[2025-05-29 17:49:07] [INFO ] Deduced a trap composed of 49 places in 233 ms of which 5 ms to minimize.
[2025-05-29 17:49:07] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 4 ms to minimize.
[2025-05-29 17:49:07] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 4 ms to minimize.
[2025-05-29 17:49:08] [INFO ] Deduced a trap composed of 66 places in 220 ms of which 5 ms to minimize.
[2025-05-29 17:49:08] [INFO ] Deduced a trap composed of 61 places in 192 ms of which 4 ms to minimize.
[2025-05-29 17:49:08] [INFO ] Deduced a trap composed of 77 places in 191 ms of which 4 ms to minimize.
[2025-05-29 17:49:08] [INFO ] Deduced a trap composed of 79 places in 191 ms of which 4 ms to minimize.
[2025-05-29 17:49:09] [INFO ] Deduced a trap composed of 79 places in 210 ms of which 4 ms to minimize.
[2025-05-29 17:49:09] [INFO ] Deduced a trap composed of 79 places in 192 ms of which 4 ms to minimize.
[2025-05-29 17:49:09] [INFO ] Deduced a trap composed of 83 places in 187 ms of which 5 ms to minimize.
[2025-05-29 17:49:09] [INFO ] Deduced a trap composed of 79 places in 183 ms of which 4 ms to minimize.
[2025-05-29 17:49:09] [INFO ] Deduced a trap composed of 90 places in 183 ms of which 4 ms to minimize.
[2025-05-29 17:49:10] [INFO ] Deduced a trap composed of 63 places in 174 ms of which 4 ms to minimize.
[2025-05-29 17:49:10] [INFO ] Deduced a trap composed of 71 places in 195 ms of which 4 ms to minimize.
[2025-05-29 17:49:10] [INFO ] Deduced a trap composed of 83 places in 187 ms of which 4 ms to minimize.
[2025-05-29 17:49:10] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 17:49:10] [INFO ] [Real]Absence check using 75 positive place invariants in 40 ms returned sat
[2025-05-29 17:49:10] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 4 ms returned sat
[2025-05-29 17:49:11] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2025-05-29 17:49:11] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 4 ms to minimize.
[2025-05-29 17:49:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:49:11] [INFO ] [Nat]Absence check using 75 positive place invariants in 38 ms returned sat
[2025-05-29 17:49:11] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-29 17:49:12] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2025-05-29 17:49:12] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 5 ms to minimize.
[2025-05-29 17:49:12] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 4 ms to minimize.
[2025-05-29 17:49:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 513 ms
[2025-05-29 17:49:12] [INFO ] Computed and/alt/rep : 1121/1477/1121 causal constraints (skipped 2 transitions) in 60 ms.
[2025-05-29 17:49: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 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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 1126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 442 transitions
Trivial Post-agglo rules discarded 442 transitions
Performed 442 trivial Post agglomeration. Transition count delta: 442
Iterating post reduction 0 with 442 rules applied. Total rules applied 442 place count 1126 transition count 682
Reduce places removed 442 places and 0 transitions.
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 524 rules applied. Total rules applied 966 place count 684 transition count 600
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 26 rules applied. Total rules applied 992 place count 660 transition count 598
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 995 place count 658 transition count 597
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 149 Pre rules applied. Total rules applied 995 place count 658 transition count 448
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 4 with 298 rules applied. Total rules applied 1293 place count 509 transition count 448
Discarding 108 places :
Symmetric choice reduction at 4 with 108 rule applications. Total rules 1401 place count 401 transition count 340
Iterating global reduction 4 with 108 rules applied. Total rules applied 1509 place count 401 transition count 340
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 1509 place count 401 transition count 305
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 1579 place count 366 transition count 305
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 1753 place count 279 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1754 place count 279 transition count 217
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1756 place count 278 transition count 216
Free-agglomeration rule applied 48 times.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1804 place count 278 transition count 168
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 4 with 48 rules applied. Total rules applied 1852 place count 230 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1853 place count 229 transition count 167
Reduce places removed 45 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 5 with 120 rules applied. Total rules applied 1973 place count 184 transition count 92
Reduce places removed 75 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 76 rules applied. Total rules applied 2049 place count 109 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2050 place count 108 transition count 91
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 26 Pre rules applied. Total rules applied 2050 place count 108 transition count 65
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 8 with 52 rules applied. Total rules applied 2102 place count 82 transition count 65
Applied a total of 2102 rules in 207 ms. Remains 82 /1126 variables (removed 1044) and now considering 65/1124 (removed 1059) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 82/1126 places, 65/1124 transitions.
// Phase 1: matrix 65 rows 82 cols
[2025-05-29 17:49:16] [INFO ] Computed 31 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1681 ms. (594 steps per ms)
FORMULA AutoFlight-PT-12b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-12b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 634 ms. (1574 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-05-29 17:49:19] [INFO ] Flatten gal took : 30 ms
[2025-05-29 17:49:19] [INFO ] Flatten gal took : 9 ms
[2025-05-29 17:49:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4788438470051255010.gal : 6 ms
[2025-05-29 17:49:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8926603120870107068.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4788438470051255010.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8926603120870107068.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 34030 ms.

BK_STOP 1748540959379

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="AutoFlight-PT-12b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is AutoFlight-PT-12b, 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 r013-tall-174853743000069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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