Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729400517.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 itstools
Input is AutoFlight-PT-05b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729400517
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K 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 113K 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-05b-UpperBounds-00
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-01
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-02
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-03
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-04
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-05
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-06
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-07
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-08
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-09
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-10
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-11
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-12
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-13
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-14
FORMULA_NAME AutoFlight-PT-05b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748626836027

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-05-30 17:40:37] [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-30 17:40:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 17:40:37] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2025-05-30 17:40:37] [INFO ] Transformed 482 places.
[2025-05-30 17:40:37] [INFO ] Transformed 480 transitions.
[2025-05-30 17:40:37] [INFO ] Found NUPN structural information;
[2025-05-30 17:40:37] [INFO ] Parsed PT model containing 482 places and 480 transitions and 1120 arcs in 180 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 480 rows 482 cols
[2025-05-30 17:40:37] [INFO ] Computed 34 invariants in 19 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 (41 resets) in 74 ms. (133 steps per ms)
FORMULA AutoFlight-PT-05b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30002 steps (11 resets) in 29 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-05-30 17:40:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 17:40:37] [INFO ] [Real]Absence check using 33 positive place invariants in 40 ms returned sat
[2025-05-30 17:40:37] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 8 ms returned sat
[2025-05-30 17:40:38] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:38] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 36 ms to minimize.
[2025-05-30 17:40:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 17:40:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 16 ms returned sat
[2025-05-30 17:40:38] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-30 17:40:38] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:38] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:38] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:39] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:39] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:39] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:39] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:39] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:39] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:39] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:40] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:40] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:40] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:40] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:40] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:40] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:40] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:41] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:41] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:41] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:41] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:41] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:41] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:41] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:41] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:42] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 24 ms to minimize.
[2025-05-30 17:40:42] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3517 ms
[2025-05-30 17:40:42] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 28 ms.
[2025-05-30 17:40:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 17:40:43] [INFO ] [Real]Absence check using 33 positive place invariants in 17 ms returned sat
[2025-05-30 17:40:43] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2025-05-30 17:40:43] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:43] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 14 ms to minimize.
[2025-05-30 17:40:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 17:40:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 17 ms returned sat
[2025-05-30 17:40:43] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 5 ms returned sat
[2025-05-30 17:40:44] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:44] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:44] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:44] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:44] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:44] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:44] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:45] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:45] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:45] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:45] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 22 ms to minimize.
[2025-05-30 17:40:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1407 ms
[2025-05-30 17:40:45] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 24 ms.
[2025-05-30 17:40:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 17:40:48] [INFO ] [Real]Absence check using 33 positive place invariants in 16 ms returned sat
[2025-05-30 17:40:48] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-30 17:40:49] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:49] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 7 ms to minimize.
[2025-05-30 17:40:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-30 17:40:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 17 ms returned sat
[2025-05-30 17:40:49] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2025-05-30 17:40:49] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:40:49] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 7 ms to minimize.
[2025-05-30 17:40:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2025-05-30 17:40:49] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 24 ms.
[2025-05-30 17:40:52] [INFO ] Added : 431 causal constraints over 87 iterations in 3064 ms. Result :sat
Minimization took 261 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1] Max Struct:[1, 1, 1]
Support contains 3 out of 482 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482/482 places, 480/480 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 185 place count 482 transition count 295
Reduce places removed 185 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 219 rules applied. Total rules applied 404 place count 297 transition count 261
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 415 place count 287 transition count 260
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 416 place count 286 transition count 260
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 65 Pre rules applied. Total rules applied 416 place count 286 transition count 195
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 546 place count 221 transition count 195
Discarding 45 places :
Symmetric choice reduction at 4 with 45 rule applications. Total rules 591 place count 176 transition count 150
Iterating global reduction 4 with 45 rules applied. Total rules applied 636 place count 176 transition count 150
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 636 place count 176 transition count 136
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 664 place count 162 transition count 136
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 742 place count 123 transition count 97
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 743 place count 123 transition count 96
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 745 place count 122 transition count 95
Free-agglomeration rule applied 20 times.
Iterating global reduction 4 with 20 rules applied. Total rules applied 765 place count 122 transition count 75
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 785 place count 102 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 786 place count 101 transition count 74
Reduce places removed 19 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 5 with 48 rules applied. Total rules applied 834 place count 82 transition count 45
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 30 rules applied. Total rules applied 864 place count 53 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 865 place count 52 transition count 44
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 13 Pre rules applied. Total rules applied 865 place count 52 transition count 31
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 891 place count 39 transition count 31
Applied a total of 891 rules in 98 ms. Remains 39 /482 variables (removed 443) and now considering 31/480 (removed 449) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 39/482 places, 31/480 transitions.
// Phase 1: matrix 31 rows 39 cols
[2025-05-30 17:40:53] [INFO ] Computed 15 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1] Max Struct:[1, 1, 1]
FORMULA AutoFlight-PT-05b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 920 ms. (1085 steps per ms)
FORMULA AutoFlight-PT-05b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-05b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 400 ms. (2493 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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-30 17:40:54] [INFO ] Flatten gal took : 23 ms
[2025-05-30 17:40:54] [INFO ] Flatten gal took : 7 ms
[2025-05-30 17:40:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11924259806960224175.gal : 4 ms
[2025-05-30 17:40:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14034248559402268011.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11924259806960224175.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14034248559402268011.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 17526 ms.

BK_STOP 1748626854793

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-05b"
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-5832"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-05b, 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 r002-tall-174853729400517"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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