About the Execution of 2023-gold for PolyORBLF-PT-S02J04T08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
440.151 | 36523.00 | 47833.00 | 63.50 | 1 1 0 1 0 1 2 1 1 1 1 0 10 2 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460500141.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBLF-PT-S02J04T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460500141
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 17K Apr 11 16:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 11 16:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 11 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 146K Apr 11 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 539K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 717K May 18 16:43 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 PolyORBLF-PT-S02J04T08-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J04T08-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717114957239
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=PolyORBLF-PT-S02J04T08
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-31 00:22:38] [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-31 00:22:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 00:22:39] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-05-31 00:22:39] [INFO ] Transformed 614 places.
[2024-05-31 00:22:39] [INFO ] Transformed 1242 transitions.
[2024-05-31 00:22:39] [INFO ] Parsed PT model containing 614 places and 1242 transitions and 5732 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Normalized transition count is 1098 out of 1114 initially.
// Phase 1: matrix 1098 rows 614 cols
[2024-05-31 00:22:39] [INFO ] Computed 50 invariants in 60 ms
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 5 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 15) seen :23
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :22
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :22
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :22
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :22
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :21
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :22
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :21
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :22
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :22
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :21
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :21
[2024-05-31 00:22:39] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 614 cols
[2024-05-31 00:22:39] [INFO ] Computed 50 invariants in 60 ms
[2024-05-31 00:22:39] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned unsat
[2024-05-31 00:22:40] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned unsat
[2024-05-31 00:22:40] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-05-31 00:22:40] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 28 ms returned sat
[2024-05-31 00:22:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:22:40] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2024-05-31 00:22:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:22:40] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-31 00:22:40] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 19 ms returned sat
[2024-05-31 00:22:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:22:43] [INFO ] [Nat]Absence check using state equation in 2566 ms returned sat
[2024-05-31 00:22:43] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-31 00:22:45] [INFO ] [Nat]Added 96 Read/Feed constraints in 1913 ms returned sat
[2024-05-31 00:22:45] [INFO ] Deduced a trap composed of 269 places in 263 ms of which 4 ms to minimize.
[2024-05-31 00:22:46] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 1 ms to minimize.
[2024-05-31 00:22:46] [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-31 00:22:46] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-05-31 00:22:46] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 14 ms returned sat
[2024-05-31 00:22:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:22:48] [INFO ] [Real]Absence check using state equation in 2638 ms returned sat
[2024-05-31 00:22:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:22:48] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-31 00:22:48] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 25 ms returned sat
[2024-05-31 00:22:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:22:51] [INFO ] [Nat]Absence check using state equation in 2195 ms returned sat
[2024-05-31 00:22:52] [INFO ] [Nat]Added 96 Read/Feed constraints in 1357 ms returned sat
[2024-05-31 00:22:52] [INFO ] Deduced a trap composed of 19 places in 366 ms of which 2 ms to minimize.
[2024-05-31 00:22:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 710 ms
[2024-05-31 00:22:53] [INFO ] Computed and/alt/rep : 728/2582/720 causal constraints (skipped 376 transitions) in 123 ms.
[2024-05-31 00:22:53] [INFO ] Added : 10 causal constraints over 2 iterations in 634 ms. Result :unknown
[2024-05-31 00:22:53] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-31 00:22:53] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 9 ms returned unsat
[2024-05-31 00:22:54] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-31 00:22:54] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 30 ms returned unsat
[2024-05-31 00:22:54] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-31 00:22:54] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 9 ms returned unsat
[2024-05-31 00:22:54] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-31 00:22:54] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 9 ms returned unsat
[2024-05-31 00:22:54] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-31 00:22:54] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 8 ms returned unsat
[2024-05-31 00:22:54] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-31 00:22:54] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 8 ms returned unsat
[2024-05-31 00:22:54] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-31 00:22:54] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 20 ms returned sat
[2024-05-31 00:22:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:22:55] [INFO ] [Real]Absence check using state equation in 796 ms returned sat
[2024-05-31 00:22:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:22:55] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-31 00:22:55] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 36 ms returned sat
[2024-05-31 00:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:23:00] [INFO ] [Nat]Absence check using state equation in 4853 ms returned unknown
[2024-05-31 00:23:00] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-31 00:23:00] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 19 ms returned unsat
[2024-05-31 00:23:00] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-31 00:23:00] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 46 ms returned sat
[2024-05-31 00:23:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:23:02] [INFO ] [Real]Absence check using state equation in 1350 ms returned sat
[2024-05-31 00:23:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:23:02] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-31 00:23:02] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 24 ms returned sat
[2024-05-31 00:23:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:23:03] [INFO ] [Nat]Absence check using state equation in 1518 ms returned sat
[2024-05-31 00:23:05] [INFO ] [Nat]Added 96 Read/Feed constraints in 1864 ms returned sat
[2024-05-31 00:23:06] [INFO ] Deduced a trap composed of 19 places in 303 ms of which 1 ms to minimize.
[2024-05-31 00:23:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1346 ms
[2024-05-31 00:23:07] [INFO ] Computed and/alt/rep : 728/2582/720 causal constraints (skipped 376 transitions) in 113 ms.
[2024-05-31 00:23:07] [INFO ] Added : 0 causal constraints over 0 iterations in 151 ms. Result :unknown
[2024-05-31 00:23:07] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-31 00:23:07] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 3, 24, 1, 2, 1, 1, 1, 1, 4, 10, -1, 1] Max seen :[1, 1, 0, 0, 1, 2, 1, 1, 1, 1, 0, 10, 2, 1]
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 11 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 612 transition count 1044
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 542 transition count 1043
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 541 transition count 1043
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 144 place count 541 transition count 979
Deduced a syphon composed of 64 places in 3 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 272 place count 477 transition count 979
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 400 place count 413 transition count 915
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 416 place count 413 transition count 899
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 432 place count 397 transition count 899
Applied a total of 432 rules in 204 ms. Remains 397 /614 variables (removed 217) and now considering 899/1114 (removed 215) transitions.
[2024-05-31 00:23:07] [INFO ] Flow matrix only has 883 transitions (discarded 16 similar events)
// Phase 1: matrix 883 rows 397 cols
[2024-05-31 00:23:07] [INFO ] Computed 48 invariants in 19 ms
[2024-05-31 00:23:08] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 88 transitions.
Found 88 dead transitions using SMT.
Drop transitions removed 88 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 397/614 places, 811/1114 transitions.
Reduce places removed 1 places and 16 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 396 transition count 795
Reduce places removed 7 places and 16 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 8 place count 389 transition count 779
Deduced a syphon composed of 10 places in 1 ms
Applied a total of 8 rules in 35 ms. Remains 389 /397 variables (removed 8) and now considering 779/811 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 832 ms. Remains : 389/614 places, 779/1114 transitions.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 763 out of 779 initially.
// Phase 1: matrix 763 rows 379 cols
[2024-05-31 00:23:08] [INFO ] Computed 48 invariants in 11 ms
Incomplete random walk after 1000000 steps, including 398 resets, run finished after 3461 ms. (steps per millisecond=288 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 152 resets, run finished after 1571 ms. (steps per millisecond=636 ) properties (out of 1) seen :2
[2024-05-31 00:23:13] [INFO ] Flow matrix only has 763 transitions (discarded 16 similar events)
// Phase 1: matrix 763 rows 379 cols
[2024-05-31 00:23:13] [INFO ] Computed 48 invariants in 23 ms
[2024-05-31 00:23:13] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-31 00:23:13] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 12 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 24, 4, -1] Max seen :[2, 0, 0, 2]
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 34703 ms.
BK_STOP 1717114993762
--------------------
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="PolyORBLF-PT-S02J04T08"
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 PolyORBLF-PT-S02J04T08, 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 r307-tajo-171654460500141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T08.tgz
mv PolyORBLF-PT-S02J04T08 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 '
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 ;